./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:27:29,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:27:29,617 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 13:27:29,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:27:29,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:27:29,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:27:29,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:27:29,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:27:29,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:27:29,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:27:29,651 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:27:29,652 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:27:29,652 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:27:29,653 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:27:29,653 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:27:29,654 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:27:29,654 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:27:29,655 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:27:29,655 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:27:29,656 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:27:29,656 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:27:29,657 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:27:29,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:27:29,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:27:29,659 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:27:29,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:27:29,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:27:29,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:27:29,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:27:29,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:27:29,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:27:29,662 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:27:29,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:27:29,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:27:29,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:27:29,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:27:29,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:27:29,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:27:29,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:27:29,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:27:29,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:27:29,664 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:27:29,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:27:29,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:27:29,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:27:29,665 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:27:29,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:27:29,665 INFO L153 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_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/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_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2023-12-02 13:27:29,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:27:29,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:27:29,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:27:29,901 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:27:29,902 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:27:29,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2023-12-02 13:27:32,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:27:32,762 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 13:27:32,947 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:27:32,947 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2023-12-02 13:27:32,964 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/data/f206370d6/717784c0646747fe9212b7d0853a0b1b/FLAG490f220be [2023-12-02 13:27:32,978 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/data/f206370d6/717784c0646747fe9212b7d0853a0b1b [2023-12-02 13:27:32,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:27:32,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:27:32,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:27:32,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:27:32,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:27:32,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:27:32" (1/1) ... [2023-12-02 13:27:32,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4659efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:32, skipping insertion in model container [2023-12-02 13:27:32,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:27:32" (1/1) ... [2023-12-02 13:27:33,037 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:27:33,162 WARN L240 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_20e73dda-e11f-4452-9521-fc3352d1af60/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2023-12-02 13:27:33,217 WARN L240 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_20e73dda-e11f-4452-9521-fc3352d1af60/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2023-12-02 13:27:33,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:27:33,267 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:27:33,277 WARN L240 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_20e73dda-e11f-4452-9521-fc3352d1af60/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2023-12-02 13:27:33,303 WARN L240 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_20e73dda-e11f-4452-9521-fc3352d1af60/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2023-12-02 13:27:33,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:27:33,347 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:27:33,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33 WrapperNode [2023-12-02 13:27:33,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:27:33,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:27:33,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:27:33,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:27:33,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,398 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 508 [2023-12-02 13:27:33,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:27:33,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:27:33,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:27:33,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:27:33,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:27:33,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:27:33,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:27:33,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:27:33,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (1/1) ... [2023-12-02 13:27:33,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:27:33,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:33,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:27:33,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:27:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:27:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-02 13:27:33,524 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-02 13:27:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-02 13:27:33,524 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-02 13:27:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-02 13:27:33,524 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-02 13:27:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-02 13:27:33,524 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-02 13:27:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-02 13:27:33,525 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-02 13:27:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-02 13:27:33,525 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-02 13:27:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-02 13:27:33,525 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-02 13:27:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-02 13:27:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-02 13:27:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-02 13:27:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-02 13:27:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-02 13:27:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-02 13:27:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-02 13:27:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-02 13:27:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:27:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-02 13:27:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-02 13:27:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-02 13:27:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-02 13:27:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:27:33,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:27:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-02 13:27:33,528 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-02 13:27:33,614 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:27:33,616 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:27:34,043 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2023-12-02 13:27:34,043 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2023-12-02 13:27:34,087 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:27:34,288 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:27:34,288 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-02 13:27:34,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:27:34 BoogieIcfgContainer [2023-12-02 13:27:34,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:27:34,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:27:34,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:27:34,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:27:34,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:27:32" (1/3) ... [2023-12-02 13:27:34,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222e3209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:27:34, skipping insertion in model container [2023-12-02 13:27:34,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:27:33" (2/3) ... [2023-12-02 13:27:34,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222e3209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:27:34, skipping insertion in model container [2023-12-02 13:27:34,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:27:34" (3/3) ... [2023-12-02 13:27:34,298 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2023-12-02 13:27:34,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:27:34,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 13:27:34,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:27:34,376 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27fbc724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:27:34,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 13:27:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 117 states have internal predecessors, (164), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-02 13:27:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:27:34,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:34,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:34,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:34,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1077523256, now seen corresponding path program 1 times [2023-12-02 13:27:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:34,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263366852] [2023-12-02 13:27:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:27:34,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:34,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263366852] [2023-12-02 13:27:34,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263366852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:34,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:34,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:27:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022048856] [2023-12-02 13:27:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:34,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:27:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:27:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:27:34,774 INFO L87 Difference]: Start difference. First operand has 160 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 117 states have internal predecessors, (164), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 13:27:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:35,450 INFO L93 Difference]: Finished difference Result 589 states and 865 transitions. [2023-12-02 13:27:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:27:35,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-02 13:27:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:35,468 INFO L225 Difference]: With dead ends: 589 [2023-12-02 13:27:35,468 INFO L226 Difference]: Without dead ends: 424 [2023-12-02 13:27:35,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:35,477 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 569 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:35,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 541 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 13:27:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-12-02 13:27:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 413. [2023-12-02 13:27:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 297 states have (on average 1.367003367003367) internal successors, (406), 304 states have internal predecessors, (406), 77 states have call successors, (77), 38 states have call predecessors, (77), 37 states have return successors, (97), 72 states have call predecessors, (97), 75 states have call successors, (97) [2023-12-02 13:27:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 580 transitions. [2023-12-02 13:27:35,575 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 580 transitions. Word has length 37 [2023-12-02 13:27:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:35,576 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 580 transitions. [2023-12-02 13:27:35,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 13:27:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 580 transitions. [2023-12-02 13:27:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 13:27:35,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:35,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:35,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:27:35,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:35,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -490623936, now seen corresponding path program 1 times [2023-12-02 13:27:35,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:35,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020095211] [2023-12-02 13:27:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:27:35,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020095211] [2023-12-02 13:27:35,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020095211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:35,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:35,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:27:35,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100195339] [2023-12-02 13:27:35,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:35,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:27:35,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:35,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:27:35,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:27:35,671 INFO L87 Difference]: Start difference. First operand 413 states and 580 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:27:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:35,992 INFO L93 Difference]: Finished difference Result 613 states and 857 transitions. [2023-12-02 13:27:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:27:35,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2023-12-02 13:27:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:35,998 INFO L225 Difference]: With dead ends: 613 [2023-12-02 13:27:35,999 INFO L226 Difference]: Without dead ends: 542 [2023-12-02 13:27:36,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:27:36,002 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 272 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:36,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 401 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:27:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-12-02 13:27:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 531. [2023-12-02 13:27:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 381 states have (on average 1.3595800524934383) internal successors, (518), 388 states have internal predecessors, (518), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (120), 92 states have call predecessors, (120), 95 states have call successors, (120) [2023-12-02 13:27:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 735 transitions. [2023-12-02 13:27:36,074 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 735 transitions. Word has length 44 [2023-12-02 13:27:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:36,075 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 735 transitions. [2023-12-02 13:27:36,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:27:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 735 transitions. [2023-12-02 13:27:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 13:27:36,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:36,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:36,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:27:36,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:36,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1311100331, now seen corresponding path program 1 times [2023-12-02 13:27:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951748901] [2023-12-02 13:27:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:27:36,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951748901] [2023-12-02 13:27:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951748901] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:36,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:36,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:27:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299282857] [2023-12-02 13:27:36,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:36,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:27:36,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:27:36,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:36,185 INFO L87 Difference]: Start difference. First operand 531 states and 735 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:27:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:36,913 INFO L93 Difference]: Finished difference Result 1068 states and 1458 transitions. [2023-12-02 13:27:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:27:36,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2023-12-02 13:27:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:36,918 INFO L225 Difference]: With dead ends: 1068 [2023-12-02 13:27:36,918 INFO L226 Difference]: Without dead ends: 602 [2023-12-02 13:27:36,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:27:36,922 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 660 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:36,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 726 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 13:27:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2023-12-02 13:27:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 517. [2023-12-02 13:27:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 367 states have (on average 1.3215258855585832) internal successors, (485), 374 states have internal predecessors, (485), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (117), 92 states have call predecessors, (117), 95 states have call successors, (117) [2023-12-02 13:27:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 699 transitions. [2023-12-02 13:27:36,984 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 699 transitions. Word has length 45 [2023-12-02 13:27:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:36,985 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 699 transitions. [2023-12-02 13:27:36,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:27:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 699 transitions. [2023-12-02 13:27:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 13:27:36,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:36,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:36,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:27:36,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:36,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2080130632, now seen corresponding path program 1 times [2023-12-02 13:27:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609361924] [2023-12-02 13:27:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:27:37,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609361924] [2023-12-02 13:27:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609361924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:27:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333338554] [2023-12-02 13:27:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:37,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:27:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:37,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:27:37,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:37,073 INFO L87 Difference]: Start difference. First operand 517 states and 699 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:27:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:37,705 INFO L93 Difference]: Finished difference Result 983 states and 1307 transitions. [2023-12-02 13:27:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:27:37,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2023-12-02 13:27:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:37,712 INFO L225 Difference]: With dead ends: 983 [2023-12-02 13:27:37,712 INFO L226 Difference]: Without dead ends: 806 [2023-12-02 13:27:37,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:27:37,714 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 568 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:37,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 687 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 13:27:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2023-12-02 13:27:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 781. [2023-12-02 13:27:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 548 states have (on average 1.2846715328467153) internal successors, (704), 555 states have internal predecessors, (704), 146 states have call successors, (146), 86 states have call predecessors, (146), 85 states have return successors, (183), 141 states have call predecessors, (183), 144 states have call successors, (183) [2023-12-02 13:27:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1033 transitions. [2023-12-02 13:27:37,793 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1033 transitions. Word has length 46 [2023-12-02 13:27:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:37,794 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1033 transitions. [2023-12-02 13:27:37,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:27:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1033 transitions. [2023-12-02 13:27:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 13:27:37,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:37,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:37,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 13:27:37,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:37,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash -691349149, now seen corresponding path program 1 times [2023-12-02 13:27:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481829038] [2023-12-02 13:27:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:27:37,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:37,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481829038] [2023-12-02 13:27:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481829038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:37,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:27:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902029431] [2023-12-02 13:27:37,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:37,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:37,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:37,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:27:37,846 INFO L87 Difference]: Start difference. First operand 781 states and 1033 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 13:27:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:37,946 INFO L93 Difference]: Finished difference Result 782 states and 1034 transitions. [2023-12-02 13:27:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:37,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2023-12-02 13:27:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:37,950 INFO L225 Difference]: With dead ends: 782 [2023-12-02 13:27:37,950 INFO L226 Difference]: Without dead ends: 338 [2023-12-02 13:27:37,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:27:37,953 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:37,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 161 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:27:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-12-02 13:27:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2023-12-02 13:27:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 250 states have internal predecessors, (332), 61 states have call successors, (61), 30 states have call predecessors, (61), 30 states have return successors, (83), 58 states have call predecessors, (83), 61 states have call successors, (83) [2023-12-02 13:27:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 476 transitions. [2023-12-02 13:27:37,985 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 476 transitions. Word has length 50 [2023-12-02 13:27:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:37,985 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 476 transitions. [2023-12-02 13:27:37,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 13:27:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 476 transitions. [2023-12-02 13:27:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-02 13:27:37,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:37,987 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:27:37,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 13:27:37,988 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:37,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 620412707, now seen corresponding path program 1 times [2023-12-02 13:27:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842734312] [2023-12-02 13:27:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:27:38,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:38,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842734312] [2023-12-02 13:27:38,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842734312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:38,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:38,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:27:38,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683811336] [2023-12-02 13:27:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:38,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:27:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:38,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:27:38,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:38,287 INFO L87 Difference]: Start difference. First operand 338 states and 476 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 13:27:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:38,604 INFO L93 Difference]: Finished difference Result 874 states and 1243 transitions. [2023-12-02 13:27:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:27:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2023-12-02 13:27:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:38,608 INFO L225 Difference]: With dead ends: 874 [2023-12-02 13:27:38,609 INFO L226 Difference]: Without dead ends: 543 [2023-12-02 13:27:38,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:27:38,611 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 213 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:38,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 328 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:27:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2023-12-02 13:27:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 523. [2023-12-02 13:27:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 380 states have (on average 1.331578947368421) internal successors, (506), 386 states have internal predecessors, (506), 94 states have call successors, (94), 48 states have call predecessors, (94), 48 states have return successors, (131), 89 states have call predecessors, (131), 94 states have call successors, (131) [2023-12-02 13:27:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 731 transitions. [2023-12-02 13:27:38,651 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 731 transitions. Word has length 67 [2023-12-02 13:27:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:38,652 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 731 transitions. [2023-12-02 13:27:38,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 13:27:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 731 transitions. [2023-12-02 13:27:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 13:27:38,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:38,654 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:27:38,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 13:27:38,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:38,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1636739048, now seen corresponding path program 1 times [2023-12-02 13:27:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867794689] [2023-12-02 13:27:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:27:38,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:38,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867794689] [2023-12-02 13:27:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867794689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:27:38,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362053793] [2023-12-02 13:27:38,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:38,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:27:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:38,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:27:38,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:38,901 INFO L87 Difference]: Start difference. First operand 523 states and 731 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 13:27:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:39,189 INFO L93 Difference]: Finished difference Result 1547 states and 2187 transitions. [2023-12-02 13:27:39,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:27:39,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2023-12-02 13:27:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:39,197 INFO L225 Difference]: With dead ends: 1547 [2023-12-02 13:27:39,197 INFO L226 Difference]: Without dead ends: 1031 [2023-12-02 13:27:39,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:27:39,200 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 221 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:39,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 226 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:27:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-12-02 13:27:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 989. [2023-12-02 13:27:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 716 states have (on average 1.3072625698324023) internal successors, (936), 727 states have internal predecessors, (936), 176 states have call successors, (176), 96 states have call predecessors, (176), 96 states have return successors, (243), 166 states have call predecessors, (243), 176 states have call successors, (243) [2023-12-02 13:27:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1355 transitions. [2023-12-02 13:27:39,305 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1355 transitions. Word has length 69 [2023-12-02 13:27:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:39,306 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1355 transitions. [2023-12-02 13:27:39,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 13:27:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1355 transitions. [2023-12-02 13:27:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 13:27:39,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:39,309 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:27:39,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 13:27:39,309 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:39,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1147064291, now seen corresponding path program 1 times [2023-12-02 13:27:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:39,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38431643] [2023-12-02 13:27:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:27:39,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38431643] [2023-12-02 13:27:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38431643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:27:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449479777] [2023-12-02 13:27:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:39,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:39,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:27:39,359 INFO L87 Difference]: Start difference. First operand 989 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 13:27:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:39,508 INFO L93 Difference]: Finished difference Result 2062 states and 2854 transitions. [2023-12-02 13:27:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:39,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2023-12-02 13:27:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:39,515 INFO L225 Difference]: With dead ends: 2062 [2023-12-02 13:27:39,515 INFO L226 Difference]: Without dead ends: 1204 [2023-12-02 13:27:39,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:27:39,518 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 36 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:39,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 222 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2023-12-02 13:27:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1087. [2023-12-02 13:27:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 802 states have (on average 1.314214463840399) internal successors, (1054), 813 states have internal predecessors, (1054), 182 states have call successors, (182), 102 states have call predecessors, (182), 102 states have return successors, (249), 172 states have call predecessors, (249), 182 states have call successors, (249) [2023-12-02 13:27:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1485 transitions. [2023-12-02 13:27:39,605 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1485 transitions. Word has length 71 [2023-12-02 13:27:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:39,606 INFO L495 AbstractCegarLoop]: Abstraction has 1087 states and 1485 transitions. [2023-12-02 13:27:39,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 13:27:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1485 transitions. [2023-12-02 13:27:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 13:27:39,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:39,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:27:39,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 13:27:39,611 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:39,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1674812831, now seen corresponding path program 1 times [2023-12-02 13:27:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199511523] [2023-12-02 13:27:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 13:27:39,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199511523] [2023-12-02 13:27:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199511523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:39,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:27:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:27:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209092] [2023-12-02 13:27:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:39,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:39,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:39,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:39,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:27:39,660 INFO L87 Difference]: Start difference. First operand 1087 states and 1485 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-02 13:27:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:39,861 INFO L93 Difference]: Finished difference Result 2704 states and 3743 transitions. [2023-12-02 13:27:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 90 [2023-12-02 13:27:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:39,870 INFO L225 Difference]: With dead ends: 2704 [2023-12-02 13:27:39,870 INFO L226 Difference]: Without dead ends: 1623 [2023-12-02 13:27:39,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:27:39,874 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 74 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:39,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 175 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2023-12-02 13:27:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1610. [2023-12-02 13:27:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1189 states have (on average 1.295206055508831) internal successors, (1540), 1205 states have internal predecessors, (1540), 267 states have call successors, (267), 153 states have call predecessors, (267), 153 states have return successors, (364), 252 states have call predecessors, (364), 267 states have call successors, (364) [2023-12-02 13:27:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2171 transitions. [2023-12-02 13:27:39,996 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2171 transitions. Word has length 90 [2023-12-02 13:27:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:39,996 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2171 transitions. [2023-12-02 13:27:39,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-02 13:27:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2171 transitions. [2023-12-02 13:27:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 13:27:40,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:40,002 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:27:40,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 13:27:40,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:40,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:40,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2043177214, now seen corresponding path program 1 times [2023-12-02 13:27:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:40,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669654816] [2023-12-02 13:27:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-02 13:27:40,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669654816] [2023-12-02 13:27:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669654816] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305314076] [2023-12-02 13:27:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:40,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:40,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:40,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:27:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:40,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:27:40,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 13:27:40,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:40,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305314076] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:40,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:40,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-02 13:27:40,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917202477] [2023-12-02 13:27:40,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:40,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:40,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:40,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:40,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:40,309 INFO L87 Difference]: Start difference. First operand 1610 states and 2171 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:27:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:40,468 INFO L93 Difference]: Finished difference Result 3135 states and 4274 transitions. [2023-12-02 13:27:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:40,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2023-12-02 13:27:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:40,493 INFO L225 Difference]: With dead ends: 3135 [2023-12-02 13:27:40,493 INFO L226 Difference]: Without dead ends: 1951 [2023-12-02 13:27:40,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:40,498 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:40,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2023-12-02 13:27:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1895. [2023-12-02 13:27:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1436 states have (on average 1.286908077994429) internal successors, (1848), 1449 states have internal predecessors, (1848), 273 states have call successors, (273), 183 states have call predecessors, (273), 185 states have return successors, (369), 263 states have call predecessors, (369), 273 states have call successors, (369) [2023-12-02 13:27:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2490 transitions. [2023-12-02 13:27:40,696 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2490 transitions. Word has length 105 [2023-12-02 13:27:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:40,697 INFO L495 AbstractCegarLoop]: Abstraction has 1895 states and 2490 transitions. [2023-12-02 13:27:40,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:27:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2490 transitions. [2023-12-02 13:27:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 13:27:40,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:40,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:27:40,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:27:40,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:40,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:40,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash 661395105, now seen corresponding path program 1 times [2023-12-02 13:27:40,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:40,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807305369] [2023-12-02 13:27:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 13:27:41,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:41,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807305369] [2023-12-02 13:27:41,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807305369] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:41,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559483620] [2023-12-02 13:27:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:41,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:41,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:41,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:41,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:27:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:41,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:27:41,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 13:27:41,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559483620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:41,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:41,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-02 13:27:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814201600] [2023-12-02 13:27:41,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:41,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:41,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:41,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:41,188 INFO L87 Difference]: Start difference. First operand 1895 states and 2490 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:27:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:41,367 INFO L93 Difference]: Finished difference Result 3617 states and 4818 transitions. [2023-12-02 13:27:41,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:41,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2023-12-02 13:27:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:41,379 INFO L225 Difference]: With dead ends: 3617 [2023-12-02 13:27:41,379 INFO L226 Difference]: Without dead ends: 2337 [2023-12-02 13:27:41,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:41,384 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 53 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:41,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 233 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2023-12-02 13:27:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2042. [2023-12-02 13:27:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1561 states have (on average 1.2953235105701473) internal successors, (2022), 1574 states have internal predecessors, (2022), 284 states have call successors, (284), 194 states have call predecessors, (284), 196 states have return successors, (380), 274 states have call predecessors, (380), 284 states have call successors, (380) [2023-12-02 13:27:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2686 transitions. [2023-12-02 13:27:41,585 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2686 transitions. Word has length 105 [2023-12-02 13:27:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:41,586 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2686 transitions. [2023-12-02 13:27:41,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:27:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2686 transitions. [2023-12-02 13:27:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 13:27:41,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:41,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:27:41,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:27:41,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:41,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:41,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1636251250, now seen corresponding path program 2 times [2023-12-02 13:27:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:41,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938713039] [2023-12-02 13:27:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:41,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 13:27:41,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938713039] [2023-12-02 13:27:41,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938713039] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345180812] [2023-12-02 13:27:41,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:27:41,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:41,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:41,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:41,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:27:42,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:27:42,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:27:42,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:27:42,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:27:42,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345180812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:42,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:42,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-12-02 13:27:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276988228] [2023-12-02 13:27:42,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:42,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:27:42,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:42,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:27:42,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:27:42,171 INFO L87 Difference]: Start difference. First operand 2042 states and 2686 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 13:27:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:42,519 INFO L93 Difference]: Finished difference Result 3667 states and 4814 transitions. [2023-12-02 13:27:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:27:42,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 105 [2023-12-02 13:27:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:42,532 INFO L225 Difference]: With dead ends: 3667 [2023-12-02 13:27:42,533 INFO L226 Difference]: Without dead ends: 2173 [2023-12-02 13:27:42,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:27:42,538 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 81 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:42,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 368 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:27:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2023-12-02 13:27:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2127. [2023-12-02 13:27:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1621 states have (on average 1.2905613818630475) internal successors, (2092), 1640 states have internal predecessors, (2092), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2023-12-02 13:27:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2790 transitions. [2023-12-02 13:27:42,814 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2790 transitions. Word has length 105 [2023-12-02 13:27:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:42,814 INFO L495 AbstractCegarLoop]: Abstraction has 2127 states and 2790 transitions. [2023-12-02 13:27:42,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 13:27:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2790 transitions. [2023-12-02 13:27:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 13:27:42,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:42,821 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:27:42,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 13:27:43,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 13:27:43,023 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:43,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash -257190925, now seen corresponding path program 2 times [2023-12-02 13:27:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:43,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907055404] [2023-12-02 13:27:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 13:27:43,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907055404] [2023-12-02 13:27:43,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907055404] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:43,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63873479] [2023-12-02 13:27:43,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:27:43,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:43,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:43,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:43,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:27:43,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:27:43,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:27:43,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:27:43,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 13:27:43,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63873479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:43,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:43,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-02 13:27:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117641262] [2023-12-02 13:27:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:43,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:43,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:43,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:43,362 INFO L87 Difference]: Start difference. First operand 2127 states and 2790 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:27:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:43,608 INFO L93 Difference]: Finished difference Result 3596 states and 4909 transitions. [2023-12-02 13:27:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2023-12-02 13:27:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:43,622 INFO L225 Difference]: With dead ends: 3596 [2023-12-02 13:27:43,622 INFO L226 Difference]: Without dead ends: 2137 [2023-12-02 13:27:43,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:43,627 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 85 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:43,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 226 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2023-12-02 13:27:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2121. [2023-12-02 13:27:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1615 states have (on average 1.256965944272446) internal successors, (2030), 1634 states have internal predecessors, (2030), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2023-12-02 13:27:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2728 transitions. [2023-12-02 13:27:43,846 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2728 transitions. Word has length 105 [2023-12-02 13:27:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:43,846 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 2728 transitions. [2023-12-02 13:27:43,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:27:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2728 transitions. [2023-12-02 13:27:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 13:27:43,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:43,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:27:43,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 13:27:44,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 13:27:44,054 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:44,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1991400723, now seen corresponding path program 1 times [2023-12-02 13:27:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224212096] [2023-12-02 13:27:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 13:27:44,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:44,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224212096] [2023-12-02 13:27:44,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224212096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:44,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394020492] [2023-12-02 13:27:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:44,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:44,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:44,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:44,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 13:27:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:44,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:27:44,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 13:27:44,485 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:44,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394020492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:44,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:44,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-02 13:27:44,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632604371] [2023-12-02 13:27:44,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:44,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:44,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:44,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:44,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:44,488 INFO L87 Difference]: Start difference. First operand 2121 states and 2728 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:27:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:44,772 INFO L93 Difference]: Finished difference Result 4083 states and 5403 transitions. [2023-12-02 13:27:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:44,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2023-12-02 13:27:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:44,789 INFO L225 Difference]: With dead ends: 4083 [2023-12-02 13:27:44,789 INFO L226 Difference]: Without dead ends: 2547 [2023-12-02 13:27:44,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:44,795 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 76 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:44,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 231 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:27:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2023-12-02 13:27:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2485. [2023-12-02 13:27:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 1905 states have (on average 1.2430446194225722) internal successors, (2368), 1927 states have internal predecessors, (2368), 335 states have call successors, (335), 232 states have call predecessors, (335), 244 states have return successors, (484), 326 states have call predecessors, (484), 335 states have call successors, (484) [2023-12-02 13:27:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3187 transitions. [2023-12-02 13:27:45,009 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3187 transitions. Word has length 105 [2023-12-02 13:27:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:45,010 INFO L495 AbstractCegarLoop]: Abstraction has 2485 states and 3187 transitions. [2023-12-02 13:27:45,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:27:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3187 transitions. [2023-12-02 13:27:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 13:27:45,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:45,015 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:45,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 13:27:45,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 13:27:45,216 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:45,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash 378238801, now seen corresponding path program 1 times [2023-12-02 13:27:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704071296] [2023-12-02 13:27:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 13:27:45,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704071296] [2023-12-02 13:27:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704071296] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13307097] [2023-12-02 13:27:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:45,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:45,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:45,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 13:27:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:45,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:27:45,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 13:27:45,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13307097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:45,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:45,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-02 13:27:45,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142966788] [2023-12-02 13:27:45,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:45,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:45,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:45,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:45,536 INFO L87 Difference]: Start difference. First operand 2485 states and 3187 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:27:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:45,767 INFO L93 Difference]: Finished difference Result 3544 states and 4576 transitions. [2023-12-02 13:27:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:45,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2023-12-02 13:27:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:45,781 INFO L225 Difference]: With dead ends: 3544 [2023-12-02 13:27:45,781 INFO L226 Difference]: Without dead ends: 2418 [2023-12-02 13:27:45,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:45,785 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:45,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2023-12-02 13:27:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2023-12-02 13:27:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 1850 states have (on average 1.2416216216216216) internal successors, (2297), 1869 states have internal predecessors, (2297), 335 states have call successors, (335), 232 states have call predecessors, (335), 232 states have return successors, (466), 317 states have call predecessors, (466), 335 states have call successors, (466) [2023-12-02 13:27:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3098 transitions. [2023-12-02 13:27:46,032 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3098 transitions. Word has length 107 [2023-12-02 13:27:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:46,032 INFO L495 AbstractCegarLoop]: Abstraction has 2418 states and 3098 transitions. [2023-12-02 13:27:46,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:27:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3098 transitions. [2023-12-02 13:27:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 13:27:46,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:46,039 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:46,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 13:27:46,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 13:27:46,240 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:46,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash 287036498, now seen corresponding path program 1 times [2023-12-02 13:27:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:46,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149092848] [2023-12-02 13:27:46,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 13:27:46,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149092848] [2023-12-02 13:27:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149092848] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074748110] [2023-12-02 13:27:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:46,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:46,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:46,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:46,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 13:27:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:46,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:27:46,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 13:27:46,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:46,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074748110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:46,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:46,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-02 13:27:46,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424289523] [2023-12-02 13:27:46,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:46,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:46,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:46,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:46,559 INFO L87 Difference]: Start difference. First operand 2418 states and 3098 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:27:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:46,856 INFO L93 Difference]: Finished difference Result 5702 states and 7345 transitions. [2023-12-02 13:27:46,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:46,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2023-12-02 13:27:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:46,877 INFO L225 Difference]: With dead ends: 5702 [2023-12-02 13:27:46,878 INFO L226 Difference]: Without dead ends: 3330 [2023-12-02 13:27:46,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:46,886 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 41 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:46,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 187 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2023-12-02 13:27:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2693. [2023-12-02 13:27:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2083 states have (on average 1.2467594815170426) internal successors, (2597), 2103 states have internal predecessors, (2597), 356 states have call successors, (356), 253 states have call predecessors, (356), 253 states have return successors, (487), 337 states have call predecessors, (487), 356 states have call successors, (487) [2023-12-02 13:27:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3440 transitions. [2023-12-02 13:27:47,192 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3440 transitions. Word has length 108 [2023-12-02 13:27:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:47,193 INFO L495 AbstractCegarLoop]: Abstraction has 2693 states and 3440 transitions. [2023-12-02 13:27:47,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:27:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3440 transitions. [2023-12-02 13:27:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 13:27:47,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:47,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:47,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 13:27:47,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:47,400 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:47,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash -66374653, now seen corresponding path program 1 times [2023-12-02 13:27:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:47,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349158628] [2023-12-02 13:27:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 13:27:47,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349158628] [2023-12-02 13:27:47,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349158628] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772496385] [2023-12-02 13:27:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:47,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:47,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:47,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:47,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 13:27:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:47,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:27:47,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:27:47,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772496385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:47,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:47,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-12-02 13:27:47,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692381559] [2023-12-02 13:27:47,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:47,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:47,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:47,722 INFO L87 Difference]: Start difference. First operand 2693 states and 3440 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:27:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:48,041 INFO L93 Difference]: Finished difference Result 4916 states and 6433 transitions. [2023-12-02 13:27:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:48,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2023-12-02 13:27:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:48,059 INFO L225 Difference]: With dead ends: 4916 [2023-12-02 13:27:48,059 INFO L226 Difference]: Without dead ends: 3075 [2023-12-02 13:27:48,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:48,065 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 64 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:48,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 133 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2023-12-02 13:27:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 3031. [2023-12-02 13:27:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 2389 states have (on average 1.222687316868983) internal successors, (2921), 2409 states have internal predecessors, (2921), 358 states have call successors, (358), 283 states have call predecessors, (358), 283 states have return successors, (535), 339 states have call predecessors, (535), 358 states have call successors, (535) [2023-12-02 13:27:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 3814 transitions. [2023-12-02 13:27:48,369 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 3814 transitions. Word has length 110 [2023-12-02 13:27:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:48,369 INFO L495 AbstractCegarLoop]: Abstraction has 3031 states and 3814 transitions. [2023-12-02 13:27:48,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:27:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3814 transitions. [2023-12-02 13:27:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 13:27:48,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:48,375 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:48,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 13:27:48,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 13:27:48,576 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:48,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1881325114, now seen corresponding path program 1 times [2023-12-02 13:27:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:48,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127126696] [2023-12-02 13:27:48,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:48,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-02 13:27:48,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127126696] [2023-12-02 13:27:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127126696] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203451695] [2023-12-02 13:27:48,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:48,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:48,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:48,663 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:48,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 13:27:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:48,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:27:48,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 13:27:48,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:48,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203451695] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:48,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:48,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-02 13:27:48,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240699251] [2023-12-02 13:27:48,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:48,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:27:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:48,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:27:48,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:48,820 INFO L87 Difference]: Start difference. First operand 3031 states and 3814 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:27:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:49,069 INFO L93 Difference]: Finished difference Result 4738 states and 5933 transitions. [2023-12-02 13:27:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:27:49,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2023-12-02 13:27:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:49,084 INFO L225 Difference]: With dead ends: 4738 [2023-12-02 13:27:49,084 INFO L226 Difference]: Without dead ends: 3429 [2023-12-02 13:27:49,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:27:49,089 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 41 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:49,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 225 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:27:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2023-12-02 13:27:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3219. [2023-12-02 13:27:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2545 states have (on average 1.2263261296660117) internal successors, (3121), 2565 states have internal predecessors, (3121), 374 states have call successors, (374), 299 states have call predecessors, (374), 299 states have return successors, (551), 355 states have call predecessors, (551), 374 states have call successors, (551) [2023-12-02 13:27:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4046 transitions. [2023-12-02 13:27:49,308 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4046 transitions. Word has length 106 [2023-12-02 13:27:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:49,308 INFO L495 AbstractCegarLoop]: Abstraction has 3219 states and 4046 transitions. [2023-12-02 13:27:49,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:27:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4046 transitions. [2023-12-02 13:27:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 13:27:49,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:49,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:49,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 13:27:49,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:49,515 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:49,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1158465317, now seen corresponding path program 1 times [2023-12-02 13:27:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:49,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986114528] [2023-12-02 13:27:49,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:49,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 13:27:49,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986114528] [2023-12-02 13:27:49,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986114528] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:49,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747136947] [2023-12-02 13:27:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:49,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:49,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:49,656 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:49,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 13:27:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:49,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:27:49,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 13:27:49,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:27:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747136947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:27:49,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:27:49,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-02 13:27:49,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623483510] [2023-12-02 13:27:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:27:49,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:27:49,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:49,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:27:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:49,882 INFO L87 Difference]: Start difference. First operand 3219 states and 4046 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 13:27:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:50,252 INFO L93 Difference]: Finished difference Result 7044 states and 8895 transitions. [2023-12-02 13:27:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:27:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 108 [2023-12-02 13:27:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:50,262 INFO L225 Difference]: With dead ends: 7044 [2023-12-02 13:27:50,262 INFO L226 Difference]: Without dead ends: 4218 [2023-12-02 13:27:50,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:27:50,268 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 123 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:50,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 230 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:27:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4218 states. [2023-12-02 13:27:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4218 to 3753. [2023-12-02 13:27:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3012 states have (on average 1.2124833997343958) internal successors, (3652), 3040 states have internal predecessors, (3652), 397 states have call successors, (397), 338 states have call predecessors, (397), 343 states have return successors, (586), 375 states have call predecessors, (586), 397 states have call successors, (586) [2023-12-02 13:27:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 4635 transitions. [2023-12-02 13:27:50,514 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 4635 transitions. Word has length 108 [2023-12-02 13:27:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:50,514 INFO L495 AbstractCegarLoop]: Abstraction has 3753 states and 4635 transitions. [2023-12-02 13:27:50,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 13:27:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 4635 transitions. [2023-12-02 13:27:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 13:27:50,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:50,521 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:50,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 13:27:50,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:50,724 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:27:50,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1650979456, now seen corresponding path program 1 times [2023-12-02 13:27:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603641250] [2023-12-02 13:27:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 13:27:51,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:51,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603641250] [2023-12-02 13:27:51,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603641250] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783834948] [2023-12-02 13:27:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:51,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:51,257 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:51,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 13:27:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:51,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 13:27:51,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:27:51,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:27:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-02 13:27:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783834948] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:27:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1858186593] [2023-12-02 13:27:51,789 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2023-12-02 13:27:51,790 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:27:51,793 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:27:51,798 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:27:51,798 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:27:59,325 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 121 for LOIs [2023-12-02 13:27:59,411 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 68 for LOIs [2023-12-02 13:27:59,439 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 111 for LOIs [2023-12-02 13:27:59,544 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 92 for LOIs [2023-12-02 13:27:59,903 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 67 for LOIs [2023-12-02 13:28:00,038 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 130 for LOIs [2023-12-02 13:28:00,193 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:28:09,742 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '116327#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (<= 1 |#StackHeapBarrier|) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)))' at error location [2023-12-02 13:28:09,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:28:09,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2023-12-02 13:28:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625185594] [2023-12-02 13:28:09,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:09,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 13:28:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:09,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 13:28:09,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=4064, Unknown=0, NotChecked=0, Total=4556 [2023-12-02 13:28:09,746 INFO L87 Difference]: Start difference. First operand 3753 states and 4635 transitions. Second operand has 21 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2023-12-02 13:28:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:12,504 INFO L93 Difference]: Finished difference Result 7611 states and 9369 transitions. [2023-12-02 13:28:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-12-02 13:28:12,504 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 112 [2023-12-02 13:28:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:12,512 INFO L225 Difference]: With dead ends: 7611 [2023-12-02 13:28:12,512 INFO L226 Difference]: Without dead ends: 3855 [2023-12-02 13:28:12,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11315 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1916, Invalid=24816, Unknown=0, NotChecked=0, Total=26732 [2023-12-02 13:28:12,528 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 1323 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:12,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 2452 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 13:28:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2023-12-02 13:28:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 2553. [2023-12-02 13:28:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2065 states have (on average 1.1656174334140437) internal successors, (2407), 2079 states have internal predecessors, (2407), 248 states have call successors, (248), 230 states have call predecessors, (248), 239 states have return successors, (302), 243 states have call predecessors, (302), 248 states have call successors, (302) [2023-12-02 13:28:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 2957 transitions. [2023-12-02 13:28:12,750 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 2957 transitions. Word has length 112 [2023-12-02 13:28:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:12,750 INFO L495 AbstractCegarLoop]: Abstraction has 2553 states and 2957 transitions. [2023-12-02 13:28:12,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2023-12-02 13:28:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 2957 transitions. [2023-12-02 13:28:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 13:28:12,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:12,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:12,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 13:28:12,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:12,954 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:28:12,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash 415559447, now seen corresponding path program 1 times [2023-12-02 13:28:12,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:12,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602936221] [2023-12-02 13:28:12,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:12,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 13:28:13,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602936221] [2023-12-02 13:28:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602936221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:28:13,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:28:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:28:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838693] [2023-12-02 13:28:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:28:13,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:28:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:28:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:28:13,068 INFO L87 Difference]: Start difference. First operand 2553 states and 2957 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:28:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:13,600 INFO L93 Difference]: Finished difference Result 5276 states and 6143 transitions. [2023-12-02 13:28:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:28:13,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 109 [2023-12-02 13:28:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:13,607 INFO L225 Difference]: With dead ends: 5276 [2023-12-02 13:28:13,607 INFO L226 Difference]: Without dead ends: 2958 [2023-12-02 13:28:13,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:28:13,611 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 66 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:13,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 354 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:28:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2023-12-02 13:28:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2861. [2023-12-02 13:28:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2297 states have (on average 1.1597736177622986) internal successors, (2664), 2308 states have internal predecessors, (2664), 293 states have call successors, (293), 269 states have call predecessors, (293), 270 states have return successors, (356), 283 states have call predecessors, (356), 293 states have call successors, (356) [2023-12-02 13:28:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3313 transitions. [2023-12-02 13:28:13,879 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3313 transitions. Word has length 109 [2023-12-02 13:28:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:13,879 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 3313 transitions. [2023-12-02 13:28:13,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:28:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3313 transitions. [2023-12-02 13:28:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 13:28:13,883 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:13,884 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:13,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 13:28:13,884 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:28:13,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -8988861, now seen corresponding path program 1 times [2023-12-02 13:28:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:13,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689891297] [2023-12-02 13:28:13,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 13:28:14,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689891297] [2023-12-02 13:28:14,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689891297] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593431446] [2023-12-02 13:28:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:14,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:14,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:14,039 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:14,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 13:28:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:14,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 13:28:14,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:14,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:28:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593431446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:28:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:28:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2023-12-02 13:28:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597405952] [2023-12-02 13:28:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:28:14,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:28:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:28:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:28:14,216 INFO L87 Difference]: Start difference. First operand 2861 states and 3313 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-02 13:28:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:14,716 INFO L93 Difference]: Finished difference Result 5340 states and 6244 transitions. [2023-12-02 13:28:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:28:14,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 109 [2023-12-02 13:28:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:14,726 INFO L225 Difference]: With dead ends: 5340 [2023-12-02 13:28:14,726 INFO L226 Difference]: Without dead ends: 3404 [2023-12-02 13:28:14,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:28:14,730 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 167 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:14,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 299 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:28:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2023-12-02 13:28:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3097. [2023-12-02 13:28:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 2468 states have (on average 1.152350081037277) internal successors, (2844), 2480 states have internal predecessors, (2844), 331 states have call successors, (331), 299 states have call predecessors, (331), 297 states have return successors, (422), 317 states have call predecessors, (422), 331 states have call successors, (422) [2023-12-02 13:28:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 3597 transitions. [2023-12-02 13:28:15,080 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 3597 transitions. Word has length 109 [2023-12-02 13:28:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:15,080 INFO L495 AbstractCegarLoop]: Abstraction has 3097 states and 3597 transitions. [2023-12-02 13:28:15,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-02 13:28:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 3597 transitions. [2023-12-02 13:28:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-02 13:28:15,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:15,083 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:15,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 13:28:15,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 13:28:15,284 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:28:15,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 264669582, now seen corresponding path program 1 times [2023-12-02 13:28:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:15,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257795221] [2023-12-02 13:28:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 13:28:15,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:15,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257795221] [2023-12-02 13:28:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257795221] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:15,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670581558] [2023-12-02 13:28:15,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:15,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:15,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:15,686 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:15,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 13:28:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:15,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 13:28:15,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:28:15,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-02 13:28:16,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670581558] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:16,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1955669404] [2023-12-02 13:28:16,101 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2023-12-02 13:28:16,101 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:28:16,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:28:16,102 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:28:16,102 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:28:22,403 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 121 for LOIs [2023-12-02 13:28:22,487 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 69 for LOIs [2023-12-02 13:28:22,542 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 111 for LOIs [2023-12-02 13:28:22,711 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 93 for LOIs [2023-12-02 13:28:23,020 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 68 for LOIs [2023-12-02 13:28:23,601 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 130 for LOIs [2023-12-02 13:28:23,757 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:28:35,450 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '151067#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= 1 |#StackHeapBarrier|) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 ~t1_pc~0))' at error location [2023-12-02 13:28:35,450 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:28:35,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2023-12-02 13:28:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123835632] [2023-12-02 13:28:35,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:35,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 13:28:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 13:28:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=4757, Unknown=0, NotChecked=0, Total=5256 [2023-12-02 13:28:35,454 INFO L87 Difference]: Start difference. First operand 3097 states and 3597 transitions. Second operand has 22 states, 18 states have (on average 8.333333333333334) internal successors, (150), 20 states have internal predecessors, (150), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2023-12-02 13:28:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:39,038 INFO L93 Difference]: Finished difference Result 6327 states and 7585 transitions. [2023-12-02 13:28:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2023-12-02 13:28:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 8.333333333333334) internal successors, (150), 20 states have internal predecessors, (150), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 115 [2023-12-02 13:28:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:39,046 INFO L225 Difference]: With dead ends: 6327 [2023-12-02 13:28:39,046 INFO L226 Difference]: Without dead ends: 3391 [2023-12-02 13:28:39,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 337 SyntacticMatches, 4 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15884 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=2296, Invalid=34760, Unknown=0, NotChecked=0, Total=37056 [2023-12-02 13:28:39,061 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 1366 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:39,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 2635 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 13:28:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2023-12-02 13:28:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2246. [2023-12-02 13:28:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1797 states have (on average 1.1469115191986645) internal successors, (2061), 1805 states have internal predecessors, (2061), 232 states have call successors, (232), 216 states have call predecessors, (232), 216 states have return successors, (304), 224 states have call predecessors, (304), 232 states have call successors, (304) [2023-12-02 13:28:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2597 transitions. [2023-12-02 13:28:39,282 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2597 transitions. Word has length 115 [2023-12-02 13:28:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:39,282 INFO L495 AbstractCegarLoop]: Abstraction has 2246 states and 2597 transitions. [2023-12-02 13:28:39,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 8.333333333333334) internal successors, (150), 20 states have internal predecessors, (150), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2023-12-02 13:28:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2597 transitions. [2023-12-02 13:28:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 13:28:39,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:39,285 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:39,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-02 13:28:39,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 13:28:39,485 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:28:39,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1242639672, now seen corresponding path program 1 times [2023-12-02 13:28:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:39,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854444420] [2023-12-02 13:28:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 13:28:39,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:39,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854444420] [2023-12-02 13:28:39,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854444420] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:39,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080258598] [2023-12-02 13:28:39,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:39,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:39,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:39,926 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:39,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 13:28:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:40,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 13:28:40,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:28:40,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-02 13:28:41,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080258598] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:41,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [179855371] [2023-12-02 13:28:41,176 INFO L159 IcfgInterpreter]: Started Sifa with 72 locations of interest [2023-12-02 13:28:41,176 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:28:41,176 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:28:41,176 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:28:41,177 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:28:51,669 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 138 for LOIs [2023-12-02 13:28:51,819 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 92 for LOIs [2023-12-02 13:28:51,977 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 146 for LOIs [2023-12-02 13:28:52,130 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 94 for LOIs [2023-12-02 13:28:52,626 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 70 for LOIs [2023-12-02 13:28:53,463 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 80 for LOIs [2023-12-02 13:28:53,492 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:29:12,031 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '162954#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= 1 |#StackHeapBarrier|) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 ~t1_pc~0))' at error location [2023-12-02 13:29:12,031 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:29:12,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:29:12,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 14] total 39 [2023-12-02 13:29:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280396046] [2023-12-02 13:29:12,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:29:12,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 13:29:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:29:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 13:29:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=8516, Unknown=0, NotChecked=0, Total=9120 [2023-12-02 13:29:12,034 INFO L87 Difference]: Start difference. First operand 2246 states and 2597 transitions. Second operand has 39 states, 27 states have (on average 7.592592592592593) internal successors, (205), 30 states have internal predecessors, (205), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2023-12-02 13:29:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:29:23,725 INFO L93 Difference]: Finished difference Result 8425 states and 10005 transitions. [2023-12-02 13:29:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2023-12-02 13:29:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 27 states have (on average 7.592592592592593) internal successors, (205), 30 states have internal predecessors, (205), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) Word has length 117 [2023-12-02 13:29:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:29:23,736 INFO L225 Difference]: With dead ends: 8425 [2023-12-02 13:29:23,736 INFO L226 Difference]: Without dead ends: 6457 [2023-12-02 13:29:23,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 332 SyntacticMatches, 9 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32567 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=8275, Invalid=70967, Unknown=0, NotChecked=0, Total=79242 [2023-12-02 13:29:23,748 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 3276 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 5839 mSolverCounterSat, 1507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 7346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1507 IncrementalHoareTripleChecker+Valid, 5839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:29:23,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3276 Valid, 2971 Invalid, 7346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1507 Valid, 5839 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 13:29:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2023-12-02 13:29:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 2719. [2023-12-02 13:29:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2149 states have (on average 1.1363424848766868) internal successors, (2442), 2174 states have internal predecessors, (2442), 290 states have call successors, (290), 269 states have call predecessors, (290), 279 states have return successors, (356), 275 states have call predecessors, (356), 290 states have call successors, (356) [2023-12-02 13:29:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3088 transitions. [2023-12-02 13:29:24,102 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3088 transitions. Word has length 117 [2023-12-02 13:29:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:29:24,102 INFO L495 AbstractCegarLoop]: Abstraction has 2719 states and 3088 transitions. [2023-12-02 13:29:24,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 27 states have (on average 7.592592592592593) internal successors, (205), 30 states have internal predecessors, (205), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2023-12-02 13:29:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3088 transitions. [2023-12-02 13:29:24,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-02 13:29:24,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:29:24,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:29:24,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-02 13:29:24,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:29:24,305 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:29:24,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:29:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -158379359, now seen corresponding path program 1 times [2023-12-02 13:29:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:29:24,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795459022] [2023-12-02 13:29:24,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:29:24,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:29:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:29:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-12-02 13:29:24,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:29:24,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795459022] [2023-12-02 13:29:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795459022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:29:24,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:29:24,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:29:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59075767] [2023-12-02 13:29:24,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:29:24,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:29:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:29:24,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:29:24,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:29:24,450 INFO L87 Difference]: Start difference. First operand 2719 states and 3088 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 13:29:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:29:25,504 INFO L93 Difference]: Finished difference Result 7157 states and 8179 transitions. [2023-12-02 13:29:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:29:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 133 [2023-12-02 13:29:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:29:25,513 INFO L225 Difference]: With dead ends: 7157 [2023-12-02 13:29:25,513 INFO L226 Difference]: Without dead ends: 5310 [2023-12-02 13:29:25,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:29:25,516 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 233 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:29:25,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 531 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:29:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2023-12-02 13:29:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 3810. [2023-12-02 13:29:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3810 states, 2997 states have (on average 1.1444778111444778) internal successors, (3430), 3028 states have internal predecessors, (3430), 412 states have call successors, (412), 378 states have call predecessors, (412), 400 states have return successors, (498), 403 states have call predecessors, (498), 412 states have call successors, (498) [2023-12-02 13:29:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 4340 transitions. [2023-12-02 13:29:26,126 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 4340 transitions. Word has length 133 [2023-12-02 13:29:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:29:26,127 INFO L495 AbstractCegarLoop]: Abstraction has 3810 states and 4340 transitions. [2023-12-02 13:29:26,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 13:29:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 4340 transitions. [2023-12-02 13:29:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-02 13:29:26,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:29:26,130 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:29:26,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-02 13:29:26,130 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:29:26,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:29:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash 85114947, now seen corresponding path program 1 times [2023-12-02 13:29:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:29:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916296146] [2023-12-02 13:29:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:29:26,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:29:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:29:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 75 proven. 11 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-12-02 13:29:26,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:29:26,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916296146] [2023-12-02 13:29:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916296146] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:29:26,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408782538] [2023-12-02 13:29:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:29:26,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:29:26,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:29:26,271 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:29:26,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 13:29:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:29:26,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:29:26,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:29:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-12-02 13:29:26,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:29:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408782538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:29:26,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:29:26,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 13:29:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477686242] [2023-12-02 13:29:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:29:26,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:29:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:29:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:29:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:29:26,463 INFO L87 Difference]: Start difference. First operand 3810 states and 4340 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 13:29:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:29:26,877 INFO L93 Difference]: Finished difference Result 5606 states and 6352 transitions. [2023-12-02 13:29:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:29:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 165 [2023-12-02 13:29:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:29:26,881 INFO L225 Difference]: With dead ends: 5606 [2023-12-02 13:29:26,881 INFO L226 Difference]: Without dead ends: 2326 [2023-12-02 13:29:26,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:29:26,885 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 55 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:29:26,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 340 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:29:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2023-12-02 13:29:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2069. [2023-12-02 13:29:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1630 states have (on average 1.1159509202453988) internal successors, (1819), 1649 states have internal predecessors, (1819), 216 states have call successors, (216), 200 states have call predecessors, (216), 222 states have return successors, (264), 219 states have call predecessors, (264), 216 states have call successors, (264) [2023-12-02 13:29:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2299 transitions. [2023-12-02 13:29:27,146 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2299 transitions. Word has length 165 [2023-12-02 13:29:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:29:27,147 INFO L495 AbstractCegarLoop]: Abstraction has 2069 states and 2299 transitions. [2023-12-02 13:29:27,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 13:29:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2299 transitions. [2023-12-02 13:29:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-02 13:29:27,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:29:27,149 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:29:27,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 13:29:27,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:29:27,350 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:29:27,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:29:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 48681969, now seen corresponding path program 2 times [2023-12-02 13:29:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:29:27,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552557434] [2023-12-02 13:29:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:29:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:29:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:29:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-12-02 13:29:27,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:29:27,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552557434] [2023-12-02 13:29:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552557434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:29:27,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:29:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:29:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193554698] [2023-12-02 13:29:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:29:27,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:29:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:29:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:29:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:29:27,412 INFO L87 Difference]: Start difference. First operand 2069 states and 2299 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-02 13:29:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:29:27,706 INFO L93 Difference]: Finished difference Result 3469 states and 3892 transitions. [2023-12-02 13:29:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:29:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 166 [2023-12-02 13:29:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:29:27,709 INFO L225 Difference]: With dead ends: 3469 [2023-12-02 13:29:27,709 INFO L226 Difference]: Without dead ends: 1754 [2023-12-02 13:29:27,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:29:27,712 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 108 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:29:27,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 209 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:29:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2023-12-02 13:29:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1573. [2023-12-02 13:29:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1250 states have (on average 1.1112) internal successors, (1389), 1260 states have internal predecessors, (1389), 170 states have call successors, (170), 154 states have call predecessors, (170), 152 states have return successors, (186), 158 states have call predecessors, (186), 170 states have call successors, (186) [2023-12-02 13:29:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1745 transitions. [2023-12-02 13:29:27,915 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1745 transitions. Word has length 166 [2023-12-02 13:29:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:29:27,915 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 1745 transitions. [2023-12-02 13:29:27,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-02 13:29:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1745 transitions. [2023-12-02 13:29:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-02 13:29:27,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:29:27,917 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:29:27,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 13:29:27,918 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:29:27,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:29:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 389954942, now seen corresponding path program 1 times [2023-12-02 13:29:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:29:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801034524] [2023-12-02 13:29:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:29:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:29:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:29:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 79 proven. 11 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-12-02 13:29:28,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:29:28,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801034524] [2023-12-02 13:29:28,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801034524] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:29:28,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140632928] [2023-12-02 13:29:28,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:29:28,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:29:28,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:29:28,036 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:29:28,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 13:29:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:29:28,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:29:28,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:29:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-02 13:29:28,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:29:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140632928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:29:28,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:29:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-02 13:29:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339894915] [2023-12-02 13:29:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:29:28,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:29:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:29:28,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:29:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:29:28,200 INFO L87 Difference]: Start difference. First operand 1573 states and 1745 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-02 13:29:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:29:28,527 INFO L93 Difference]: Finished difference Result 2717 states and 3017 transitions. [2023-12-02 13:29:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:29:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 167 [2023-12-02 13:29:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:29:28,530 INFO L225 Difference]: With dead ends: 2717 [2023-12-02 13:29:28,530 INFO L226 Difference]: Without dead ends: 1603 [2023-12-02 13:29:28,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:29:28,533 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:29:28,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 381 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:29:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2023-12-02 13:29:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1555. [2023-12-02 13:29:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1232 states have (on average 1.0892857142857142) internal successors, (1342), 1243 states have internal predecessors, (1342), 171 states have call successors, (171), 153 states have call predecessors, (171), 151 states have return successors, (187), 158 states have call predecessors, (187), 171 states have call successors, (187) [2023-12-02 13:29:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1700 transitions. [2023-12-02 13:29:28,748 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1700 transitions. Word has length 167 [2023-12-02 13:29:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:29:28,748 INFO L495 AbstractCegarLoop]: Abstraction has 1555 states and 1700 transitions. [2023-12-02 13:29:28,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-02 13:29:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1700 transitions. [2023-12-02 13:29:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-02 13:29:28,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:29:28,750 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:29:28,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 13:29:28,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:29:28,950 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:29:28,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:29:28,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1089145555, now seen corresponding path program 1 times [2023-12-02 13:29:28,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:29:28,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49103695] [2023-12-02 13:29:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:29:28,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:29:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:29:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 97 proven. 15 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-02 13:29:29,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:29:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49103695] [2023-12-02 13:29:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49103695] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:29:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531761672] [2023-12-02 13:29:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:29:29,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:29:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:29:29,091 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:29:29,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 13:29:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:29:29,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 13:29:29,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:29:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-02 13:29:29,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:29:29,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531761672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:29:29,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:29:29,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2023-12-02 13:29:29,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876549978] [2023-12-02 13:29:29,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:29:29,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:29:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:29:29,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:29:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:29:29,295 INFO L87 Difference]: Start difference. First operand 1555 states and 1700 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-02 13:29:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:29:29,558 INFO L93 Difference]: Finished difference Result 1935 states and 2118 transitions. [2023-12-02 13:29:29,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:29:29,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 169 [2023-12-02 13:29:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:29:29,559 INFO L225 Difference]: With dead ends: 1935 [2023-12-02 13:29:29,559 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 13:29:29,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:29:29,562 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 142 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:29:29,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 228 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:29:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 13:29:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 13:29:29,562 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) [2023-12-02 13:29:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 13:29:29,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2023-12-02 13:29:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:29:29,563 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 13:29:29,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-02 13:29:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 13:29:29,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 13:29:29,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-02 13:29:29,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 13:29:29,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 13:29:29,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 13:29:29,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 13:29:47,244 WARN L293 SmtUtils]: Spent 7.71s on a formula simplification. DAG size of input: 586 DAG size of output: 432 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:30:04,794 WARN L293 SmtUtils]: Spent 7.73s on a formula simplification. DAG size of input: 194 DAG size of output: 182 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:30:12,342 WARN L293 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 586 DAG size of output: 432 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:30:20,796 WARN L293 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 194 DAG size of output: 182 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:30:45,227 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1029 1039) no Hoare annotation was computed. [2023-12-02 13:30:45,227 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1029 1039) no Hoare annotation was computed. [2023-12-02 13:30:45,228 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1029 1039) the Hoare annotation is: (let ((.cse2 (= 2 |old(~t2_st~0)|)) (.cse18 (= ~E_1~0 1)) (.cse3 (= |old(~t2_st~0)| 0)) (.cse39 (= ~p_dw_pc~0 0)) (.cse40 (= ~t1_i~0 1)) (.cse22 (= ~m_pc~0 1)) (.cse38 (= |old(~t2_st~0)| ~t2_st~0)) (.cse41 (= ~t2_i~0 1)) (.cse25 (= ~E_2~0 1)) (.cse0 (= ~m_st~0 2)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= 0 ~t2_st~0))) (let ((.cse21 (and .cse0 .cse5 .cse4)) (.cse10 (not (= ~E_1~0 2))) (.cse12 (not .cse25)) (.cse17 (not (= (+ ~local~0 1) ~token~0))) (.cse26 (and .cse39 (<= 2 ~E_1~0) .cse0 .cse40 .cse5 (not .cse22) .cse38 .cse41 (= ~c_dr_pc~0 0))) (.cse8 (not .cse3)) (.cse23 (not (= 0 ~t2_pc~0))) (.cse36 (= ~t1_st~0 0)) (.cse35 (not (= |old(~t1_st~0)| 0))) (.cse31 (not (= ~m_pc~0 0))) (.cse37 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 2))) (.cse1 (= 2 ~t2_st~0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= |old(~m_st~0)| 0)) (.cse32 (not .cse18)) (.cse20 (not .cse2)) (.cse34 (not (= ~token~0 ~local~0))) (.cse27 (not (= ~E_2~0 2))) (.cse6 (not .cse41)) (.cse9 (not (= ~t1_pc~0 1))) (.cse11 (not .cse40)) (.cse13 (not .cse39)) (.cse29 (= 2 ~t1_st~0)) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse33 (not (= |old(~t1_st~0)| 2))) (.cse19 (< ~E_1~0 2)) (.cse15 (not (= 2 |old(~m_st~0)|))) (.cse16 (not (= ~t2_pc~0 1))) (.cse24 (= ~E_M~0 1))) (and (or (and (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4)) .cse5) (and (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17 .cse20))) (or .cse6 .cse21 .cse8 .cse9 .cse11 .cse13 .cse22 .cse14 .cse19 .cse23 .cse15 .cse24) (or .cse6 .cse21 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse17) (or .cse6 .cse25 .cse9 .cse11 .cse13 .cse22 .cse14 .cse19 .cse15 .cse16 .cse26) (or .cse6 .cse9 .cse11 .cse13 .cse22 .cse14 .cse19 .cse15 .cse16 .cse26 .cse24) (or .cse27 .cse6 (and .cse28 .cse29 .cse4) .cse7 .cse30 .cse8 .cse9 .cse31 .cse11 .cse13 .cse14 .cse32 .cse33 .cse23 .cse34) (or .cse35 .cse27 .cse6 .cse7 .cse30 .cse8 (and .cse28 .cse36 .cse4) .cse31 .cse11 .cse13 .cse37 .cse14 .cse32 .cse23 .cse34) (or (and .cse1 .cse28 .cse36) .cse35 .cse27 .cse6 .cse7 .cse30 .cse31 .cse11 .cse13 .cse37 .cse14 .cse32 .cse16 .cse20 .cse34) (or .cse27 .cse6 .cse7 (and .cse1 .cse28 .cse29) .cse30 .cse9 .cse11 .cse13 .cse14 .cse32 .cse33 .cse16 .cse20 .cse34) (or .cse27 .cse6 (not (= ~token~0 (+ 2 ~local~0))) .cse9 .cse11 .cse13 (and .cse0 .cse29 .cse38) .cse14 .cse33 .cse19 .cse15 .cse16 (not .cse24))))) [2023-12-02 13:30:45,228 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2023-12-02 13:30:45,228 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 262 276) the Hoare annotation is: true [2023-12-02 13:30:45,228 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 792) no Hoare annotation was computed. [2023-12-02 13:30:45,228 INFO L899 garLoopResultBuilder]: For program point L783-2(lines 783 792) no Hoare annotation was computed. [2023-12-02 13:30:45,228 INFO L899 garLoopResultBuilder]: For program point L746(lines 746 751) no Hoare annotation was computed. [2023-12-02 13:30:45,228 INFO L899 garLoopResultBuilder]: For program point L775(lines 763 777) no Hoare annotation was computed. [2023-12-02 13:30:45,228 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2023-12-02 13:30:45,229 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 773) no Hoare annotation was computed. [2023-12-02 13:30:45,229 INFO L899 garLoopResultBuilder]: For program point L764-2(lines 764 773) no Hoare annotation was computed. [2023-12-02 13:30:45,229 INFO L899 garLoopResultBuilder]: For program point L756(lines 744 758) no Hoare annotation was computed. [2023-12-02 13:30:45,229 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 995 1028) the Hoare annotation is: (let ((.cse31 (= |old(~m_st~0)| 0)) (.cse39 (= ~t1_st~0 0)) (.cse21 (= |old(~t2_st~0)| 0)) (.cse20 (= 2 |old(~t2_st~0)|)) (.cse5 (= 2 ~t2_st~0)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 1)) (.cse4 (= ~m_st~0 2)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (= 0 ~t2_st~0)) (.cse27 (not (= ~E_1~0 2))) (.cse32 (not (= ~E_1~0 1)))) (let ((.cse7 (and .cse27 .cse32)) (.cse28 (and .cse4 .cse23 .cse22)) (.cse25 (not .cse3)) (.cse26 (not (= (+ ~local~0 1) ~token~0))) (.cse17 (and .cse5 .cse30 .cse6)) (.cse16 (not .cse20)) (.cse19 (= ~m_pc~0 1)) (.cse37 (not (= ~token~0 (+ 2 ~local~0)))) (.cse8 (not (= ~t1_pc~0 1))) (.cse40 (= |old(~t2_st~0)| ~t2_st~0)) (.cse12 (not (= |old(~t1_st~0)| 2))) (.cse13 (< ~E_1~0 2)) (.cse15 (not (= ~t2_pc~0 1))) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (not (= ~E_M~0 2))) (.cse24 (not .cse21)) (.cse35 (and .cse30 .cse39 .cse22)) (.cse18 (not (= ~m_pc~0 0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse36 (not (= ~t1_pc~0 0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse29 (not (= 0 ~t2_pc~0))) (.cse38 (not .cse31)) (.cse14 (not (= 2 |old(~m_st~0)|))) (.cse33 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse17 .cse8 .cse18 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse15 .cse16) (or (and (or (and .cse4 .cse5 .cse20) (and .cse21 .cse4 .cse22)) .cse23) (and (or .cse1 .cse2 .cse24 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse13 .cse14 .cse15 .cse26) (or .cse1 .cse2 .cse8 .cse27 .cse9 .cse25 .cse10 .cse11 .cse13 .cse14 .cse15 .cse26 .cse16))) (or .cse1 .cse28 .cse24 .cse8 .cse9 .cse10 .cse19 .cse11 .cse13 .cse29 .cse14) (or .cse0 .cse1 (and .cse30 .cse6 .cse22) .cse2 .cse31 .cse24 .cse8 .cse18 .cse9 .cse10 .cse11 .cse32 .cse12 .cse29 .cse33) (or .cse34 .cse0 .cse1 .cse2 .cse31 .cse24 .cse35 .cse18 .cse9 .cse10 .cse36 .cse11 .cse32 .cse29 .cse33) (or .cse1 .cse28 .cse2 .cse24 .cse8 .cse27 .cse9 .cse25 .cse10 .cse11 .cse29 .cse14 .cse26) (or .cse0 .cse1 (and .cse5 (= ~m_st~0 0) .cse6) .cse37 .cse2 .cse8 .cse9 .cse10 .cse11 .cse38 .cse12 .cse13 .cse15 .cse16) (or (and .cse5 .cse30 .cse39) .cse34 .cse0 .cse1 .cse2 .cse31 .cse18 .cse9 .cse10 .cse36 .cse11 .cse32 .cse15 .cse16 .cse33) (or .cse0 .cse1 .cse2 .cse17 .cse31 .cse8 .cse9 .cse10 .cse11 .cse32 .cse12 .cse15 .cse16 .cse33) (or (and .cse4 .cse23 .cse40) .cse1 .cse8 .cse9 .cse10 .cse19 .cse11 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse37 .cse3 .cse8 .cse9 .cse10 (and .cse4 .cse6 .cse40) .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~E_M~0 1))) (or .cse34 .cse0 .cse1 .cse2 .cse24 .cse35 .cse18 .cse27 .cse9 .cse10 .cse36 .cse11 .cse29 (and .cse38 .cse14) .cse33)))) [2023-12-02 13:30:45,229 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 770) no Hoare annotation was computed. [2023-12-02 13:30:45,229 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 995 1028) no Hoare annotation was computed. [2023-12-02 13:30:45,229 INFO L899 garLoopResultBuilder]: For program point L794(lines 782 796) no Hoare annotation was computed. [2023-12-02 13:30:45,230 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 754) no Hoare annotation was computed. [2023-12-02 13:30:45,230 INFO L899 garLoopResultBuilder]: For program point L745-2(lines 745 754) no Hoare annotation was computed. [2023-12-02 13:30:45,230 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2023-12-02 13:30:45,230 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2023-12-02 13:30:45,230 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 387 411) the Hoare annotation is: true [2023-12-02 13:30:45,230 INFO L902 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: true [2023-12-02 13:30:45,230 INFO L902 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: true [2023-12-02 13:30:45,230 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2023-12-02 13:30:45,230 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 798 805) no Hoare annotation was computed. [2023-12-02 13:30:45,230 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 798 805) the Hoare annotation is: true [2023-12-02 13:30:45,231 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 919 956) the Hoare annotation is: (let ((.cse21 (= ~E_2~0 2)) (.cse22 (= ~E_M~0 2))) (let ((.cse15 (not (= 2 |old(~E_1~0)|))) (.cse17 (not (= 0 ~t2_st~0))) (.cse19 (not (= 0 ~t2_pc~0))) (.cse9 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 2))) (.cse18 (and (<= 2 ~E_1~0) (not (= ~E_2~0 1)) (not (= ~E_M~0 1)))) (.cse0 (not (= 2 |old(~E_2~0)|))) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= 2 ~t2_st~0))) (.cse4 (not (= 2 |old(~E_M~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= 2 ~t1_st~0))) (.cse8 (and .cse21 (= ~E_1~0 |old(~E_1~0)|) .cse22)) (.cse10 (= |old(~E_M~0)| 1)) (.cse11 (< |old(~E_1~0)| 2)) (.cse12 (= |old(~E_2~0)| 1)) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse20 (not (= ~m_st~0 0))) (.cse14 (not (= ~t2_pc~0 1)))) (and (or .cse0 .cse1 .cse2 (not (= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse16 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse5 .cse6 .cse9 .cse10 .cse11 .cse16 .cse12 .cse17 .cse13 .cse18 .cse19) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 (and .cse16 .cse20) .cse15 .cse4 .cse5 .cse6 (not (= ~t1_pc~0 0)) .cse17 .cse13 .cse19 (not (= ~t1_st~0 0)) (and .cse21 .cse22 (= ~E_1~0 2)) (not (= ~token~0 ~local~0))) (or .cse1 .cse2 .cse5 .cse6 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13 .cse18 .cse14) (or .cse0 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14)))) [2023-12-02 13:30:45,231 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 919 956) no Hoare annotation was computed. [2023-12-02 13:30:45,231 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 332) the Hoare annotation is: true [2023-12-02 13:30:45,231 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2023-12-02 13:30:45,231 INFO L899 garLoopResultBuilder]: For program point L124(lines 102 126) no Hoare annotation was computed. [2023-12-02 13:30:45,231 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2023-12-02 13:30:45,231 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2023-12-02 13:30:45,231 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 127) the Hoare annotation is: true [2023-12-02 13:30:45,231 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2023-12-02 13:30:45,231 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2023-12-02 13:30:45,231 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2023-12-02 13:30:45,232 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2023-12-02 13:30:45,232 INFO L895 garLoopResultBuilder]: At program point L861(line 861) the Hoare annotation is: (let ((.cse12 (= ~E_1~0 2)) (.cse5 (= ~t1_st~0 0))) (let ((.cse23 (<= 2 ~t2_st~0)) (.cse19 (= 0 ~t2_pc~0)) (.cse25 (or (= |exists_runnable_thread2_#res| 1) (not .cse5))) (.cse16 (not (= ~m_pc~0 1))) (.cse22 (not (= ~E_2~0 1))) (.cse24 (not (= ~E_M~0 1))) (.cse2 (= ~m_st~0 2)) (.cse27 (= (+ ~local~0 1) ~token~0)) (.cse28 (or (= ~E_1~0 1) .cse12)) (.cse20 (= 0 ~t2_st~0)) (.cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse26 (= ~t1_pc~0 0)) (.cse15 (= ~m_st~0 0)) (.cse11 (= ~token~0 ~local~0)) (.cse21 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse14 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse17 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse15 .cse16 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse15 .cse17 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse16 .cse22 .cse6 .cse8 .cse9 .cse23 .cse13 .cse24) (and .cse0 .cse1 .cse14 .cse2 .cse25 .cse3 .cse16 .cse22 .cse8 .cse9 .cse19 .cse20 .cse24) (and .cse1 .cse26 .cse3 .cse5 (or .cse2 .cse15) .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse20 .cse11 .cse12) (and .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse1 .cse14 .cse2 .cse26 .cse3 .cse16 .cse22 .cse5 .cse6 .cse8 .cse9 .cse23 .cse21 .cse24) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse15 .cse17 .cse6 .cse7 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse27 .cse28 .cse17 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse21) (and .cse1 .cse2 .cse26 .cse3 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse2 .cse25 .cse3 .cse16 .cse22 .cse6 .cse8 .cse9 .cse24) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse27 .cse28 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse13) (and .cse1 .cse26 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10)))) [2023-12-02 13:30:45,232 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2023-12-02 13:30:45,232 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2023-12-02 13:30:45,232 INFO L895 garLoopResultBuilder]: At program point L730(line 730) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~m_st~0 2)) (.cse8 (= |exists_runnable_thread2_#res| 1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~t1_st~0) .cse5 (= ~E_2~0 2) (= ~token~0 (+ 2 ~local~0)) .cse6 .cse7 (or .cse8 (not (= 0 ~t2_st~0))) .cse9 (= ~E_M~0 1)) (and .cse0 .cse1 .cse2 .cse3 (or .cse8 (not (= ~t1_st~0 0))) .cse4 (not (= ~m_pc~0 1)) (not (= ~E_2~0 1)) .cse5 .cse6 .cse7 .cse9))) [2023-12-02 13:30:45,232 INFO L899 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2023-12-02 13:30:45,232 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 153 201) no Hoare annotation was computed. [2023-12-02 13:30:45,233 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 499 536) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,233 INFO L895 garLoopResultBuilder]: At program point L1127(line 1127) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~t1_st~0 0) (or (= ~m_st~0 2) (= ~m_st~0 0)) (= ~E_2~0 2) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-12-02 13:30:45,233 INFO L895 garLoopResultBuilder]: At program point L1127-1(line 1127) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~t1_st~0 0) (or (= ~m_st~0 2) (= ~m_st~0 0)) (= ~E_2~0 2) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-12-02 13:30:45,233 INFO L899 garLoopResultBuilder]: For program point L863(line 863) no Hoare annotation was computed. [2023-12-02 13:30:45,233 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2023-12-02 13:30:45,233 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2023-12-02 13:30:45,233 INFO L895 garLoopResultBuilder]: At program point L1128(line 1128) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~t1_st~0 0) (or (= ~m_st~0 2) (= ~m_st~0 0)) (= ~E_2~0 2) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-12-02 13:30:45,233 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 869) no Hoare annotation was computed. [2023-12-02 13:30:45,234 INFO L895 garLoopResultBuilder]: At program point L898-1(lines 860 912) the Hoare annotation is: (let ((.cse12 (= ~E_1~0 2)) (.cse5 (= ~t1_st~0 0))) (let ((.cse23 (<= 2 ~t2_st~0)) (.cse19 (= 0 ~t2_pc~0)) (.cse25 (or (= |exists_runnable_thread2_#res| 1) (not .cse5))) (.cse16 (not (= ~m_pc~0 1))) (.cse22 (not (= ~E_2~0 1))) (.cse24 (not (= ~E_M~0 1))) (.cse2 (= ~m_st~0 2)) (.cse27 (= (+ ~local~0 1) ~token~0)) (.cse28 (or (= ~E_1~0 1) .cse12)) (.cse20 (= 0 ~t2_st~0)) (.cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse26 (= ~t1_pc~0 0)) (.cse15 (= ~m_st~0 0)) (.cse11 (= ~token~0 ~local~0)) (.cse21 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse14 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse17 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse15 .cse16 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse15 .cse17 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse16 .cse22 .cse6 .cse8 .cse9 .cse23 .cse13 .cse24) (and .cse0 .cse1 .cse14 .cse2 .cse25 .cse3 .cse16 .cse22 .cse8 .cse9 .cse19 .cse20 .cse24) (and .cse1 .cse26 .cse3 .cse5 (or .cse2 .cse15) .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse20 .cse11 .cse12) (and .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse1 .cse14 .cse2 .cse26 .cse3 .cse16 .cse22 .cse5 .cse6 .cse8 .cse9 .cse23 .cse21 .cse24) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse15 .cse17 .cse6 .cse7 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse27 .cse28 .cse17 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse21) (and .cse1 .cse2 .cse26 .cse3 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse2 .cse25 .cse3 .cse16 .cse22 .cse6 .cse8 .cse9 .cse24) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse27 .cse28 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse13) (and .cse1 .cse26 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10)))) [2023-12-02 13:30:45,234 INFO L899 garLoopResultBuilder]: For program point L865-1(lines 860 912) no Hoare annotation was computed. [2023-12-02 13:30:45,234 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 172 195) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,234 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1117 1175) no Hoare annotation was computed. [2023-12-02 13:30:45,234 INFO L899 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2023-12-02 13:30:45,234 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 625 668) no Hoare annotation was computed. [2023-12-02 13:30:45,234 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,234 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2023-12-02 13:30:45,234 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L895 garLoopResultBuilder]: At program point L1132-1(lines 1132 1169) the Hoare annotation is: (let ((.cse19 (= ~t1_st~0 0))) (let ((.cse16 (= 0 ~t2_pc~0)) (.cse17 (= 0 ~t2_st~0)) (.cse11 (= ~E_1~0 2)) (.cse20 (= ~m_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse13 (or (= |exists_runnable_thread2_#res| 1) (not .cse19))) (.cse14 (not (= ~m_pc~0 1))) (.cse15 (not (= ~E_2~0 1))) (.cse18 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse21 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse3 .cse14 .cse15 .cse8 .cse9 .cse16 .cse17 .cse18) (and .cse1 (= ~t1_pc~0 0) .cse3 .cse19 (or .cse2 .cse20) .cse7 .cse8 .cse9 .cse21 .cse16 .cse10 .cse17 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse3 .cse14 .cse15 .cse6 .cse8 .cse9 .cse18) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10)))) [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 908) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point L901-2(lines 901 908) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 484 542) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point L870-1(lines 860 912) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 854 918) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2023-12-02 13:30:45,235 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2023-12-02 13:30:45,236 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2023-12-02 13:30:45,236 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,236 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 187) no Hoare annotation was computed. [2023-12-02 13:30:45,236 INFO L895 garLoopResultBuilder]: At program point L1104(line 1104) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 2)) (.cse12 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse13 (not (= ~m_pc~0 1))) (.cse14 (not (= ~E_2~0 1))) (.cse15 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse11 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse8 .cse9 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) .cse15) (and .cse0 .cse1 .cse11 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse6 .cse8 .cse9 .cse15) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10))) [2023-12-02 13:30:45,236 INFO L899 garLoopResultBuilder]: For program point L1104-1(line 1104) no Hoare annotation was computed. [2023-12-02 13:30:45,236 INFO L899 garLoopResultBuilder]: For program point L873(lines 873 880) no Hoare annotation was computed. [2023-12-02 13:30:45,236 INFO L899 garLoopResultBuilder]: For program point L873-2(lines 873 880) no Hoare annotation was computed. [2023-12-02 13:30:45,236 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 412 464) no Hoare annotation was computed. [2023-12-02 13:30:45,236 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 717) no Hoare annotation was computed. [2023-12-02 13:30:45,236 INFO L899 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2023-12-02 13:30:45,237 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,237 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,237 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2023-12-02 13:30:45,237 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,237 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (let ((.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse3 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~t1_i~0 1)) (.cse11 (= 2 ~t2_st~0)) (.cse12 (= 2 ~t1_st~0)) (.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse15 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) .cse10) (and .cse0 .cse1 .cse2 .cse5 .cse11 (= ~m_st~0 0) .cse12 .cse13 .cse14 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9 .cse15 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse5 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9 (= ~m_pc~0 0) .cse15))) [2023-12-02 13:30:45,237 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2023-12-02 13:30:45,237 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,237 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2023-12-02 13:30:45,237 INFO L899 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2023-12-02 13:30:45,238 INFO L895 garLoopResultBuilder]: At program point L646(line 646) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse17 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= ~E_1~0 1)) (.cse18 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12 .cse16 .cse13 .cse14) (and .cse17 .cse0 .cse2 .cse4 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12 .cse16 .cse13 .cse14) (and .cse17 .cse0 .cse2 .cse3 .cse4 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))))) [2023-12-02 13:30:45,238 INFO L899 garLoopResultBuilder]: For program point L646-1(line 646) no Hoare annotation was computed. [2023-12-02 13:30:45,238 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2023-12-02 13:30:45,238 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2023-12-02 13:30:45,238 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 218 255) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2023-12-02 13:30:45,238 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (let ((.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse3 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~t1_i~0 1)) (.cse11 (= 2 ~t2_st~0)) (.cse12 (= 2 ~t1_st~0)) (.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse15 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) .cse10) (and .cse0 .cse1 .cse2 .cse5 .cse11 (= ~m_st~0 0) .cse12 .cse13 .cse14 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9 .cse15 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse5 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9 (= ~m_pc~0 0) .cse15))) [2023-12-02 13:30:45,238 INFO L895 garLoopResultBuilder]: At program point L1144-1(line 1144) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 2)) (.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse6 (not (= ~m_pc~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~t1_i~0 1)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= 2 ~t1_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse13 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) (and .cse0 .cse1 .cse3 .cse5 .cse9 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse5 .cse9 (= ~m_st~0 0) .cse10 .cse11 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse7 .cse8 (= ~m_pc~0 0) .cse13))) [2023-12-02 13:30:45,238 INFO L895 garLoopResultBuilder]: At program point L1145(line 1145) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 2)) (.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse6 (not (= ~m_pc~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~t1_i~0 1)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= 2 ~t1_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse13 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) (and .cse0 .cse1 .cse3 .cse5 .cse9 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse5 .cse9 (= ~m_st~0 0) .cse10 .cse11 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse7 .cse8 (= ~m_pc~0 0) .cse13))) [2023-12-02 13:30:45,239 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2023-12-02 13:30:45,239 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2023-12-02 13:30:45,239 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,239 INFO L895 garLoopResultBuilder]: At program point L1146(line 1146) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 2)) (.cse12 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse13 (not (= ~m_pc~0 1))) (.cse14 (not (= ~E_2~0 1))) (.cse15 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse11 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse8 .cse9 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) .cse15) (and .cse0 .cse1 .cse11 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse6 .cse8 .cse9 .cse15) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10))) [2023-12-02 13:30:45,239 INFO L895 garLoopResultBuilder]: At program point L684-1(lines 684 697) the Hoare annotation is: (let ((.cse19 (= ~E_1~0 2))) (let ((.cse14 (= (+ ~local~0 1) ~token~0)) (.cse15 (or (= ~E_1~0 1) .cse19)) (.cse5 (= ~m_st~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse17 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse20 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse4 (= 2 ~t2_st~0)) (.cse7 (= ~E_2~0 2)) (.cse11 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= ~m_st~0 2)) (.cse2 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~t1_i~0 1)) (.cse21 (not (= ~m_pc~0 1))) (.cse22 (not (= ~E_2~0 1))) (.cse6 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse12 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse23 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse11 .cse16 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse7 .cse8 .cse9 .cse17 .cse11 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse15 .cse7 .cse8 .cse9 .cse17 .cse11 .cse16 .cse20) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse21 .cse22 .cse8 .cse9 .cse17 .cse16 .cse12 .cse23) (and .cse0 .cse2 (= ~t1_pc~0 0) .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse18 .cse19 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse21 .cse22 .cse6 .cse8 .cse9 .cse12 .cse23)))) [2023-12-02 13:30:45,239 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2023-12-02 13:30:45,239 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 13:30:45,239 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2023-12-02 13:30:45,240 INFO L899 garLoopResultBuilder]: For program point L884-1(lines 860 912) no Hoare annotation was computed. [2023-12-02 13:30:45,240 INFO L899 garLoopResultBuilder]: For program point L1149(line 1149) no Hoare annotation was computed. [2023-12-02 13:30:45,240 INFO L895 garLoopResultBuilder]: At program point L720-1(lines 720 733) the Hoare annotation is: (let ((.cse13 (= ~m_pc~0 0)) (.cse15 (= ~t1_pc~0 0)) (.cse16 (= ~t1_st~0 0)) (.cse14 (= ~token~0 ~local~0)) (.cse10 (= ~E_1~0 2)) (.cse11 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse2 (= ~m_st~0 2)) (.cse18 (not (= ~m_pc~0 1))) (.cse19 (not (= ~E_2~0 1))) (.cse20 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse17 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse12 (= ~m_st~0 0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_2~0 2)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse9 (= ~E_M~0 2)) (.cse21 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse14 .cse10 .cse11) (and .cse1 .cse15 .cse3 .cse12 .cse16 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse14 .cse10 .cse11) (and .cse1 .cse2 .cse15 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11) (and .cse1 .cse17 .cse2 .cse15 .cse3 .cse18 .cse19 .cse16 .cse6 .cse7 .cse11 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse18 .cse19 .cse6 .cse7 .cse21 .cse20) (and .cse0 .cse1 .cse17 .cse3 .cse12 .cse4 .cse5 (= ~token~0 (+ 2 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse21))) [2023-12-02 13:30:45,240 INFO L895 garLoopResultBuilder]: At program point L654-1(lines 640 661) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_1~0)) (.cse12 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse0 (= ~t1_pc~0 1)) (.cse5 (= 2 ~t1_st~0)) (.cse16 (= 0 ~t2_pc~0)) (.cse17 (= 0 ~t2_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse13 (= ~t1_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2)) (.cse20 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 .cse14 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse13 .cse3 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse18 .cse19 .cse20))) [2023-12-02 13:30:45,240 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2023-12-02 13:30:45,240 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2023-12-02 13:30:45,240 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-12-02 13:30:45,240 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 179 187) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point L1151(lines 1151 1160) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point L1151-2(lines 1151 1160) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point L887(lines 887 894) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point L887-2(lines 887 894) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0)) [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-12-02 13:30:45,241 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0)) [2023-12-02 13:30:45,241 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0)) [2023-12-02 13:30:45,241 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2023-12-02 13:30:45,242 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1194) no Hoare annotation was computed. [2023-12-02 13:30:45,242 INFO L895 garLoopResultBuilder]: At program point L1155(line 1155) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 2)) (.cse12 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse13 (not (= ~m_pc~0 1))) (.cse14 (not (= ~E_2~0 1))) (.cse15 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse11 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse8 .cse9 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) .cse15) (and .cse0 .cse1 .cse11 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse6 .cse8 .cse9 .cse15) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10))) [2023-12-02 13:30:45,242 INFO L899 garLoopResultBuilder]: For program point L1155-1(line 1155) no Hoare annotation was computed. [2023-12-02 13:30:45,242 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2023-12-02 13:30:45,242 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0)) [2023-12-02 13:30:45,242 INFO L895 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse13 (= (+ ~local~0 1) ~token~0)) (.cse14 (= ~E_2~0 1)) (.cse9 (= 0 ~t2_pc~0)) (.cse16 (= ~E_M~0 2)) (.cse10 (= 0 ~t2_st~0)) (.cse17 (= ~E_1~0 2)) (.cse18 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~m_st~0 2)) (.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse5 (= ~t1_i~0 1)) (.cse6 (not (= ~m_pc~0 1))) (.cse15 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse11 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse15 .cse8 .cse16 .cse10 .cse17 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 (= 2 ~t2_st~0) .cse15 .cse8 .cse16 .cse17 .cse11)) .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse7 .cse8 .cse9 .cse16 .cse10 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse11 .cse12))) [2023-12-02 13:30:45,242 INFO L899 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2023-12-02 13:30:45,242 INFO L899 garLoopResultBuilder]: For program point L1190(lines 1190 1193) no Hoare annotation was computed. [2023-12-02 13:30:45,242 INFO L899 garLoopResultBuilder]: For program point $Ultimate##118(lines 654 660) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 637) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L895 garLoopResultBuilder]: At program point L1125(line 1125) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~m_st~0 0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point L95(lines 73 97) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 70 98) the Hoare annotation is: true [2023-12-02 13:30:45,243 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2023-12-02 13:30:45,243 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 295 314) the Hoare annotation is: true [2023-12-02 13:30:45,244 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2023-12-02 13:30:45,244 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-02 13:30:45,244 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-02 13:30:45,244 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-02 13:30:45,244 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 829 853) the Hoare annotation is: true [2023-12-02 13:30:45,244 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 829 853) no Hoare annotation was computed. [2023-12-02 13:30:45,244 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 333 350) the Hoare annotation is: true [2023-12-02 13:30:45,244 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2023-12-02 13:30:45,244 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 957 994) the Hoare annotation is: (let ((.cse21 (= ~E_2~0 2)) (.cse22 (= ~E_M~0 2))) (let ((.cse4 (not (= 2 ~t2_st~0))) (.cse8 (not (= 2 ~t1_st~0))) (.cse15 (and .cse21 (= ~E_1~0 |old(~E_1~0)|) .cse22)) (.cse12 (not (= ~t2_pc~0 1))) (.cse18 (<= 2 ~E_1~0)) (.cse2 (not (= ~t1_pc~0 1))) (.cse16 (= ~m_pc~0 1)) (.cse9 (< |old(~E_1~0)| 2)) (.cse0 (not (= 2 |old(~E_2~0)|))) (.cse1 (not (= ~t2_i~0 1))) (.cse10 (not (= ~m_st~0 2))) (.cse17 (not (= ~m_st~0 0))) (.cse3 (not (= 2 |old(~E_1~0)|))) (.cse14 (not (= ~m_pc~0 0))) (.cse5 (not (= 2 |old(~E_M~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= 0 ~t2_st~0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse20 (not (= 0 ~t2_pc~0))) (.cse13 (and .cse21 .cse22 (= ~E_1~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse9 .cse11 .cse12) (or .cse0 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse11 .cse17 .cse12) (or .cse18 .cse1 .cse2 .cse6 .cse7 .cse16 .cse9 .cse10 .cse11 .cse12) (or .cse18 .cse1 .cse2 .cse6 .cse7 .cse16 .cse9 .cse10 .cse19 .cse11 .cse20) (or .cse0 .cse1 (and .cse10 .cse17) .cse3 .cse14 .cse5 .cse6 .cse7 (not (= ~t1_pc~0 0)) .cse19 .cse11 .cse20 (not (= ~t1_st~0 0)) .cse13 (not (= ~token~0 ~local~0)))))) [2023-12-02 13:30:45,245 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 957 994) no Hoare annotation was computed. [2023-12-02 13:30:45,247 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-12-02 13:30:45,249 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:30:45,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,260 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,265 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,267 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,268 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,268 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,269 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,270 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,289 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,290 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,290 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:30:45,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:30:45 BoogieIcfgContainer [2023-12-02 13:30:45,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:30:45,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:30:45,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:30:45,293 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:30:45,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:27:34" (3/4) ... [2023-12-02 13:30:45,296 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 13:30:45,299 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-12-02 13:30:45,299 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2023-12-02 13:30:45,299 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-12-02 13:30:45,299 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2023-12-02 13:30:45,300 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-12-02 13:30:45,300 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-12-02 13:30:45,300 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2023-12-02 13:30:45,300 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-12-02 13:30:45,300 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-12-02 13:30:45,300 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-12-02 13:30:45,301 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-12-02 13:30:45,301 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-12-02 13:30:45,301 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2023-12-02 13:30:45,301 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-12-02 13:30:45,317 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2023-12-02 13:30:45,319 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2023-12-02 13:30:45,320 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 13:30:45,322 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 13:30:45,354 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2))) [2023-12-02 13:30:45,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && !((tmp == 0))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && !((m_pc == 1))) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && !((tmp == 0)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st)) && !((tmp == 0))) && !((E_M == 1)))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st)) && (tmp == 1)) && !((E_M == 1)))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (tmp == 1))) || ((((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st)) && !((tmp == 0)))) || (((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2))) [2023-12-02 13:30:45,358 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st))) || ((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && ((\result == 1) || !((t1_st == 0)))) && (t1_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (2 == t2_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) [2023-12-02 13:30:45,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t1_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2))) [2023-12-02 13:30:45,418 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2))) [2023-12-02 13:30:45,421 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && !((tmp == 0))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && !((m_pc == 1))) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && !((tmp == 0)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st)) && !((tmp == 0))) && !((E_M == 1)))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st)) && (tmp == 1)) && !((E_M == 1)))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (tmp == 1))) || ((((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st)) && !((tmp == 0)))) || (((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2))) [2023-12-02 13:30:45,422 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st))) || ((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && ((\result == 1) || !((t1_st == 0)))) && (t1_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (2 == t2_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) [2023-12-02 13:30:45,422 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t1_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2))) [2023-12-02 13:30:45,495 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 13:30:45,495 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 13:30:45,495 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:30:45,497 INFO L158 Benchmark]: Toolchain (without parser) took 192513.92ms. Allocated memory was 138.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 91.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 683.4MB. Max. memory is 16.1GB. [2023-12-02 13:30:45,497 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:30:45,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.46ms. Allocated memory is still 138.4MB. Free memory was 90.9MB in the beginning and 72.3MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 13:30:45,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.82ms. Allocated memory is still 138.4MB. Free memory was 72.3MB in the beginning and 69.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:30:45,500 INFO L158 Benchmark]: Boogie Preprocessor took 47.29ms. Allocated memory is still 138.4MB. Free memory was 69.3MB in the beginning and 66.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:30:45,500 INFO L158 Benchmark]: RCFGBuilder took 842.08ms. Allocated memory is still 138.4MB. Free memory was 66.6MB in the beginning and 102.0MB in the end (delta: -35.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2023-12-02 13:30:45,502 INFO L158 Benchmark]: TraceAbstraction took 191000.32ms. Allocated memory was 138.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 101.3MB in the beginning and 1.0GB in the end (delta: -928.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-12-02 13:30:45,507 INFO L158 Benchmark]: Witness Printer took 202.83ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 1.7GB in the end (delta: -629.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-12-02 13:30:45,511 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.46ms. Allocated memory is still 138.4MB. Free memory was 90.9MB in the beginning and 72.3MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.82ms. Allocated memory is still 138.4MB. Free memory was 72.3MB in the beginning and 69.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.29ms. Allocated memory is still 138.4MB. Free memory was 69.3MB in the beginning and 66.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 842.08ms. Allocated memory is still 138.4MB. Free memory was 66.6MB in the beginning and 102.0MB in the end (delta: -35.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 191000.32ms. Allocated memory was 138.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 101.3MB in the beginning and 1.0GB in the end (delta: -928.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 202.83ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 1.7GB in the end (delta: -629.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 160 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 190.9s, OverallIterations: 29, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 28.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 75.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10321 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10239 mSDsluCounter, 16004 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11381 mSDsCounter, 3413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13957 IncrementalHoareTripleChecker+Invalid, 17370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3413 mSolverCounterUnsat, 4623 mSDtfsCounter, 13957 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3526 GetRequests, 2751 SyntacticMatches, 15 SemanticMatches, 760 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59811 ImplicationChecksByTransitivity, 51.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3810occurred in iteration=25, InterpolantAutomatonStates: 550, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 10730 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 5461 PreInvPairs, 5797 NumberOfFragments, 7707 HoareAnnotationTreeSize, 5461 FomulaSimplifications, 1766734 FormulaSimplificationTreeSizeReduction, 53.6s HoareSimplificationTime, 54 FomulaSimplificationsInter, 536341 FormulaSimplificationTreeSizeReductionInter, 21.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 4963 NumberOfCodeBlocks, 4875 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5258 ConstructedInterpolants, 0 QuantifiedInterpolants, 10084 SizeOfPredicates, 27 NumberOfNonLiveVariables, 8690 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 49 InterpolantComputations, 26 PerfectInterpolantSequences, 3447/3755 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 2 specifications checked. All of them hold - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) || ((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && !((m_pc == 1))) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((m_pc == t1_pc) && !((m_pc == 1))) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && !((m_pc == 1))) && (c_dr_pc == 0))) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 720]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t1_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (E_M == 2))) - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2))) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((m_pc == t1_pc) && !((m_pc == 1))) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && !((m_pc == 1))) && (c_dr_pc == 0))) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && !((tmp == 0))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && !((m_pc == 1))) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && !((tmp == 0)))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st)) && !((tmp == 0))) && !((E_M == 1)))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st)) && (tmp == 1)) && !((E_M == 1)))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (tmp == 1))) || ((((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st)) && !((tmp == 0)))) || (((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((m_pc == t1_pc) && !((m_pc == 1))) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && !((m_pc == 1))) && (c_dr_pc == 0))) - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc) && !((m_pc == 1))) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && ((local + 1) == token)) && ((E_1 == 1) || (E_1 == 2))) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st))) || ((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && !((E_M == 1)))) || ((((((((((((((p_dw_pc == 0) && ((\result == 1) || !((t1_st == 0)))) && (t1_pc == 0)) && (t1_i == 1)) && (m_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && (2 == t2_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && ((\result == 1) || !((t1_st == 0)))) && (t1_i == 1)) && !((m_pc == 1))) && !((E_2 == 1))) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && !((E_M == 1)))) RESULT: Ultimate proved your program to be correct! [2023-12-02 13:30:45,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20e73dda-e11f-4452-9521-fc3352d1af60/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE