./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:39:08,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:39:08,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:39:08,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:39:08,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:39:08,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:39:08,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:39:08,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:39:08,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:39:08,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:39:08,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:39:08,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:39:08,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:39:08,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:39:08,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:39:08,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:39:08,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:39:08,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:39:08,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:39:08,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:39:08,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:39:08,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:39:08,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:39:08,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:39:08,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:39:08,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:39:08,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:39:08,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:39:08,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:39:08,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:39:08,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:39:08,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:39:08,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:39:08,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:39:08,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:39:08,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:39:08,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:39:08,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:39:08,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:39:08,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:39:08,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:39:08,811 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:39:08,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:39:08,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:39:08,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:39:08,863 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:39:08,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:39:08,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:39:08,865 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:39:08,865 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:39:08,865 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:39:08,865 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:39:08,867 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:39:08,867 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:39:08,867 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:39:08,867 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:39:08,867 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:39:08,868 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:39:08,868 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:39:08,868 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:39:08,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:39:08,869 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:39:08,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:39:08,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:39:08,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:39:08,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:39:08,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:39:08,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:39:08,870 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:39:08,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:39:08,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:39:08,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:39:08,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:39:08,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:39:08,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:39:08,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:39:08,872 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:39:08,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:39:08,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:39:08,873 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:39:08,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:39:08,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:39:08,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:39:08,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/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_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2022-11-03 01:39:09,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:39:09,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:39:09,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:39:09,187 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:39:09,188 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:39:09,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-11-03 01:39:09,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/data/b2d632b5e/d19aa3a47a644860ba5cc8bb9a38be52/FLAG912bedaf6 [2022-11-03 01:39:09,690 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:39:09,691 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-11-03 01:39:09,706 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/data/b2d632b5e/d19aa3a47a644860ba5cc8bb9a38be52/FLAG912bedaf6 [2022-11-03 01:39:10,043 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/data/b2d632b5e/d19aa3a47a644860ba5cc8bb9a38be52 [2022-11-03 01:39:10,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:39:10,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:39:10,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:39:10,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:39:10,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:39:10,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c4051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10, skipping insertion in model container [2022-11-03 01:39:10,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:39:10,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:39:10,329 WARN L230 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_830f8201-f6c3-4bb2-9883-7f9d4f721001/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[911,924] [2022-11-03 01:39:10,419 WARN L230 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_830f8201-f6c3-4bb2-9883-7f9d4f721001/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[8416,8429] [2022-11-03 01:39:10,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:39:10,490 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:39:10,502 WARN L230 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_830f8201-f6c3-4bb2-9883-7f9d4f721001/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[911,924] [2022-11-03 01:39:10,524 WARN L230 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_830f8201-f6c3-4bb2-9883-7f9d4f721001/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[8416,8429] [2022-11-03 01:39:10,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:39:10,568 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:39:10,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10 WrapperNode [2022-11-03 01:39:10,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:39:10,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:39:10,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:39:10,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:39:10,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,637 INFO L138 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 503 [2022-11-03 01:39:10,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:39:10,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:39:10,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:39:10,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:39:10,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,704 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:39:10,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:39:10,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:39:10,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:39:10,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (1/1) ... [2022-11-03 01:39:10,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:39:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:10,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:39:10,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:39:10,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:39:10,809 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 01:39:10,809 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 01:39:10,809 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-03 01:39:10,810 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-03 01:39:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-03 01:39:10,810 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-03 01:39:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-03 01:39:10,810 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-03 01:39:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-03 01:39:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-03 01:39:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-03 01:39:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-03 01:39:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-03 01:39:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-03 01:39:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-03 01:39:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-03 01:39:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-03 01:39:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-03 01:39:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-03 01:39:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-03 01:39:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-03 01:39:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-03 01:39:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:39:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-03 01:39:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-03 01:39:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-03 01:39:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-03 01:39:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:39:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:39:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-03 01:39:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-03 01:39:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-11-03 01:39:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-11-03 01:39:10,915 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:39:10,918 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:39:11,537 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-03 01:39:11,537 INFO L769 $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; [2022-11-03 01:39:11,611 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:39:11,902 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:39:11,903 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-03 01:39:11,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:39:11 BoogieIcfgContainer [2022-11-03 01:39:11,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:39:11,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:39:11,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:39:11,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:39:11,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:39:10" (1/3) ... [2022-11-03 01:39:11,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bac8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:39:11, skipping insertion in model container [2022-11-03 01:39:11,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:39:10" (2/3) ... [2022-11-03 01:39:11,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bac8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:39:11, skipping insertion in model container [2022-11-03 01:39:11,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:39:11" (3/3) ... [2022-11-03 01:39:11,918 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-11-03 01:39:11,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:39:11,940 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 01:39:12,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:39:12,032 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3baa27bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:39:12,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 01:39:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 111 states have (on average 1.5045045045045045) internal successors, (167), 119 states have internal predecessors, (167), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-03 01:39:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 01:39:12,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:12,051 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] [2022-11-03 01:39:12,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1124628622, now seen corresponding path program 1 times [2022-11-03 01:39:12,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:12,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566343440] [2022-11-03 01:39:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:39:12,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:12,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566343440] [2022-11-03 01:39:12,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566343440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:12,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:12,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:39:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218888834] [2022-11-03 01:39:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:12,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:39:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:12,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:39:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:39:12,559 INFO L87 Difference]: Start difference. First operand has 163 states, 111 states have (on average 1.5045045045045045) internal successors, (167), 119 states have internal predecessors, (167), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:39:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:13,428 INFO L93 Difference]: Finished difference Result 587 states and 877 transitions. [2022-11-03 01:39:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:39:13,431 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-11-03 01:39:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:13,453 INFO L225 Difference]: With dead ends: 587 [2022-11-03 01:39:13,453 INFO L226 Difference]: Without dead ends: 419 [2022-11-03 01:39:13,462 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 [2022-11-03 01:39:13,468 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 564 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:13,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 619 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:39:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-03 01:39:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 406. [2022-11-03 01:39:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 288 states have (on average 1.3993055555555556) internal successors, (403), 296 states have internal predecessors, (403), 79 states have call successors, (79), 39 states have call predecessors, (79), 37 states have return successors, (97), 72 states have call predecessors, (97), 75 states have call successors, (97) [2022-11-03 01:39:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 579 transitions. [2022-11-03 01:39:13,609 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 579 transitions. Word has length 38 [2022-11-03 01:39:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:13,610 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 579 transitions. [2022-11-03 01:39:13,611 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:39:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 579 transitions. [2022-11-03 01:39:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 01:39:13,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:13,621 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] [2022-11-03 01:39:13,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:39:13,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1886824138, now seen corresponding path program 1 times [2022-11-03 01:39:13,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:13,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454494478] [2022-11-03 01:39:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:13,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:39:13,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454494478] [2022-11-03 01:39:13,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454494478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:13,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:13,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:39:13,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219122421] [2022-11-03 01:39:13,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:13,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:39:13,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:13,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:39:13,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:39:13,783 INFO L87 Difference]: Start difference. First operand 406 states and 579 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) [2022-11-03 01:39:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:14,071 INFO L93 Difference]: Finished difference Result 606 states and 856 transitions. [2022-11-03 01:39:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:39:14,072 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 [2022-11-03 01:39:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:14,076 INFO L225 Difference]: With dead ends: 606 [2022-11-03 01:39:14,076 INFO L226 Difference]: Without dead ends: 535 [2022-11-03 01:39:14,077 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 [2022-11-03 01:39:14,079 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 277 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:14,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 431 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:39:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-11-03 01:39:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 524. [2022-11-03 01:39:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 372 states have (on average 1.3844086021505377) internal successors, (515), 380 states have internal predecessors, (515), 99 states have call successors, (99), 53 states have call predecessors, (99), 51 states have return successors, (120), 92 states have call predecessors, (120), 95 states have call successors, (120) [2022-11-03 01:39:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 734 transitions. [2022-11-03 01:39:14,130 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 734 transitions. Word has length 44 [2022-11-03 01:39:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:14,131 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 734 transitions. [2022-11-03 01:39:14,131 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) [2022-11-03 01:39:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 734 transitions. [2022-11-03 01:39:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:39:14,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:14,133 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] [2022-11-03 01:39:14,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:39:14,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:14,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1966124806, now seen corresponding path program 1 times [2022-11-03 01:39:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:14,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627318156] [2022-11-03 01:39:14,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:14,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:39:14,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:14,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627318156] [2022-11-03 01:39:14,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627318156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:14,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:14,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:39:14,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847999670] [2022-11-03 01:39:14,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:14,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:39:14,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:14,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:39:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:14,277 INFO L87 Difference]: Start difference. First operand 524 states and 734 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) [2022-11-03 01:39:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:15,098 INFO L93 Difference]: Finished difference Result 1061 states and 1457 transitions. [2022-11-03 01:39:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:39:15,099 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 [2022-11-03 01:39:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:15,103 INFO L225 Difference]: With dead ends: 1061 [2022-11-03 01:39:15,103 INFO L226 Difference]: Without dead ends: 595 [2022-11-03 01:39:15,104 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 [2022-11-03 01:39:15,106 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 666 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:15,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 812 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:39:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-11-03 01:39:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 510. [2022-11-03 01:39:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 358 states have (on average 1.3463687150837989) internal successors, (482), 366 states have internal predecessors, (482), 99 states have call successors, (99), 53 states have call predecessors, (99), 51 states have return successors, (117), 92 states have call predecessors, (117), 95 states have call successors, (117) [2022-11-03 01:39:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 698 transitions. [2022-11-03 01:39:15,170 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 698 transitions. Word has length 45 [2022-11-03 01:39:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:15,171 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 698 transitions. [2022-11-03 01:39:15,171 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) [2022-11-03 01:39:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 698 transitions. [2022-11-03 01:39:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 01:39:15,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:15,180 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] [2022-11-03 01:39:15,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:39:15,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:15,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1854337933, now seen corresponding path program 1 times [2022-11-03 01:39:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:15,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101012632] [2022-11-03 01:39:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:15,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:39:15,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:15,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101012632] [2022-11-03 01:39:15,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101012632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:15,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:15,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:39:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043719167] [2022-11-03 01:39:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:15,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:39:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:15,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:39:15,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:15,278 INFO L87 Difference]: Start difference. First operand 510 states and 698 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) [2022-11-03 01:39:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:15,946 INFO L93 Difference]: Finished difference Result 976 states and 1306 transitions. [2022-11-03 01:39:15,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:39:15,946 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 [2022-11-03 01:39:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:15,954 INFO L225 Difference]: With dead ends: 976 [2022-11-03 01:39:15,954 INFO L226 Difference]: Without dead ends: 799 [2022-11-03 01:39:15,956 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 [2022-11-03 01:39:15,966 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 580 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:15,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 754 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:39:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-11-03 01:39:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 774. [2022-11-03 01:39:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 539 states have (on average 1.300556586270872) internal successors, (701), 547 states have internal predecessors, (701), 148 states have call successors, (148), 87 states have call predecessors, (148), 85 states have return successors, (183), 141 states have call predecessors, (183), 144 states have call successors, (183) [2022-11-03 01:39:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1032 transitions. [2022-11-03 01:39:16,060 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1032 transitions. Word has length 46 [2022-11-03 01:39:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:16,061 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1032 transitions. [2022-11-03 01:39:16,061 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) [2022-11-03 01:39:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1032 transitions. [2022-11-03 01:39:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 01:39:16,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:16,068 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] [2022-11-03 01:39:16,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:39:16,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -213970773, now seen corresponding path program 1 times [2022-11-03 01:39:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:16,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173148124] [2022-11-03 01:39:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:39:16,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:16,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173148124] [2022-11-03 01:39:16,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173148124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:16,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:16,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:39:16,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041689868] [2022-11-03 01:39:16,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:16,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:16,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:16,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:39:16,170 INFO L87 Difference]: Start difference. First operand 774 states and 1032 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) [2022-11-03 01:39:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:16,263 INFO L93 Difference]: Finished difference Result 775 states and 1033 transitions. [2022-11-03 01:39:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:16,264 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 [2022-11-03 01:39:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:16,267 INFO L225 Difference]: With dead ends: 775 [2022-11-03 01:39:16,268 INFO L226 Difference]: Without dead ends: 331 [2022-11-03 01:39:16,269 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 [2022-11-03 01:39:16,272 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:16,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-03 01:39:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2022-11-03 01:39:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 237 states have (on average 1.3881856540084387) internal successors, (329), 242 states have internal predecessors, (329), 63 states have call successors, (63), 31 states have call predecessors, (63), 30 states have return successors, (83), 58 states have call predecessors, (83), 61 states have call successors, (83) [2022-11-03 01:39:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 475 transitions. [2022-11-03 01:39:16,314 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 475 transitions. Word has length 50 [2022-11-03 01:39:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:16,315 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 475 transitions. [2022-11-03 01:39:16,315 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) [2022-11-03 01:39:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 475 transitions. [2022-11-03 01:39:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 01:39:16,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:16,318 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] [2022-11-03 01:39:16,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:39:16,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1715176151, now seen corresponding path program 1 times [2022-11-03 01:39:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:16,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721133227] [2022-11-03 01:39:16,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:39:16,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:16,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721133227] [2022-11-03 01:39:16,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721133227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:16,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:16,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:39:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698861283] [2022-11-03 01:39:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:16,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:39:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:39:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:16,682 INFO L87 Difference]: Start difference. First operand 331 states and 475 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:39:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:17,003 INFO L93 Difference]: Finished difference Result 867 states and 1268 transitions. [2022-11-03 01:39:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:39:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2022-11-03 01:39:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:17,008 INFO L225 Difference]: With dead ends: 867 [2022-11-03 01:39:17,008 INFO L226 Difference]: Without dead ends: 543 [2022-11-03 01:39:17,009 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 [2022-11-03 01:39:17,010 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 234 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:17,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 359 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:39:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-03 01:39:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 511. [2022-11-03 01:39:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 366 states have (on average 1.3688524590163935) internal successors, (501), 373 states have internal predecessors, (501), 96 states have call successors, (96), 49 states have call predecessors, (96), 48 states have return successors, (131), 89 states have call predecessors, (131), 94 states have call successors, (131) [2022-11-03 01:39:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 728 transitions. [2022-11-03 01:39:17,071 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 728 transitions. Word has length 67 [2022-11-03 01:39:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:17,071 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 728 transitions. [2022-11-03 01:39:17,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:39:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 728 transitions. [2022-11-03 01:39:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-03 01:39:17,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:17,073 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] [2022-11-03 01:39:17,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:39:17,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash -503652888, now seen corresponding path program 1 times [2022-11-03 01:39:17,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:17,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494775596] [2022-11-03 01:39:17,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:39:17,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:17,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494775596] [2022-11-03 01:39:17,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494775596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:17,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:17,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:39:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365124091] [2022-11-03 01:39:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:17,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:39:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:39:17,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:17,432 INFO L87 Difference]: Start difference. First operand 511 states and 728 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:39:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:17,756 INFO L93 Difference]: Finished difference Result 1519 states and 2224 transitions. [2022-11-03 01:39:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:39:17,757 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 68 [2022-11-03 01:39:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:17,777 INFO L225 Difference]: With dead ends: 1519 [2022-11-03 01:39:17,778 INFO L226 Difference]: Without dead ends: 1015 [2022-11-03 01:39:17,779 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 [2022-11-03 01:39:17,780 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 226 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:17,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 254 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:39:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2022-11-03 01:39:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 963. [2022-11-03 01:39:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 688 states have (on average 1.3459302325581395) internal successors, (926), 700 states have internal predecessors, (926), 178 states have call successors, (178), 97 states have call predecessors, (178), 96 states have return successors, (243), 166 states have call predecessors, (243), 176 states have call successors, (243) [2022-11-03 01:39:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1347 transitions. [2022-11-03 01:39:17,893 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1347 transitions. Word has length 68 [2022-11-03 01:39:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:17,895 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1347 transitions. [2022-11-03 01:39:17,895 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:39:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1347 transitions. [2022-11-03 01:39:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-03 01:39:17,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:17,898 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] [2022-11-03 01:39:17,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:39:17,899 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -341962995, now seen corresponding path program 1 times [2022-11-03 01:39:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:17,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425754317] [2022-11-03 01:39:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:39:17,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:17,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425754317] [2022-11-03 01:39:17,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425754317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:17,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:17,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:39:17,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945855189] [2022-11-03 01:39:17,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:17,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:17,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:17,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:17,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:39:17,970 INFO L87 Difference]: Start difference. First operand 963 states and 1347 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 01:39:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:18,160 INFO L93 Difference]: Finished difference Result 1998 states and 2826 transitions. [2022-11-03 01:39:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:18,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2022-11-03 01:39:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:18,168 INFO L225 Difference]: With dead ends: 1998 [2022-11-03 01:39:18,168 INFO L226 Difference]: Without dead ends: 1160 [2022-11-03 01:39:18,173 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 [2022-11-03 01:39:18,174 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:18,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 229 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-11-03 01:39:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1043. [2022-11-03 01:39:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 756 states have (on average 1.3571428571428572) internal successors, (1026), 768 states have internal predecessors, (1026), 184 states have call successors, (184), 103 states have call predecessors, (184), 102 states have return successors, (249), 172 states have call predecessors, (249), 182 states have call successors, (249) [2022-11-03 01:39:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1459 transitions. [2022-11-03 01:39:18,298 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1459 transitions. Word has length 69 [2022-11-03 01:39:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:18,299 INFO L495 AbstractCegarLoop]: Abstraction has 1043 states and 1459 transitions. [2022-11-03 01:39:18,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 01:39:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1459 transitions. [2022-11-03 01:39:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 01:39:18,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:18,304 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] [2022-11-03 01:39:18,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:39:18,305 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1405510182, now seen corresponding path program 1 times [2022-11-03 01:39:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:18,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128482847] [2022-11-03 01:39:18,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:18,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 01:39:18,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:18,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128482847] [2022-11-03 01:39:18,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128482847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:18,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:18,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:39:18,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518840118] [2022-11-03 01:39:18,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:18,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:18,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:18,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:39:18,387 INFO L87 Difference]: Start difference. First operand 1043 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 01:39:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:18,613 INFO L93 Difference]: Finished difference Result 2595 states and 3679 transitions. [2022-11-03 01:39:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 88 [2022-11-03 01:39:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:18,622 INFO L225 Difference]: With dead ends: 2595 [2022-11-03 01:39:18,622 INFO L226 Difference]: Without dead ends: 1558 [2022-11-03 01:39:18,626 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 [2022-11-03 01:39:18,627 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 81 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:18,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 200 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2022-11-03 01:39:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1543. [2022-11-03 01:39:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1120 states have (on average 1.3375) internal successors, (1498), 1137 states have internal predecessors, (1498), 269 states have call successors, (269), 154 states have call predecessors, (269), 153 states have return successors, (364), 252 states have call predecessors, (364), 267 states have call successors, (364) [2022-11-03 01:39:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2131 transitions. [2022-11-03 01:39:18,856 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2131 transitions. Word has length 88 [2022-11-03 01:39:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:18,857 INFO L495 AbstractCegarLoop]: Abstraction has 1543 states and 2131 transitions. [2022-11-03 01:39:18,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 01:39:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2131 transitions. [2022-11-03 01:39:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 01:39:18,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:18,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:18,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:39:18,863 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1954305884, now seen corresponding path program 1 times [2022-11-03 01:39:18,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:18,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144540787] [2022-11-03 01:39:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:18,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 01:39:18,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144540787] [2022-11-03 01:39:18,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144540787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394246882] [2022-11-03 01:39:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:18,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:18,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:18,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:39:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:19,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:39:19,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:39:19,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:19,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394246882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:19,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:19,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:39:19,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682693243] [2022-11-03 01:39:19,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:19,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:19,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:19,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:19,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:19,227 INFO L87 Difference]: Start difference. First operand 1543 states and 2131 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:39:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:19,497 INFO L93 Difference]: Finished difference Result 3019 states and 4203 transitions. [2022-11-03 01:39:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:19,498 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2022-11-03 01:39:19,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:19,507 INFO L225 Difference]: With dead ends: 3019 [2022-11-03 01:39:19,507 INFO L226 Difference]: Without dead ends: 1884 [2022-11-03 01:39:19,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:19,512 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 80 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:19,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 122 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-11-03 01:39:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1828. [2022-11-03 01:39:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1367 states have (on average 1.3211411850768104) internal successors, (1806), 1381 states have internal predecessors, (1806), 275 states have call successors, (275), 184 states have call predecessors, (275), 185 states have return successors, (369), 263 states have call predecessors, (369), 273 states have call successors, (369) [2022-11-03 01:39:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2450 transitions. [2022-11-03 01:39:19,755 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2450 transitions. Word has length 102 [2022-11-03 01:39:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:19,756 INFO L495 AbstractCegarLoop]: Abstraction has 1828 states and 2450 transitions. [2022-11-03 01:39:19,757 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:39:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2450 transitions. [2022-11-03 01:39:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 01:39:19,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:19,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:19,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 01:39:19,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:39:19,979 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash 363910907, now seen corresponding path program 1 times [2022-11-03 01:39:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:19,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799294141] [2022-11-03 01:39:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:19,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-03 01:39:20,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799294141] [2022-11-03 01:39:20,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799294141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249795753] [2022-11-03 01:39:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:20,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:20,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:20,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:20,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:39:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:20,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:39:20,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 01:39:20,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:20,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249795753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:20,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:20,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:39:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571408680] [2022-11-03 01:39:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:20,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:20,273 INFO L87 Difference]: Start difference. First operand 1828 states and 2450 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:39:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:20,573 INFO L93 Difference]: Finished difference Result 3499 states and 4754 transitions. [2022-11-03 01:39:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:20,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2022-11-03 01:39:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:20,592 INFO L225 Difference]: With dead ends: 3499 [2022-11-03 01:39:20,592 INFO L226 Difference]: Without dead ends: 2263 [2022-11-03 01:39:20,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:20,597 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 59 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:20,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 240 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2022-11-03 01:39:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1957. [2022-11-03 01:39:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1474 states have (on average 1.3310719131614654) internal successors, (1962), 1488 states have internal predecessors, (1962), 286 states have call successors, (286), 195 states have call predecessors, (286), 196 states have return successors, (380), 274 states have call predecessors, (380), 284 states have call successors, (380) [2022-11-03 01:39:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 2628 transitions. [2022-11-03 01:39:20,894 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 2628 transitions. Word has length 102 [2022-11-03 01:39:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:20,894 INFO L495 AbstractCegarLoop]: Abstraction has 1957 states and 2628 transitions. [2022-11-03 01:39:20,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:39:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2628 transitions. [2022-11-03 01:39:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 01:39:20,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:20,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:20,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:21,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:21,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash 571520336, now seen corresponding path program 2 times [2022-11-03 01:39:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:21,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410906206] [2022-11-03 01:39:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-03 01:39:21,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:21,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410906206] [2022-11-03 01:39:21,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410906206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:21,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352616267] [2022-11-03 01:39:21,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:39:21,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:21,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:21,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:21,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:39:21,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:39:21,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:39:21,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:39:21,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 01:39:21,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:21,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352616267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:21,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:21,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-11-03 01:39:21,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477269172] [2022-11-03 01:39:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:21,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:39:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:21,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:39:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:39:21,636 INFO L87 Difference]: Start difference. First operand 1957 states and 2628 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 01:39:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:21,972 INFO L93 Difference]: Finished difference Result 3545 states and 4754 transitions. [2022-11-03 01:39:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:39:21,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2022-11-03 01:39:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:21,983 INFO L225 Difference]: With dead ends: 3545 [2022-11-03 01:39:21,983 INFO L226 Difference]: Without dead ends: 2113 [2022-11-03 01:39:21,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:39:21,988 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 94 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:21,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 405 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:39:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-11-03 01:39:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2042. [2022-11-03 01:39:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1534 states have (on average 1.3246414602346805) internal successors, (2032), 1554 states have internal predecessors, (2032), 294 states have call successors, (294), 200 states have call predecessors, (294), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-11-03 01:39:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2732 transitions. [2022-11-03 01:39:22,231 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2732 transitions. Word has length 102 [2022-11-03 01:39:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:22,232 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2732 transitions. [2022-11-03 01:39:22,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 01:39:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2732 transitions. [2022-11-03 01:39:22,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 01:39:22,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:22,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:22,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:22,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 01:39:22,463 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash -736484433, now seen corresponding path program 2 times [2022-11-03 01:39:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:22,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825449108] [2022-11-03 01:39:22,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 01:39:22,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825449108] [2022-11-03 01:39:22,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825449108] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490853573] [2022-11-03 01:39:22,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:39:22,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:22,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:22,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:22,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:39:22,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:39:22,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:39:22,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:39:22,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 01:39:22,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:22,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490853573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:22,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:22,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:39:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265301578] [2022-11-03 01:39:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:22,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:22,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:22,851 INFO L87 Difference]: Start difference. First operand 2042 states and 2732 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:23,130 INFO L93 Difference]: Finished difference Result 3451 states and 4809 transitions. [2022-11-03 01:39:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2022-11-03 01:39:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:23,141 INFO L225 Difference]: With dead ends: 3451 [2022-11-03 01:39:23,141 INFO L226 Difference]: Without dead ends: 2054 [2022-11-03 01:39:23,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:23,147 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 90 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:23,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 236 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2022-11-03 01:39:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2036. [2022-11-03 01:39:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 1528 states have (on average 1.2892670157068062) internal successors, (1970), 1548 states have internal predecessors, (1970), 294 states have call successors, (294), 200 states have call predecessors, (294), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-11-03 01:39:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2670 transitions. [2022-11-03 01:39:23,412 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2670 transitions. Word has length 102 [2022-11-03 01:39:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:23,412 INFO L495 AbstractCegarLoop]: Abstraction has 2036 states and 2670 transitions. [2022-11-03 01:39:23,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2670 transitions. [2022-11-03 01:39:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 01:39:23,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:23,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:23,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:23,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 01:39:23,643 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1661525779, now seen corresponding path program 1 times [2022-11-03 01:39:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:23,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022791133] [2022-11-03 01:39:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 01:39:23,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022791133] [2022-11-03 01:39:23,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022791133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472317898] [2022-11-03 01:39:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:23,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:23,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:39:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:24,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:39:24,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:39:24,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:24,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472317898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:24,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:24,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:39:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766268960] [2022-11-03 01:39:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:24,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:24,082 INFO L87 Difference]: Start difference. First operand 2036 states and 2670 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:39:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:24,488 INFO L93 Difference]: Finished difference Result 3922 states and 5296 transitions. [2022-11-03 01:39:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:24,489 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2022-11-03 01:39:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:24,502 INFO L225 Difference]: With dead ends: 3922 [2022-11-03 01:39:24,502 INFO L226 Difference]: Without dead ends: 2448 [2022-11-03 01:39:24,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:24,509 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 84 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:24,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 255 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:39:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-11-03 01:39:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2384. [2022-11-03 01:39:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 1802 states have (on average 1.276914539400666) internal successors, (2301), 1825 states have internal predecessors, (2301), 337 states have call successors, (337), 233 states have call predecessors, (337), 244 states have return successors, (484), 326 states have call predecessors, (484), 335 states have call successors, (484) [2022-11-03 01:39:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3122 transitions. [2022-11-03 01:39:24,882 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3122 transitions. Word has length 102 [2022-11-03 01:39:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:24,882 INFO L495 AbstractCegarLoop]: Abstraction has 2384 states and 3122 transitions. [2022-11-03 01:39:24,883 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:39:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3122 transitions. [2022-11-03 01:39:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:39:24,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:24,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:24,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:25,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:25,112 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash -227121940, now seen corresponding path program 1 times [2022-11-03 01:39:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:25,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615700575] [2022-11-03 01:39:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:25,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 01:39:25,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615700575] [2022-11-03 01:39:25,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615700575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296145412] [2022-11-03 01:39:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:25,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:25,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:25,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:25,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:39:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:25,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:39:25,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:39:25,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:25,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296145412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:25,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:25,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:39:25,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614352236] [2022-11-03 01:39:25,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:25,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:25,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:25,523 INFO L87 Difference]: Start difference. First operand 2384 states and 3122 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:25,905 INFO L93 Difference]: Finished difference Result 5571 states and 7330 transitions. [2022-11-03 01:39:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-11-03 01:39:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:25,922 INFO L225 Difference]: With dead ends: 5571 [2022-11-03 01:39:25,923 INFO L226 Difference]: Without dead ends: 3233 [2022-11-03 01:39:25,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:25,931 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 48 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 194 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 [2022-11-03 01:39:25,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 194 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2022-11-03 01:39:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 2624. [2022-11-03 01:39:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2000 states have (on average 1.283) internal successors, (2566), 2024 states have internal predecessors, (2566), 358 states have call successors, (358), 254 states have call predecessors, (358), 265 states have return successors, (505), 346 states have call predecessors, (505), 356 states have call successors, (505) [2022-11-03 01:39:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3429 transitions. [2022-11-03 01:39:26,287 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3429 transitions. Word has length 101 [2022-11-03 01:39:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:26,288 INFO L495 AbstractCegarLoop]: Abstraction has 2624 states and 3429 transitions. [2022-11-03 01:39:26,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3429 transitions. [2022-11-03 01:39:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-03 01:39:26,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:26,297 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] [2022-11-03 01:39:26,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:26,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 01:39:26,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2110095426, now seen corresponding path program 1 times [2022-11-03 01:39:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:26,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17260025] [2022-11-03 01:39:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 01:39:26,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:26,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17260025] [2022-11-03 01:39:26,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17260025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:26,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459018173] [2022-11-03 01:39:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:26,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:26,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:26,580 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:26,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:39:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:26,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:39:26,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 01:39:26,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:26,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459018173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:26,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:26,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-11-03 01:39:26,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088298117] [2022-11-03 01:39:26,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:26,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:26,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:26,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:26,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:39:26,741 INFO L87 Difference]: Start difference. First operand 2624 states and 3429 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:27,030 INFO L93 Difference]: Finished difference Result 3732 states and 4907 transitions. [2022-11-03 01:39:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:27,030 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2022-11-03 01:39:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:27,042 INFO L225 Difference]: With dead ends: 3732 [2022-11-03 01:39:27,042 INFO L226 Difference]: Without dead ends: 2560 [2022-11-03 01:39:27,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:39:27,048 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:27,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 195 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2022-11-03 01:39:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2560. [2022-11-03 01:39:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1948 states have (on average 1.282340862422998) internal successors, (2498), 1969 states have internal predecessors, (2498), 358 states have call successors, (358), 254 states have call predecessors, (358), 253 states have return successors, (487), 337 states have call predecessors, (487), 356 states have call successors, (487) [2022-11-03 01:39:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3343 transitions. [2022-11-03 01:39:27,386 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3343 transitions. Word has length 105 [2022-11-03 01:39:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:27,386 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3343 transitions. [2022-11-03 01:39:27,387 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3343 transitions. [2022-11-03 01:39:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-03 01:39:27,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:27,392 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] [2022-11-03 01:39:27,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:27,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 01:39:27,607 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash -603159981, now seen corresponding path program 1 times [2022-11-03 01:39:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:27,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177111833] [2022-11-03 01:39:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:27,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 01:39:27,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:27,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177111833] [2022-11-03 01:39:27,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177111833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:27,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79927141] [2022-11-03 01:39:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:27,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:27,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:27,774 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:27,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:39:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:27,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:39:27,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 01:39:27,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:27,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79927141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:27,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:27,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-11-03 01:39:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728454857] [2022-11-03 01:39:27,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:27,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:27,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:27,986 INFO L87 Difference]: Start difference. First operand 2560 states and 3343 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:28,498 INFO L93 Difference]: Finished difference Result 4695 states and 6272 transitions. [2022-11-03 01:39:28,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:28,499 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2022-11-03 01:39:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:28,514 INFO L225 Difference]: With dead ends: 4695 [2022-11-03 01:39:28,514 INFO L226 Difference]: Without dead ends: 2942 [2022-11-03 01:39:28,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:28,520 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 73 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:28,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 138 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2022-11-03 01:39:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2898. [2022-11-03 01:39:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2254 states have (on average 1.2519964507542147) internal successors, (2822), 2275 states have internal predecessors, (2822), 360 states have call successors, (360), 284 states have call predecessors, (360), 283 states have return successors, (535), 339 states have call predecessors, (535), 358 states have call successors, (535) [2022-11-03 01:39:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3717 transitions. [2022-11-03 01:39:28,918 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3717 transitions. Word has length 105 [2022-11-03 01:39:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:28,919 INFO L495 AbstractCegarLoop]: Abstraction has 2898 states and 3717 transitions. [2022-11-03 01:39:28,919 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3717 transitions. [2022-11-03 01:39:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 01:39:28,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:28,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:28,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:29,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:39:29,155 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:29,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash -152060694, now seen corresponding path program 1 times [2022-11-03 01:39:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:29,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89768661] [2022-11-03 01:39:29,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:29,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-03 01:39:29,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:29,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89768661] [2022-11-03 01:39:29,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89768661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:29,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268102501] [2022-11-03 01:39:29,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:29,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:29,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:29,253 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:29,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:39:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:29,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:39:29,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 01:39:29,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:29,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268102501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:29,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:29,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:39:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672475578] [2022-11-03 01:39:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:29,412 INFO L87 Difference]: Start difference. First operand 2898 states and 3717 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:39:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:29,796 INFO L93 Difference]: Finished difference Result 4551 states and 5809 transitions. [2022-11-03 01:39:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2022-11-03 01:39:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:29,811 INFO L225 Difference]: With dead ends: 4551 [2022-11-03 01:39:29,811 INFO L226 Difference]: Without dead ends: 3287 [2022-11-03 01:39:29,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:29,816 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 50 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:29,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 231 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:39:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2022-11-03 01:39:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 3066. [2022-11-03 01:39:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2390 states have (on average 1.2560669456066946) internal successors, (3002), 2411 states have internal predecessors, (3002), 376 states have call successors, (376), 300 states have call predecessors, (376), 299 states have return successors, (551), 355 states have call predecessors, (551), 374 states have call successors, (551) [2022-11-03 01:39:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 3929 transitions. [2022-11-03 01:39:30,190 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 3929 transitions. Word has length 102 [2022-11-03 01:39:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:30,190 INFO L495 AbstractCegarLoop]: Abstraction has 3066 states and 3929 transitions. [2022-11-03 01:39:30,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:39:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 3929 transitions. [2022-11-03 01:39:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-03 01:39:30,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:30,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:30,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:39:30,425 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1415943884, now seen corresponding path program 1 times [2022-11-03 01:39:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355524018] [2022-11-03 01:39:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 01:39:30,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:30,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355524018] [2022-11-03 01:39:30,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355524018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:30,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733858750] [2022-11-03 01:39:30,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:30,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:30,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:30,592 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:30,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:39:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:30,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:39:30,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:39:30,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:30,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733858750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:30,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-03 01:39:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248098055] [2022-11-03 01:39:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:30,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:39:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:39:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:30,853 INFO L87 Difference]: Start difference. First operand 3066 states and 3929 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 01:39:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:31,394 INFO L93 Difference]: Finished difference Result 6719 states and 8651 transitions. [2022-11-03 01:39:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:39:31,394 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), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 103 [2022-11-03 01:39:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:31,410 INFO L225 Difference]: With dead ends: 6719 [2022-11-03 01:39:31,410 INFO L226 Difference]: Without dead ends: 4025 [2022-11-03 01:39:31,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:31,418 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 131 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:31,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 257 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:39:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2022-11-03 01:39:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3579. [2022-11-03 01:39:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 2836 states have (on average 1.2383638928067702) internal successors, (3512), 2865 states have internal predecessors, (3512), 399 states have call successors, (399), 339 states have call predecessors, (399), 343 states have return successors, (586), 375 states have call predecessors, (586), 397 states have call successors, (586) [2022-11-03 01:39:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 4497 transitions. [2022-11-03 01:39:31,899 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 4497 transitions. Word has length 103 [2022-11-03 01:39:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:31,900 INFO L495 AbstractCegarLoop]: Abstraction has 3579 states and 4497 transitions. [2022-11-03 01:39:31,900 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), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 01:39:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4497 transitions. [2022-11-03 01:39:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-03 01:39:31,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:31,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:31,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:32,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:32,123 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash -899203952, now seen corresponding path program 1 times [2022-11-03 01:39:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:32,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203620709] [2022-11-03 01:39:32,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 01:39:32,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:32,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203620709] [2022-11-03 01:39:32,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203620709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:32,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:32,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:39:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193012362] [2022-11-03 01:39:32,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:32,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:39:32,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:32,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:39:32,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:39:32,328 INFO L87 Difference]: Start difference. First operand 3579 states and 4497 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:33,351 INFO L93 Difference]: Finished difference Result 8916 states and 11205 transitions. [2022-11-03 01:39:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:39:33,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2022-11-03 01:39:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:33,368 INFO L225 Difference]: With dead ends: 8916 [2022-11-03 01:39:33,369 INFO L226 Difference]: Without dead ends: 4646 [2022-11-03 01:39:33,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:33,379 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 76 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:33,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 364 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:39:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2022-11-03 01:39:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 4472. [2022-11-03 01:39:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4472 states, 3503 states have (on average 1.2169568940907793) internal successors, (4263), 3547 states have internal predecessors, (4263), 519 states have call successors, (519), 435 states have call predecessors, (519), 449 states have return successors, (779), 490 states have call predecessors, (779), 517 states have call successors, (779) [2022-11-03 01:39:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4472 states to 4472 states and 5561 transitions. [2022-11-03 01:39:33,989 INFO L78 Accepts]: Start accepts. Automaton has 4472 states and 5561 transitions. Word has length 104 [2022-11-03 01:39:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:33,990 INFO L495 AbstractCegarLoop]: Abstraction has 4472 states and 5561 transitions. [2022-11-03 01:39:33,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:39:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4472 states and 5561 transitions. [2022-11-03 01:39:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-03 01:39:33,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:33,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:33,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 01:39:33,998 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash -387466511, now seen corresponding path program 1 times [2022-11-03 01:39:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:33,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519422712] [2022-11-03 01:39:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 01:39:34,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:34,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519422712] [2022-11-03 01:39:34,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519422712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:34,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397870508] [2022-11-03 01:39:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:34,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:34,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:34,182 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:34,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:39:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:34,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 01:39:34,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:39:34,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:34,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397870508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:34,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:34,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 01:39:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032124528] [2022-11-03 01:39:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:34,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:39:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:39:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:34,400 INFO L87 Difference]: Start difference. First operand 4472 states and 5561 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 01:39:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:35,323 INFO L93 Difference]: Finished difference Result 8863 states and 11121 transitions. [2022-11-03 01:39:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:39:35,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 104 [2022-11-03 01:39:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:35,338 INFO L225 Difference]: With dead ends: 8863 [2022-11-03 01:39:35,338 INFO L226 Difference]: Without dead ends: 5774 [2022-11-03 01:39:35,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:39:35,347 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 184 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:35,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 378 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:39:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2022-11-03 01:39:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 5498. [2022-11-03 01:39:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5498 states, 4298 states have (on average 1.208469055374593) internal successors, (5194), 4348 states have internal predecessors, (5194), 649 states have call successors, (649), 539 states have call predecessors, (649), 550 states have return successors, (1012), 611 states have call predecessors, (1012), 647 states have call successors, (1012) [2022-11-03 01:39:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5498 states to 5498 states and 6855 transitions. [2022-11-03 01:39:35,986 INFO L78 Accepts]: Start accepts. Automaton has 5498 states and 6855 transitions. Word has length 104 [2022-11-03 01:39:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:35,987 INFO L495 AbstractCegarLoop]: Abstraction has 5498 states and 6855 transitions. [2022-11-03 01:39:35,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 01:39:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5498 states and 6855 transitions. [2022-11-03 01:39:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-03 01:39:35,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:35,994 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] [2022-11-03 01:39:36,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-03 01:39:36,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 01:39:36,223 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1811956828, now seen corresponding path program 1 times [2022-11-03 01:39:36,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:36,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136309681] [2022-11-03 01:39:36,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:39:36,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:36,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136309681] [2022-11-03 01:39:36,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136309681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:36,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586279019] [2022-11-03 01:39:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:36,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:36,796 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:36,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:39:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:36,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 01:39:36,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:39:37,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-03 01:39:37,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586279019] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:37,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1014622900] [2022-11-03 01:39:37,390 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2022-11-03 01:39:37,391 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:39:37,396 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:39:37,402 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:39:37,403 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:39:50,021 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 186 for LOIs [2022-11-03 01:39:54,231 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 132 for LOIs [2022-11-03 01:39:54,259 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 195 for LOIs [2022-11-03 01:39:54,321 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 81 for LOIs [2022-11-03 01:39:54,529 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 132 for LOIs [2022-11-03 01:39:54,804 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 219 for LOIs [2022-11-03 01:39:55,606 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:40:18,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1014622900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:18,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:40:18,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [13, 8, 6] total 64 [2022-11-03 01:40:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574416982] [2022-11-03 01:40:18,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:18,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-03 01:40:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-03 01:40:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=3598, Unknown=0, NotChecked=0, Total=4032 [2022-11-03 01:40:18,729 INFO L87 Difference]: Start difference. First operand 5498 states and 6855 transitions. Second operand has 45 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 states have internal predecessors, (46), 12 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 01:40:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:45,511 INFO L93 Difference]: Finished difference Result 10442 states and 13007 transitions. [2022-11-03 01:40:45,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-03 01:40:45,512 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 states have internal predecessors, (46), 12 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) Word has length 110 [2022-11-03 01:40:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:45,528 INFO L225 Difference]: With dead ends: 10442 [2022-11-03 01:40:45,529 INFO L226 Difference]: Without dead ends: 5003 [2022-11-03 01:40:45,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3952 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=1275, Invalid=10935, Unknown=0, NotChecked=0, Total=12210 [2022-11-03 01:40:45,543 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 276 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:45,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1151 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-03 01:40:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2022-11-03 01:40:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 4939. [2022-11-03 01:40:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 3856 states have (on average 1.2033195020746887) internal successors, (4640), 3897 states have internal predecessors, (4640), 586 states have call successors, (586), 489 states have call predecessors, (586), 496 states have return successors, (908), 553 states have call predecessors, (908), 584 states have call successors, (908) [2022-11-03 01:40:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 6134 transitions. [2022-11-03 01:40:46,214 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 6134 transitions. Word has length 110 [2022-11-03 01:40:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:46,217 INFO L495 AbstractCegarLoop]: Abstraction has 4939 states and 6134 transitions. [2022-11-03 01:40:46,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 states have internal predecessors, (46), 12 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 01:40:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 6134 transitions. [2022-11-03 01:40:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-03 01:40:46,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:46,224 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:40:46,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:40:46,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:40:46,439 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:40:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash 45843853, now seen corresponding path program 1 times [2022-11-03 01:40:46,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:46,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438284787] [2022-11-03 01:40:46,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:46,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:40:47,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:47,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438284787] [2022-11-03 01:40:47,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438284787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:40:47,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090508124] [2022-11-03 01:40:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:47,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:40:47,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:40:47,012 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:40:47,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:40:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:47,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 01:40:47,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:40:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 54 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:40:47,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:40:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-03 01:40:47,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090508124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:40:47,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193024054] [2022-11-03 01:40:47,575 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2022-11-03 01:40:47,576 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:40:47,576 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:40:47,576 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:40:47,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:41:02,495 INFO L197 IcfgInterpreter]: Interpreting procedure error2 with input of size 69 for LOIs [2022-11-03 01:41:02,499 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 132 for LOIs [2022-11-03 01:41:02,537 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 132 for LOIs [2022-11-03 01:41:02,566 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 132 for LOIs [2022-11-03 01:41:02,587 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 81 for LOIs [2022-11-03 01:41:02,699 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 128 for LOIs [2022-11-03 01:41:03,135 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 151 for LOIs [2022-11-03 01:41:03,176 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:41:27,777 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '188115#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~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 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= ~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) (= ~t~0 0) (= ~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) (= |#NULL.offset| 0) (= ~a_t~0 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:41:27,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:41:27,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:27,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2022-11-03 01:41:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626247336] [2022-11-03 01:41:27,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:27,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 01:41:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 01:41:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=4668, Unknown=0, NotChecked=0, Total=5112 [2022-11-03 01:41:27,782 INFO L87 Difference]: Start difference. First operand 4939 states and 6134 transitions. Second operand has 21 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 01:41:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:30,986 INFO L93 Difference]: Finished difference Result 8887 states and 10960 transitions. [2022-11-03 01:41:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-03 01:41:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 112 [2022-11-03 01:41:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:31,002 INFO L225 Difference]: With dead ends: 8887 [2022-11-03 01:41:31,002 INFO L226 Difference]: Without dead ends: 3958 [2022-11-03 01:41:31,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 319 SyntacticMatches, 3 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8446 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=1322, Invalid=18700, Unknown=0, NotChecked=0, Total=20022 [2022-11-03 01:41:31,018 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 785 mSDsluCounter, 2573 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:31,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 2366 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 01:41:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2022-11-03 01:41:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 2934. [2022-11-03 01:41:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2301 states have (on average 1.1686223381138636) internal successors, (2689), 2314 states have internal predecessors, (2689), 334 states have call successors, (334), 301 states have call predecessors, (334), 298 states have return successors, (423), 318 states have call predecessors, (423), 332 states have call successors, (423) [2022-11-03 01:41:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 3446 transitions. [2022-11-03 01:41:31,506 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 3446 transitions. Word has length 112 [2022-11-03 01:41:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:31,506 INFO L495 AbstractCegarLoop]: Abstraction has 2934 states and 3446 transitions. [2022-11-03 01:41:31,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 01:41:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 3446 transitions. [2022-11-03 01:41:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-03 01:41:31,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:31,511 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] [2022-11-03 01:41:31,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:31,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 01:41:31,725 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1410614420, now seen corresponding path program 1 times [2022-11-03 01:41:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:31,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477443685] [2022-11-03 01:41:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:41:32,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:32,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477443685] [2022-11-03 01:41:32,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477443685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:32,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597196369] [2022-11-03 01:41:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:32,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:32,241 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:32,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 01:41:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:32,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 01:41:32,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:41:32,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-03 01:41:32,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597196369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:32,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1988812544] [2022-11-03 01:41:32,781 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2022-11-03 01:41:32,781 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:32,781 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:41:32,782 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:41:32,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:41:47,378 INFO L197 IcfgInterpreter]: Interpreting procedure error2 with input of size 69 for LOIs [2022-11-03 01:41:47,383 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 132 for LOIs [2022-11-03 01:41:47,417 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 132 for LOIs [2022-11-03 01:41:47,444 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 151 for LOIs [2022-11-03 01:41:47,470 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 81 for LOIs [2022-11-03 01:41:47,550 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 128 for LOIs [2022-11-03 01:41:47,856 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 132 for LOIs [2022-11-03 01:41:47,891 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:42:14,815 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '205525#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~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) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= ~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) (= ~t~0 0) (= ~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) (= |#NULL.offset| 0) (= ~a_t~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 01:42:14,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:42:14,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:42:14,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2022-11-03 01:42:14,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967023344] [2022-11-03 01:42:14,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:42:14,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 01:42:14,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:42:14,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 01:42:14,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=4861, Unknown=0, NotChecked=0, Total=5256 [2022-11-03 01:42:14,819 INFO L87 Difference]: Start difference. First operand 2934 states and 3446 transitions. Second operand has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 01:42:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:42:18,980 INFO L93 Difference]: Finished difference Result 5366 states and 6347 transitions. [2022-11-03 01:42:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-11-03 01:42:18,980 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 113 [2022-11-03 01:42:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:42:18,987 INFO L225 Difference]: With dead ends: 5366 [2022-11-03 01:42:18,987 INFO L226 Difference]: Without dead ends: 2582 [2022-11-03 01:42:18,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 319 SyntacticMatches, 9 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13506 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=1758, Invalid=29394, Unknown=0, NotChecked=0, Total=31152 [2022-11-03 01:42:18,999 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 1183 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:42:19,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1632 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 01:42:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2022-11-03 01:42:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2131. [2022-11-03 01:42:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 1678 states have (on average 1.1626936829558998) internal successors, (1951), 1687 states have internal predecessors, (1951), 235 states have call successors, (235), 218 states have call predecessors, (235), 217 states have return successors, (305), 225 states have call predecessors, (305), 233 states have call successors, (305) [2022-11-03 01:42:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2491 transitions. [2022-11-03 01:42:19,333 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2491 transitions. Word has length 113 [2022-11-03 01:42:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:42:19,334 INFO L495 AbstractCegarLoop]: Abstraction has 2131 states and 2491 transitions. [2022-11-03 01:42:19,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 01:42:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2491 transitions. [2022-11-03 01:42:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-03 01:42:19,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:19,337 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] [2022-11-03 01:42:19,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:42:19,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 01:42:19,555 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:42:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash 875095461, now seen corresponding path program 1 times [2022-11-03 01:42:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:42:19,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449064567] [2022-11-03 01:42:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:19,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:42:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 01:42:20,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:42:20,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449064567] [2022-11-03 01:42:20,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449064567] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:42:20,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555439426] [2022-11-03 01:42:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:20,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:20,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:42:20,223 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:42:20,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 01:42:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:20,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 01:42:20,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:42:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:42:20,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:42:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-03 01:42:21,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555439426] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:42:21,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [135763748] [2022-11-03 01:42:21,768 INFO L159 IcfgInterpreter]: Started Sifa with 70 locations of interest [2022-11-03 01:42:21,768 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:42:21,769 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:42:21,769 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:42:21,769 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:42:37,793 INFO L197 IcfgInterpreter]: Interpreting procedure error2 with input of size 79 for LOIs [2022-11-03 01:42:37,799 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 200 for LOIs [2022-11-03 01:42:45,332 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 145 for LOIs [2022-11-03 01:42:45,364 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 206 for LOIs [2022-11-03 01:42:45,455 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 138 for LOIs [2022-11-03 01:42:45,808 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 130 for LOIs [2022-11-03 01:42:46,191 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 151 for LOIs [2022-11-03 01:42:46,225 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:03,421 WARN L234 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 386 DAG size of output: 227 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:43:25,114 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '216914#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~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 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= ~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) (= ~t~0 0) (= ~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) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:25,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:25,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:25,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 14] total 39 [2022-11-03 01:43:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650244522] [2022-11-03 01:43:25,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:25,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 01:43:25,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 01:43:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=7755, Unknown=0, NotChecked=0, Total=8372 [2022-11-03 01:43:25,116 INFO L87 Difference]: Start difference. First operand 2131 states and 2491 transitions. Second operand has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (45), 12 states have call predecessors, (45), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2022-11-03 01:43:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:42,160 INFO L93 Difference]: Finished difference Result 7836 states and 9252 transitions. [2022-11-03 01:43:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-11-03 01:43:42,161 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (45), 12 states have call predecessors, (45), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) Word has length 115 [2022-11-03 01:43:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:42,174 INFO L225 Difference]: With dead ends: 7836 [2022-11-03 01:43:42,174 INFO L226 Difference]: Without dead ends: 5957 [2022-11-03 01:43:42,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 321 SyntacticMatches, 18 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32367 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=8279, Invalid=68727, Unknown=0, NotChecked=0, Total=77006 [2022-11-03 01:43:42,187 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 4496 mSDsluCounter, 2848 mSDsCounter, 0 mSdLazyCounter, 7418 mSolverCounterSat, 3714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4496 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 11132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3714 IncrementalHoareTripleChecker+Valid, 7418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:42,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4496 Valid, 2653 Invalid, 11132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3714 Valid, 7418 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-03 01:43:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2022-11-03 01:43:42,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 2591. [2022-11-03 01:43:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 2017 states have (on average 1.1497273177987108) internal successors, (2319), 2043 states have internal predecessors, (2319), 293 states have call successors, (293), 271 states have call predecessors, (293), 280 states have return successors, (357), 276 states have call predecessors, (357), 291 states have call successors, (357) [2022-11-03 01:43:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 2969 transitions. [2022-11-03 01:43:42,693 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 2969 transitions. Word has length 115 [2022-11-03 01:43:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:42,694 INFO L495 AbstractCegarLoop]: Abstraction has 2591 states and 2969 transitions. [2022-11-03 01:43:42,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (45), 12 states have call predecessors, (45), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2022-11-03 01:43:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 2969 transitions. [2022-11-03 01:43:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-03 01:43:42,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:42,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:42,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:42,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 01:43:42,919 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 209083088, now seen corresponding path program 1 times [2022-11-03 01:43:42,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:42,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991038784] [2022-11-03 01:43:42,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:42,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-03 01:43:43,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:43,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991038784] [2022-11-03 01:43:43,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991038784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:43,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:43,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:43:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243840308] [2022-11-03 01:43:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:43,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:43:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:43:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:43:43,137 INFO L87 Difference]: Start difference. First operand 2591 states and 2969 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 01:43:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:44,426 INFO L93 Difference]: Finished difference Result 6824 states and 7863 transitions. [2022-11-03 01:43:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:43:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 128 [2022-11-03 01:43:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:44,439 INFO L225 Difference]: With dead ends: 6824 [2022-11-03 01:43:44,439 INFO L226 Difference]: Without dead ends: 5046 [2022-11-03 01:43:44,444 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 [2022-11-03 01:43:44,445 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 236 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:44,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 570 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:43:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5046 states. [2022-11-03 01:43:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5046 to 3638. [2022-11-03 01:43:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3638 states, 2821 states have (on average 1.1566820276497696) internal successors, (3263), 2853 states have internal predecessors, (3263), 415 states have call successors, (415), 380 states have call predecessors, (415), 401 states have return successors, (499), 404 states have call predecessors, (499), 413 states have call successors, (499) [2022-11-03 01:43:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 4177 transitions. [2022-11-03 01:43:45,334 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 4177 transitions. Word has length 128 [2022-11-03 01:43:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:45,335 INFO L495 AbstractCegarLoop]: Abstraction has 3638 states and 4177 transitions. [2022-11-03 01:43:45,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 01:43:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 4177 transitions. [2022-11-03 01:43:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-03 01:43:45,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:45,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:45,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-03 01:43:45,339 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1120039540, now seen corresponding path program 1 times [2022-11-03 01:43:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:45,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939006248] [2022-11-03 01:43:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:43:45,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 01:43:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:43:45,474 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 01:43:45,474 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 01:43:45,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 01:43:45,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 01:43:45,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 01:43:45,481 INFO L444 BasicCegarLoop]: Path program histogram: [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] [2022-11-03 01:43:45,486 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:43:45,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:43:45 BoogieIcfgContainer [2022-11-03 01:43:45,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:43:45,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:43:45,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:43:45,690 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:43:45,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:39:11" (3/4) ... [2022-11-03 01:43:45,693 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 01:43:45,847 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:43:45,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:43:45,849 INFO L158 Benchmark]: Toolchain (without parser) took 275796.35ms. Allocated memory was 98.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 60.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 237.8MB. Max. memory is 16.1GB. [2022-11-03 01:43:45,849 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory was 78.2MB in the beginning and 78.1MB in the end (delta: 87.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:43:45,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.11ms. Allocated memory is still 98.6MB. Free memory was 60.7MB in the beginning and 65.8MB in the end (delta: -5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:43:45,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.15ms. Allocated memory is still 98.6MB. Free memory was 65.5MB in the beginning and 62.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:43:45,852 INFO L158 Benchmark]: Boogie Preprocessor took 84.44ms. Allocated memory is still 98.6MB. Free memory was 62.6MB in the beginning and 60.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:43:45,858 INFO L158 Benchmark]: RCFGBuilder took 1183.30ms. Allocated memory was 98.6MB in the beginning and 140.5MB in the end (delta: 41.9MB). Free memory was 60.1MB in the beginning and 68.8MB in the end (delta: -8.7MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-11-03 01:43:45,859 INFO L158 Benchmark]: TraceAbstraction took 273780.70ms. Allocated memory was 140.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 67.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 184.0MB. Max. memory is 16.1GB. [2022-11-03 01:43:45,861 INFO L158 Benchmark]: Witness Printer took 157.81ms. Allocated memory is still 1.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-03 01:43:45,864 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory was 78.2MB in the beginning and 78.1MB in the end (delta: 87.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.11ms. Allocated memory is still 98.6MB. Free memory was 60.7MB in the beginning and 65.8MB in the end (delta: -5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.15ms. Allocated memory is still 98.6MB. Free memory was 65.5MB in the beginning and 62.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.44ms. Allocated memory is still 98.6MB. Free memory was 62.6MB in the beginning and 60.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1183.30ms. Allocated memory was 98.6MB in the beginning and 140.5MB in the end (delta: 41.9MB). Free memory was 60.1MB in the beginning and 68.8MB in the end (delta: -8.7MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 273780.70ms. Allocated memory was 140.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 67.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 184.0MB. Max. memory is 16.1GB. * Witness Printer took 157.81ms. Allocated memory is still 1.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int m_st ; [L607] int t1_st ; [L608] int t2_st ; [L609] int m_i ; [L610] int t1_i ; [L611] int t2_i ; [L612] int M_E = 2; [L613] int T1_E = 2; [L614] int T2_E = 2; [L615] int E_M = 2; [L616] int E_1 = 2; [L617] int E_2 = 2; [L622] int token ; [L624] int local ; [L1202] COND FALSE !(__VERIFIER_nondet_int()) [L1205] CALL main2() [L1189] int __retres1 ; [L1193] CALL init_model2() [L1103] m_i = 1 [L1104] t1_i = 1 [L1105] t2_i = 1 [L1193] RET init_model2() [L1194] CALL start_simulation2() [L1130] int kernel_st ; [L1131] int tmp ; [L1132] int tmp___0 ; [L1136] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1137] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] CALL init_threads2() [L822] COND TRUE m_i == 1 [L823] m_st = 0 [L827] COND TRUE t1_i == 1 [L828] t1_st = 0 [L832] COND TRUE t2_i == 1 [L833] t2_st = 0 [L1138] RET init_threads2() [L1139] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L935] COND FALSE !(M_E == 0) [L940] COND FALSE !(T1_E == 0) [L945] COND FALSE !(T2_E == 0) [L950] COND FALSE !(E_M == 0) [L955] COND FALSE !(E_1 == 0) [L960] COND FALSE !(E_2 == 0) [L1139] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1140] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] return (__retres1); [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L776] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L786] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L788] return (__retres1); [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L795] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L807] return (__retres1); [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) [L1140] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L973] COND FALSE !(M_E == 1) [L978] COND FALSE !(T1_E == 1) [L983] COND FALSE !(T2_E == 1) [L988] COND FALSE !(E_M == 1) [L993] COND FALSE !(E_1 == 1) [L998] COND FALSE !(E_2 == 1) [L1141] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1144] COND TRUE 1 [L1147] kernel_st = 1 [L1148] CALL eval2() [L868] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L872] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] int __retres1 ; [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 [L863] return (__retres1); [L875] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L696] COND TRUE 1 [L698] t1_pc = 1 [L699] t1_st = 2 [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L732] COND TRUE 1 [L734] t2_pc = 1 [L735] t2_st = 2 [L916] RET transmit2() [L872] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L875] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L842] int __retres1 ; [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 [L863] return (__retres1); [L875] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L640] COND TRUE 1 [L643] token = __VERIFIER_nondet_int() [L644] local = token [L645] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L646] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1046] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L769] return (__retres1); [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L777] COND TRUE E_1 == 1 [L778] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L788] return (__retres1); [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND TRUE \read(tmp___0) [L1025] t1_st = 0 [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L807] return (__retres1); [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) [L1046] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L646] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L647] E_1 = 2 [L648] m_pc = 1 [L649] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L888] RET master() [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L688] COND TRUE t1_pc == 1 [L704] token += 1 [L705] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L706] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L758] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L767] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L769] return (__retres1); [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L788] return (__retres1); [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L796] COND TRUE E_2 == 1 [L797] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L807] return (__retres1); [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND TRUE \read(tmp___1) [L1033] t2_st = 0 [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L706] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L707] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L696] COND TRUE 1 [L698] t1_pc = 1 [L699] t1_st = 2 [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L724] COND TRUE t2_pc == 1 [L740] token += 1 [L741] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L758] COND TRUE E_M == 1 [L759] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L769] return (__retres1); [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND TRUE \read(tmp) [L1017] m_st = 0 [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L788] return (__retres1); [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L805] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L807] return (__retres1); [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L743] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L732] COND TRUE 1 [L734] t2_pc = 1 [L735] t2_st = 2 [L916] RET transmit2() [L872] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L875] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L842] int __retres1 ; [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 [L863] return (__retres1); [L875] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L632] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L654] COND FALSE !(token != local + 2) [L659] COND TRUE tmp_var <= 5 [L660] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L665] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L666] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L667] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L668] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L599] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 163 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 273.5s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 62.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10895 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10807 mSDsluCounter, 15210 SdHoareTripleChecker+Invalid, 13.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12758 mSDsCounter, 5796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17798 IncrementalHoareTripleChecker+Invalid, 23594 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5796 mSolverCounterUnsat, 4428 mSDtfsCounter, 17798 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3282 GetRequests, 2448 SyntacticMatches, 30 SemanticMatches, 804 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58310 ImplicationChecksByTransitivity, 151.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5498occurred in iteration=21, InterpolantAutomatonStates: 560, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 8948 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 4038 NumberOfCodeBlocks, 3954 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 4312 ConstructedInterpolants, 0 QuantifiedInterpolants, 8932 SizeOfPredicates, 25 NumberOfNonLiveVariables, 7448 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 45 InterpolantComputations, 22 PerfectInterpolantSequences, 2204/2507 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: OVERALL_TIME: 18.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 7, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 111, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 183, TOOLS_POST_TIME: 8.8s, TOOLS_POST_CALL_APPLICATIONS: 101, TOOLS_POST_CALL_TIME: 3.6s, TOOLS_POST_RETURN_APPLICATIONS: 88, TOOLS_POST_RETURN_TIME: 2.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 372, TOOLS_QUANTIFIERELIM_TIME: 14.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 4.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 379, FLUID_YES_ANSWERS: 1, DOMAIN_JOIN_APPLICATIONS: 98, DOMAIN_JOIN_TIME: 2.6s, DOMAIN_ALPHA_APPLICATIONS: 1, DOMAIN_ALPHA_TIME: 0.1s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 7, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 111, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 6.7s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 6.7s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 7, CALL_SUMMARIZER_APPLICATIONS: 88, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME: 0.3s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.3s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.2s, DAG_COMPRESSION_PROCESSED_NODES: 7279, DAG_COMPRESSION_RETAINED_NODES: 282, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 01:43:45,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830f8201-f6c3-4bb2-9883-7f9d4f721001/bin/utaipan-7li7fVZpFI/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE