./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur --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 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- 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-38b53e6 [2022-11-25 23:35:58,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:35:58,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:35:58,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:35:58,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:35:58,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:35:58,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:35:58,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:35:58,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:35:58,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:35:58,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:35:58,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:35:58,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:35:58,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:35:58,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:35:58,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:35:58,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:35:58,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:35:58,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:35:58,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:35:58,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:35:58,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:35:58,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:35:58,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:35:58,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:35:58,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:35:58,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:35:58,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:35:58,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:35:58,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:35:58,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:35:58,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:35:58,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:35:58,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:35:58,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:35:58,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:35:58,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:35:58,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:35:58,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:35:58,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:35:58,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:35:58,235 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:35:58,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:35:58,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:35:58,260 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:35:58,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:35:58,261 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:35:58,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:35:58,262 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:35:58,263 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:35:58,263 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:35:58,263 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:35:58,264 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:35:58,264 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:35:58,264 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:35:58,265 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:35:58,265 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:35:58,265 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:35:58,266 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:35:58,266 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:35:58,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:35:58,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:35:58,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:35:58,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:35:58,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:35:58,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:35:58,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:35:58,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:35:58,270 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:35:58,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:35:58,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:35:58,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:35:58,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:35:58,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:35:58,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:58,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:35:58,272 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:35:58,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:35:58,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:35:58,273 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:35:58,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:35:58,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:35:58,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:35:58,275 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_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/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_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2022-11-25 23:35:58,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:35:58,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:35:58,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:35:58,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:35:58,649 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:35:58,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2022-11-25 23:36:01,915 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:36:02,225 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:36:02,226 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/sv-benchmarks/c/systemc/transmitter.03.cil.c [2022-11-25 23:36:02,255 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/data/198e8c128/e3ab453e433b4a5a89c7ff47b51bfd4c/FLAGe759cf94b [2022-11-25 23:36:02,278 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/data/198e8c128/e3ab453e433b4a5a89c7ff47b51bfd4c [2022-11-25 23:36:02,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:36:02,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:36:02,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:36:02,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:36:02,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:36:02,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61cdfac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02, skipping insertion in model container [2022-11-25 23:36:02,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:36:02,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:36:02,574 WARN L237 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_cb577b9f-2d05-40c2-ab40-32b9afc4b655/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2022-11-25 23:36:02,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:36:02,706 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:36:02,719 WARN L237 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_cb577b9f-2d05-40c2-ab40-32b9afc4b655/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2022-11-25 23:36:02,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:36:02,785 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:36:02,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02 WrapperNode [2022-11-25 23:36:02,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:36:02,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:36:02,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:36:02,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:36:02,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,857 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 321 [2022-11-25 23:36:02,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:36:02,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:36:02,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:36:02,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:36:02,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,933 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:36:02,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:36:02,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:36:02,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:36:02,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (1/1) ... [2022-11-25 23:36:02,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:36:02,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:03,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:36:03,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:36:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:36:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-25 23:36:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-25 23:36:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-25 23:36:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-25 23:36:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-25 23:36:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-25 23:36:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-25 23:36:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-25 23:36:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-25 23:36:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-25 23:36:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:36:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-25 23:36:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-25 23:36:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:36:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:36:03,207 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:36:03,210 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:36:03,758 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:36:04,081 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:36:04,081 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-25 23:36:04,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:36:04 BoogieIcfgContainer [2022-11-25 23:36:04,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:36:04,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:36:04,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:36:04,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:36:04,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:36:02" (1/3) ... [2022-11-25 23:36:04,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15028620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:36:04, skipping insertion in model container [2022-11-25 23:36:04,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:02" (2/3) ... [2022-11-25 23:36:04,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15028620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:36:04, skipping insertion in model container [2022-11-25 23:36:04,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:36:04" (3/3) ... [2022-11-25 23:36:04,096 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2022-11-25 23:36:04,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:36:04,122 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:36:04,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:36:04,198 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;@7f3d846b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:36:04,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 23:36:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 63 states have (on average 1.507936507936508) internal successors, (95), 65 states have internal predecessors, (95), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:36:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:36:04,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:04,215 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] [2022-11-25 23:36:04,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash 199495985, now seen corresponding path program 1 times [2022-11-25 23:36:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:04,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779588456] [2022-11-25 23:36:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:04,747 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-25 23:36:04,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:04,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779588456] [2022-11-25 23:36:04,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779588456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:04,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:04,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:36:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035673016] [2022-11-25 23:36:04,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:04,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:36:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:04,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:36:04,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:36:04,804 INFO L87 Difference]: Start difference. First operand has 87 states, 63 states have (on average 1.507936507936508) internal successors, (95), 65 states have internal predecessors, (95), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 23:36:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:05,215 INFO L93 Difference]: Finished difference Result 244 states and 365 transitions. [2022-11-25 23:36:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:36:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-11-25 23:36:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:05,231 INFO L225 Difference]: With dead ends: 244 [2022-11-25 23:36:05,231 INFO L226 Difference]: Without dead ends: 158 [2022-11-25 23:36:05,236 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-25 23:36:05,240 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 202 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:05,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 294 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-25 23:36:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2022-11-25 23:36:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 115 states have (on average 1.391304347826087) internal successors, (160), 116 states have internal predecessors, (160), 27 states have call successors, (27), 12 states have call predecessors, (27), 12 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-25 23:36:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 214 transitions. [2022-11-25 23:36:05,314 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 214 transitions. Word has length 41 [2022-11-25 23:36:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:05,319 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 214 transitions. [2022-11-25 23:36:05,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 23:36:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 214 transitions. [2022-11-25 23:36:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:36:05,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:05,324 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] [2022-11-25 23:36:05,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:36:05,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1571974990, now seen corresponding path program 1 times [2022-11-25 23:36:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:05,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104573819] [2022-11-25 23:36:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:05,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:05,536 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-25 23:36:05,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:05,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104573819] [2022-11-25 23:36:05,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104573819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:05,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:05,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:36:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257278982] [2022-11-25 23:36:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:05,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:36:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:36:05,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:36:05,545 INFO L87 Difference]: Start difference. First operand 155 states and 214 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 23:36:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:06,280 INFO L93 Difference]: Finished difference Result 517 states and 715 transitions. [2022-11-25 23:36:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:36:06,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-11-25 23:36:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:06,286 INFO L225 Difference]: With dead ends: 517 [2022-11-25 23:36:06,286 INFO L226 Difference]: Without dead ends: 350 [2022-11-25 23:36:06,288 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-25 23:36:06,290 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 376 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:06,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 472 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:36:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-25 23:36:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 338. [2022-11-25 23:36:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 257 states have (on average 1.3852140077821011) internal successors, (356), 256 states have internal predecessors, (356), 52 states have call successors, (52), 26 states have call predecessors, (52), 28 states have return successors, (56), 56 states have call predecessors, (56), 52 states have call successors, (56) [2022-11-25 23:36:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 464 transitions. [2022-11-25 23:36:06,348 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 464 transitions. Word has length 41 [2022-11-25 23:36:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:06,349 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 464 transitions. [2022-11-25 23:36:06,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 23:36:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 464 transitions. [2022-11-25 23:36:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:36:06,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:06,351 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] [2022-11-25 23:36:06,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:36:06,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:06,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash 665388275, now seen corresponding path program 1 times [2022-11-25 23:36:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:06,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887321890] [2022-11-25 23:36:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:06,467 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-25 23:36:06,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:06,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887321890] [2022-11-25 23:36:06,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887321890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:06,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:06,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:36:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159056270] [2022-11-25 23:36:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:06,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:36:06,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:06,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:36:06,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:36:06,471 INFO L87 Difference]: Start difference. First operand 338 states and 464 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 23:36:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:06,981 INFO L93 Difference]: Finished difference Result 1157 states and 1606 transitions. [2022-11-25 23:36:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:36:06,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-11-25 23:36:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:06,995 INFO L225 Difference]: With dead ends: 1157 [2022-11-25 23:36:06,996 INFO L226 Difference]: Without dead ends: 793 [2022-11-25 23:36:07,005 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-25 23:36:07,009 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 378 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:07,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 385 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:36:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-11-25 23:36:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 625. [2022-11-25 23:36:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 472 states have (on average 1.3728813559322033) internal successors, (648), 472 states have internal predecessors, (648), 96 states have call successors, (96), 50 states have call predecessors, (96), 56 states have return successors, (109), 103 states have call predecessors, (109), 96 states have call successors, (109) [2022-11-25 23:36:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 853 transitions. [2022-11-25 23:36:07,168 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 853 transitions. Word has length 41 [2022-11-25 23:36:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:07,169 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 853 transitions. [2022-11-25 23:36:07,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 23:36:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 853 transitions. [2022-11-25 23:36:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 23:36:07,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:07,182 INFO L195 NwaCegarLoop]: trace histogram [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-25 23:36:07,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:36:07,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash 867807089, now seen corresponding path program 1 times [2022-11-25 23:36:07,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957279061] [2022-11-25 23:36:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:36:07,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:07,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957279061] [2022-11-25 23:36:07,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957279061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:07,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:07,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:36:07,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064443512] [2022-11-25 23:36:07,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:07,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:07,472 INFO L87 Difference]: Start difference. First operand 625 states and 853 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:36:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:07,983 INFO L93 Difference]: Finished difference Result 1802 states and 2473 transitions. [2022-11-25 23:36:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:36:07,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2022-11-25 23:36:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:07,997 INFO L225 Difference]: With dead ends: 1802 [2022-11-25 23:36:07,998 INFO L226 Difference]: Without dead ends: 1183 [2022-11-25 23:36:08,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:36:08,012 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 327 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:08,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 323 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-11-25 23:36:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1023. [2022-11-25 23:36:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 780 states have (on average 1.3576923076923078) internal successors, (1059), 779 states have internal predecessors, (1059), 146 states have call successors, (146), 84 states have call predecessors, (146), 96 states have return successors, (172), 160 states have call predecessors, (172), 146 states have call successors, (172) [2022-11-25 23:36:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1377 transitions. [2022-11-25 23:36:08,159 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1377 transitions. Word has length 54 [2022-11-25 23:36:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:08,160 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1377 transitions. [2022-11-25 23:36:08,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:36:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1377 transitions. [2022-11-25 23:36:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 23:36:08,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:08,162 INFO L195 NwaCegarLoop]: trace histogram [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-25 23:36:08,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:36:08,162 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:08,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 382878795, now seen corresponding path program 1 times [2022-11-25 23:36:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:08,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075225437] [2022-11-25 23:36:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:36:08,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075225437] [2022-11-25 23:36:08,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075225437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:08,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:08,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:36:08,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899673014] [2022-11-25 23:36:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:08,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:08,420 INFO L87 Difference]: Start difference. First operand 1023 states and 1377 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:36:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:09,084 INFO L93 Difference]: Finished difference Result 3361 states and 4536 transitions. [2022-11-25 23:36:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:36:09,085 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), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2022-11-25 23:36:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:09,100 INFO L225 Difference]: With dead ends: 3361 [2022-11-25 23:36:09,100 INFO L226 Difference]: Without dead ends: 2344 [2022-11-25 23:36:09,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:36:09,104 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 332 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:09,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 288 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2022-11-25 23:36:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1930. [2022-11-25 23:36:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1477 states have (on average 1.3412322274881516) internal successors, (1981), 1476 states have internal predecessors, (1981), 270 states have call successors, (270), 162 states have call predecessors, (270), 182 states have return successors, (312), 292 states have call predecessors, (312), 270 states have call successors, (312) [2022-11-25 23:36:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2563 transitions. [2022-11-25 23:36:09,343 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2563 transitions. Word has length 56 [2022-11-25 23:36:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:09,344 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 2563 transitions. [2022-11-25 23:36:09,344 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), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:36:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2563 transitions. [2022-11-25 23:36:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:36:09,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:09,346 INFO L195 NwaCegarLoop]: trace histogram [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-25 23:36:09,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:36:09,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1067192465, now seen corresponding path program 1 times [2022-11-25 23:36:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:09,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678213927] [2022-11-25 23:36:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:36:09,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:09,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678213927] [2022-11-25 23:36:09,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678213927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:09,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:09,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:36:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638516196] [2022-11-25 23:36:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:09,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:09,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:09,566 INFO L87 Difference]: Start difference. First operand 1930 states and 2563 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:36:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:10,244 INFO L93 Difference]: Finished difference Result 5080 states and 6771 transitions. [2022-11-25 23:36:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:36:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-11-25 23:36:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:10,263 INFO L225 Difference]: With dead ends: 5080 [2022-11-25 23:36:10,263 INFO L226 Difference]: Without dead ends: 3156 [2022-11-25 23:36:10,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:36:10,269 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 294 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:10,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 258 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2022-11-25 23:36:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 2858. [2022-11-25 23:36:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2185 states have (on average 1.3249427917620138) internal successors, (2895), 2178 states have internal predecessors, (2895), 402 states have call successors, (402), 244 states have call predecessors, (402), 270 states have return successors, (456), 436 states have call predecessors, (456), 402 states have call successors, (456) [2022-11-25 23:36:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3753 transitions. [2022-11-25 23:36:10,643 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3753 transitions. Word has length 58 [2022-11-25 23:36:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:10,644 INFO L495 AbstractCegarLoop]: Abstraction has 2858 states and 3753 transitions. [2022-11-25 23:36:10,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:36:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3753 transitions. [2022-11-25 23:36:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 23:36:10,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:10,647 INFO L195 NwaCegarLoop]: trace histogram [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-25 23:36:10,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:36:10,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1438822483, now seen corresponding path program 1 times [2022-11-25 23:36:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:10,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535640099] [2022-11-25 23:36:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:36:10,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:10,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535640099] [2022-11-25 23:36:10,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535640099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:10,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:10,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:36:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270032576] [2022-11-25 23:36:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:10,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:10,712 INFO L87 Difference]: Start difference. First operand 2858 states and 3753 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:36:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:11,172 INFO L93 Difference]: Finished difference Result 5403 states and 7177 transitions. [2022-11-25 23:36:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:11,173 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-11-25 23:36:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:11,191 INFO L225 Difference]: With dead ends: 5403 [2022-11-25 23:36:11,191 INFO L226 Difference]: Without dead ends: 3765 [2022-11-25 23:36:11,196 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-25 23:36:11,197 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 63 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:11,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 261 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2022-11-25 23:36:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3122. [2022-11-25 23:36:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2413 states have (on average 1.3323663489432243) internal successors, (3215), 2406 states have internal predecessors, (3215), 420 states have call successors, (420), 262 states have call predecessors, (420), 288 states have return successors, (474), 454 states have call predecessors, (474), 420 states have call successors, (474) [2022-11-25 23:36:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4109 transitions. [2022-11-25 23:36:11,540 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4109 transitions. Word has length 60 [2022-11-25 23:36:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:11,541 INFO L495 AbstractCegarLoop]: Abstraction has 3122 states and 4109 transitions. [2022-11-25 23:36:11,541 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:36:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4109 transitions. [2022-11-25 23:36:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 23:36:11,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:11,544 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 23:36:11,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:36:11,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1972205596, now seen corresponding path program 1 times [2022-11-25 23:36:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:11,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009602426] [2022-11-25 23:36:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 23:36:11,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:11,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009602426] [2022-11-25 23:36:11,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009602426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:11,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:11,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:36:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235342274] [2022-11-25 23:36:11,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:11,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:11,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:11,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:11,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:11,607 INFO L87 Difference]: Start difference. First operand 3122 states and 4109 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 23:36:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:12,133 INFO L93 Difference]: Finished difference Result 5607 states and 7434 transitions. [2022-11-25 23:36:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:12,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-11-25 23:36:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:12,163 INFO L225 Difference]: With dead ends: 5607 [2022-11-25 23:36:12,163 INFO L226 Difference]: Without dead ends: 3498 [2022-11-25 23:36:12,170 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-25 23:36:12,172 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 86 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:12,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 199 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2022-11-25 23:36:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3002. [2022-11-25 23:36:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2329 states have (on average 1.326320309145556) internal successors, (3089), 2324 states have internal predecessors, (3089), 408 states have call successors, (408), 258 states have call predecessors, (408), 264 states have return successors, (420), 420 states have call predecessors, (420), 408 states have call successors, (420) [2022-11-25 23:36:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3917 transitions. [2022-11-25 23:36:12,524 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3917 transitions. Word has length 67 [2022-11-25 23:36:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:12,524 INFO L495 AbstractCegarLoop]: Abstraction has 3002 states and 3917 transitions. [2022-11-25 23:36:12,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 23:36:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3917 transitions. [2022-11-25 23:36:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 23:36:12,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:12,532 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:12,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:36:12,533 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash 732338767, now seen corresponding path program 1 times [2022-11-25 23:36:12,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:12,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110576733] [2022-11-25 23:36:12,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 23:36:12,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:12,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110576733] [2022-11-25 23:36:12,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110576733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:12,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026334242] [2022-11-25 23:36:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:12,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:12,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:12,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:12,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:36:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:12,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:36:12,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:13,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:13,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026334242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:13,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:13,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-25 23:36:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002334214] [2022-11-25 23:36:13,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:13,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:13,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:13,027 INFO L87 Difference]: Start difference. First operand 3002 states and 3917 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, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 23:36:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:13,558 INFO L93 Difference]: Finished difference Result 5636 states and 7407 transitions. [2022-11-25 23:36:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:13,558 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, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2022-11-25 23:36:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:13,577 INFO L225 Difference]: With dead ends: 5636 [2022-11-25 23:36:13,577 INFO L226 Difference]: Without dead ends: 3630 [2022-11-25 23:36:13,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 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-25 23:36:13,586 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 54 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:13,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 253 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2022-11-25 23:36:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3290. [2022-11-25 23:36:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 2581 states have (on average 1.3347539713289422) internal successors, (3445), 2576 states have internal predecessors, (3445), 426 states have call successors, (426), 276 states have call predecessors, (426), 282 states have return successors, (438), 438 states have call predecessors, (438), 426 states have call successors, (438) [2022-11-25 23:36:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 4309 transitions. [2022-11-25 23:36:14,036 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 4309 transitions. Word has length 85 [2022-11-25 23:36:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:14,037 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 4309 transitions. [2022-11-25 23:36:14,037 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, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 23:36:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 4309 transitions. [2022-11-25 23:36:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-25 23:36:14,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:14,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:14,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:14,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:14,254 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1739936710, now seen corresponding path program 1 times [2022-11-25 23:36:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:14,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289066437] [2022-11-25 23:36:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-25 23:36:14,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:14,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289066437] [2022-11-25 23:36:14,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289066437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:14,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:14,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:36:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723553405] [2022-11-25 23:36:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:14,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:14,327 INFO L87 Difference]: Start difference. First operand 3290 states and 4309 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 23:36:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:15,115 INFO L93 Difference]: Finished difference Result 8196 states and 10771 transitions. [2022-11-25 23:36:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:15,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 82 [2022-11-25 23:36:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:15,145 INFO L225 Difference]: With dead ends: 8196 [2022-11-25 23:36:15,146 INFO L226 Difference]: Without dead ends: 4911 [2022-11-25 23:36:15,159 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-25 23:36:15,160 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 86 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:15,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 199 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2022-11-25 23:36:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4867. [2022-11-25 23:36:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 3828 states have (on average 1.3160919540229885) internal successors, (5038), 3821 states have internal predecessors, (5038), 622 states have call successors, (622), 408 states have call predecessors, (622), 416 states have return successors, (638), 638 states have call predecessors, (638), 622 states have call successors, (638) [2022-11-25 23:36:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 6298 transitions. [2022-11-25 23:36:15,762 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 6298 transitions. Word has length 82 [2022-11-25 23:36:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:15,762 INFO L495 AbstractCegarLoop]: Abstraction has 4867 states and 6298 transitions. [2022-11-25 23:36:15,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 23:36:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 6298 transitions. [2022-11-25 23:36:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 23:36:15,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:15,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:15,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:36:15,769 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1322823772, now seen corresponding path program 1 times [2022-11-25 23:36:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:15,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352121038] [2022-11-25 23:36:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:15,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 23:36:15,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352121038] [2022-11-25 23:36:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352121038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:15,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:15,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:36:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737733130] [2022-11-25 23:36:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:15,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:36:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:36:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:36:15,897 INFO L87 Difference]: Start difference. First operand 4867 states and 6298 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 23:36:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:16,807 INFO L93 Difference]: Finished difference Result 9227 states and 12056 transitions. [2022-11-25 23:36:16,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:36:16,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2022-11-25 23:36:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:16,846 INFO L225 Difference]: With dead ends: 9227 [2022-11-25 23:36:16,846 INFO L226 Difference]: Without dead ends: 6307 [2022-11-25 23:36:16,855 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-25 23:36:16,856 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 114 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:16,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 261 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2022-11-25 23:36:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 6127. [2022-11-25 23:36:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6127 states, 4998 states have (on average 1.3015206082432973) internal successors, (6505), 4997 states have internal predecessors, (6505), 628 states have call successors, (628), 486 states have call predecessors, (628), 500 states have return successors, (686), 644 states have call predecessors, (686), 628 states have call successors, (686) [2022-11-25 23:36:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6127 states to 6127 states and 7819 transitions. [2022-11-25 23:36:17,600 INFO L78 Accepts]: Start accepts. Automaton has 6127 states and 7819 transitions. Word has length 83 [2022-11-25 23:36:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:17,601 INFO L495 AbstractCegarLoop]: Abstraction has 6127 states and 7819 transitions. [2022-11-25 23:36:17,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 23:36:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6127 states and 7819 transitions. [2022-11-25 23:36:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 23:36:17,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:17,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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-25 23:36:17,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:36:17,608 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:17,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash -182472061, now seen corresponding path program 1 times [2022-11-25 23:36:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:17,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632352601] [2022-11-25 23:36:17,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:36:17,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:17,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632352601] [2022-11-25 23:36:17,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632352601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:17,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:17,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:36:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142701190] [2022-11-25 23:36:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:36:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:17,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:36:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:36:17,692 INFO L87 Difference]: Start difference. First operand 6127 states and 7819 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 23:36:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:18,741 INFO L93 Difference]: Finished difference Result 9659 states and 12575 transitions. [2022-11-25 23:36:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:36:18,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-11-25 23:36:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:18,787 INFO L225 Difference]: With dead ends: 9659 [2022-11-25 23:36:18,787 INFO L226 Difference]: Without dead ends: 6067 [2022-11-25 23:36:18,801 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-25 23:36:18,803 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 202 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:18,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 294 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:36:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2022-11-25 23:36:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 5995. [2022-11-25 23:36:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5995 states, 4875 states have (on average 1.2771282051282051) internal successors, (6226), 4865 states have internal predecessors, (6226), 628 states have call successors, (628), 486 states have call predecessors, (628), 491 states have return successors, (677), 644 states have call predecessors, (677), 628 states have call successors, (677) [2022-11-25 23:36:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5995 states to 5995 states and 7531 transitions. [2022-11-25 23:36:19,714 INFO L78 Accepts]: Start accepts. Automaton has 5995 states and 7531 transitions. Word has length 83 [2022-11-25 23:36:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:19,715 INFO L495 AbstractCegarLoop]: Abstraction has 5995 states and 7531 transitions. [2022-11-25 23:36:19,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 23:36:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5995 states and 7531 transitions. [2022-11-25 23:36:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-25 23:36:19,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:19,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:19,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:36:19,722 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:19,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1856845159, now seen corresponding path program 1 times [2022-11-25 23:36:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:19,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313943611] [2022-11-25 23:36:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:36:19,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:19,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313943611] [2022-11-25 23:36:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313943611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:19,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:36:19,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947907223] [2022-11-25 23:36:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:19,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:36:19,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:36:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:36:19,964 INFO L87 Difference]: Start difference. First operand 5995 states and 7531 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 23:36:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:21,141 INFO L93 Difference]: Finished difference Result 11621 states and 14668 transitions. [2022-11-25 23:36:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:36:21,142 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), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-11-25 23:36:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:21,176 INFO L225 Difference]: With dead ends: 11621 [2022-11-25 23:36:21,176 INFO L226 Difference]: Without dead ends: 8452 [2022-11-25 23:36:21,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:36:21,188 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 86 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:21,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 428 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8452 states. [2022-11-25 23:36:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8452 to 8101. [2022-11-25 23:36:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8101 states, 6567 states have (on average 1.2660271052230851) internal successors, (8314), 6530 states have internal predecessors, (8314), 880 states have call successors, (880), 675 states have call predecessors, (880), 653 states have return successors, (962), 896 states have call predecessors, (962), 880 states have call successors, (962) [2022-11-25 23:36:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8101 states to 8101 states and 10156 transitions. [2022-11-25 23:36:22,176 INFO L78 Accepts]: Start accepts. Automaton has 8101 states and 10156 transitions. Word has length 84 [2022-11-25 23:36:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:22,177 INFO L495 AbstractCegarLoop]: Abstraction has 8101 states and 10156 transitions. [2022-11-25 23:36:22,178 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), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 23:36:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8101 states and 10156 transitions. [2022-11-25 23:36:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-25 23:36:22,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:22,191 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:22,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:36:22,191 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1443062061, now seen corresponding path program 1 times [2022-11-25 23:36:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:22,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931317465] [2022-11-25 23:36:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 23:36:22,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:22,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931317465] [2022-11-25 23:36:22,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931317465] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:22,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669541686] [2022-11-25 23:36:22,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:22,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:22,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:36:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:22,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:36:22,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:36:23,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:23,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669541686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:23,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:23,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-11-25 23:36:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835741398] [2022-11-25 23:36:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:23,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:36:23,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:36:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:36:23,081 INFO L87 Difference]: Start difference. First operand 8101 states and 10156 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-25 23:36:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:24,262 INFO L93 Difference]: Finished difference Result 14455 states and 18447 transitions. [2022-11-25 23:36:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:36:24,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2022-11-25 23:36:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:24,285 INFO L225 Difference]: With dead ends: 14455 [2022-11-25 23:36:24,285 INFO L226 Difference]: Without dead ends: 6360 [2022-11-25 23:36:24,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:36:24,304 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 261 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:24,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 865 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2022-11-25 23:36:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 4978. [2022-11-25 23:36:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4978 states, 4130 states have (on average 1.2832929782082325) internal successors, (5300), 4118 states have internal predecessors, (5300), 462 states have call successors, (462), 388 states have call predecessors, (462), 385 states have return successors, (496), 472 states have call predecessors, (496), 462 states have call successors, (496) [2022-11-25 23:36:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 6258 transitions. [2022-11-25 23:36:24,756 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 6258 transitions. Word has length 104 [2022-11-25 23:36:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:24,757 INFO L495 AbstractCegarLoop]: Abstraction has 4978 states and 6258 transitions. [2022-11-25 23:36:24,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-25 23:36:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 6258 transitions. [2022-11-25 23:36:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-25 23:36:24,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:24,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:24,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:24,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:24,977 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:24,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1044079100, now seen corresponding path program 1 times [2022-11-25 23:36:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:24,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081160424] [2022-11-25 23:36:24,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 23:36:25,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:25,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081160424] [2022-11-25 23:36:25,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081160424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:25,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374253544] [2022-11-25 23:36:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:25,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:25,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:25,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:36:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:25,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 23:36:25,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:36:25,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:36:26,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374253544] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:26,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:36:26,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 8] total 13 [2022-11-25 23:36:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741613373] [2022-11-25 23:36:26,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:26,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:36:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:26,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:36:26,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:36:26,346 INFO L87 Difference]: Start difference. First operand 4978 states and 6258 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 23:36:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:27,436 INFO L93 Difference]: Finished difference Result 9335 states and 11921 transitions. [2022-11-25 23:36:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:36:27,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 108 [2022-11-25 23:36:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:27,460 INFO L225 Difference]: With dead ends: 9335 [2022-11-25 23:36:27,460 INFO L226 Difference]: Without dead ends: 5568 [2022-11-25 23:36:27,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:36:27,475 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 96 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:27,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 241 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2022-11-25 23:36:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 5364. [2022-11-25 23:36:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5364 states, 4489 states have (on average 1.2744486522610827) internal successors, (5721), 4495 states have internal predecessors, (5721), 462 states have call successors, (462), 397 states have call predecessors, (462), 412 states have return successors, (523), 472 states have call predecessors, (523), 462 states have call successors, (523) [2022-11-25 23:36:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 6706 transitions. [2022-11-25 23:36:28,117 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 6706 transitions. Word has length 108 [2022-11-25 23:36:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:28,118 INFO L495 AbstractCegarLoop]: Abstraction has 5364 states and 6706 transitions. [2022-11-25 23:36:28,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 23:36:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 6706 transitions. [2022-11-25 23:36:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 23:36:28,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:28,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-25 23:36:28,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:28,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:36:28,336 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1818179077, now seen corresponding path program 1 times [2022-11-25 23:36:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:28,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136023380] [2022-11-25 23:36:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:28,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 23:36:28,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:28,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136023380] [2022-11-25 23:36:28,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136023380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:28,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:28,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:36:28,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476100816] [2022-11-25 23:36:28,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:28,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:28,431 INFO L87 Difference]: Start difference. First operand 5364 states and 6706 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 23:36:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:29,108 INFO L93 Difference]: Finished difference Result 9176 states and 11602 transitions. [2022-11-25 23:36:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:29,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 109 [2022-11-25 23:36:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:29,126 INFO L225 Difference]: With dead ends: 9176 [2022-11-25 23:36:29,126 INFO L226 Difference]: Without dead ends: 5264 [2022-11-25 23:36:29,133 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-25 23:36:29,134 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 46 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:29,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 245 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2022-11-25 23:36:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 4925. [2022-11-25 23:36:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4925 states, 4126 states have (on average 1.2753271934076587) internal successors, (5262), 4132 states have internal predecessors, (5262), 424 states have call successors, (424), 359 states have call predecessors, (424), 374 states have return successors, (485), 434 states have call predecessors, (485), 424 states have call successors, (485) [2022-11-25 23:36:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 6171 transitions. [2022-11-25 23:36:29,618 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 6171 transitions. Word has length 109 [2022-11-25 23:36:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:29,619 INFO L495 AbstractCegarLoop]: Abstraction has 4925 states and 6171 transitions. [2022-11-25 23:36:29,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 23:36:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 6171 transitions. [2022-11-25 23:36:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 23:36:29,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:29,630 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, 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] [2022-11-25 23:36:29,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:36:29,631 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1676400282, now seen corresponding path program 1 times [2022-11-25 23:36:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:29,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872183149] [2022-11-25 23:36:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-25 23:36:29,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:29,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872183149] [2022-11-25 23:36:29,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872183149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:29,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76059170] [2022-11-25 23:36:29,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:29,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:29,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:29,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:29,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:36:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:29,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 23:36:29,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 23:36:30,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-25 23:36:30,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76059170] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:36:30,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1651280081] [2022-11-25 23:36:30,650 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-11-25 23:36:30,650 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:30,655 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:30,668 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:30,668 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:35,324 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 87 for LOIs [2022-11-25 23:36:35,354 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-25 23:36:35,381 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-25 23:36:37,904 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 88 for LOIs [2022-11-25 23:36:37,928 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 74 for LOIs [2022-11-25 23:36:37,935 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 28 for LOIs [2022-11-25 23:36:37,945 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 56 for LOIs [2022-11-25 23:36:38,142 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 53 for LOIs [2022-11-25 23:36:38,676 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:53,096 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '222447#(and (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 2147483648)) (= ~t1_i~0 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_3~0#1| 2147483648)) (= ~t3_st~0 1) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_3~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= ~t1_pc~0 0) (<= |#NULL.offset| 0) (<= ~t2_pc~0 1) (<= ~m_pc~0 1) (<= 1 ~t2_pc~0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (<= ~t2_st~0 2) (<= ~m_i~0 1) (<= 0 |ULTIMATE.start_eval_~tmp_ndt_2~0#1|) (<= |ULTIMATE.start_eval_~tmp_ndt_2~0#1| 0) (<= 0 ~m_pc~0) (<= 2 ~t2_st~0) (<= 0 |#NULL.offset|) (= ~t3_i~0 1) (= ~t3_pc~0 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-25 23:36:53,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:36:53,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:36:53,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 10 [2022-11-25 23:36:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456295519] [2022-11-25 23:36:53,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:36:53,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:36:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:36:53,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3243, Unknown=0, NotChecked=0, Total=3540 [2022-11-25 23:36:53,101 INFO L87 Difference]: Start difference. First operand 4925 states and 6171 transitions. Second operand has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-11-25 23:36:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:54,542 INFO L93 Difference]: Finished difference Result 10807 states and 13830 transitions. [2022-11-25 23:36:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:36:54,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 109 [2022-11-25 23:36:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:54,566 INFO L225 Difference]: With dead ends: 10807 [2022-11-25 23:36:54,566 INFO L226 Difference]: Without dead ends: 6988 [2022-11-25 23:36:54,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 267 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=353, Invalid=3937, Unknown=0, NotChecked=0, Total=4290 [2022-11-25 23:36:54,579 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 457 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:54,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 280 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:36:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6988 states. [2022-11-25 23:36:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6988 to 6827. [2022-11-25 23:36:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6827 states, 5707 states have (on average 1.266164359558437) internal successors, (7226), 5716 states have internal predecessors, (7226), 598 states have call successors, (598), 505 states have call predecessors, (598), 521 states have return successors, (655), 606 states have call predecessors, (655), 598 states have call successors, (655) [2022-11-25 23:36:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6827 states to 6827 states and 8479 transitions. [2022-11-25 23:36:55,425 INFO L78 Accepts]: Start accepts. Automaton has 6827 states and 8479 transitions. Word has length 109 [2022-11-25 23:36:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:55,425 INFO L495 AbstractCegarLoop]: Abstraction has 6827 states and 8479 transitions. [2022-11-25 23:36:55,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-11-25 23:36:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6827 states and 8479 transitions. [2022-11-25 23:36:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 23:36:55,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:55,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-25 23:36:55,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:55,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:36:55,642 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1979526906, now seen corresponding path program 1 times [2022-11-25 23:36:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:55,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328310995] [2022-11-25 23:36:55,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 23:36:55,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:55,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328310995] [2022-11-25 23:36:55,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328310995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:55,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435489099] [2022-11-25 23:36:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:55,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:55,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:55,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:55,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:36:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:55,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:36:55,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:36:55,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:55,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435489099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:55,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:55,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-11-25 23:36:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664208117] [2022-11-25 23:36:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:55,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:55,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:55,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:55,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:36:55,913 INFO L87 Difference]: Start difference. First operand 6827 states and 8479 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 23:36:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:56,778 INFO L93 Difference]: Finished difference Result 13118 states and 16551 transitions. [2022-11-25 23:36:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:56,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 109 [2022-11-25 23:36:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:56,805 INFO L225 Difference]: With dead ends: 13118 [2022-11-25 23:36:56,805 INFO L226 Difference]: Without dead ends: 8312 [2022-11-25 23:36:56,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 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-25 23:36:56,817 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 85 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:56,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 261 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8312 states. [2022-11-25 23:36:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8312 to 8242. [2022-11-25 23:36:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8242 states, 6876 states have (on average 1.2478184991273997) internal successors, (8580), 6887 states have internal predecessors, (8580), 732 states have call successors, (732), 615 states have call predecessors, (732), 633 states have return successors, (847), 740 states have call predecessors, (847), 732 states have call successors, (847) [2022-11-25 23:36:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8242 states to 8242 states and 10159 transitions. [2022-11-25 23:36:57,668 INFO L78 Accepts]: Start accepts. Automaton has 8242 states and 10159 transitions. Word has length 109 [2022-11-25 23:36:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:57,668 INFO L495 AbstractCegarLoop]: Abstraction has 8242 states and 10159 transitions. [2022-11-25 23:36:57,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 23:36:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 8242 states and 10159 transitions. [2022-11-25 23:36:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-25 23:36:57,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:57,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-25 23:36:57,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:57,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:36:57,886 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash -775880118, now seen corresponding path program 1 times [2022-11-25 23:36:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:57,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293678322] [2022-11-25 23:36:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 23:36:58,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:58,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293678322] [2022-11-25 23:36:58,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293678322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:58,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557024214] [2022-11-25 23:36:58,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:58,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:58,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:58,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:36:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:58,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 23:36:58,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:58,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:58,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557024214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:58,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:58,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-25 23:36:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335363887] [2022-11-25 23:36:58,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:58,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:58,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:58,389 INFO L87 Difference]: Start difference. First operand 8242 states and 10159 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 23:36:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:59,686 INFO L93 Difference]: Finished difference Result 13046 states and 16009 transitions. [2022-11-25 23:36:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:36:59,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 111 [2022-11-25 23:36:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:59,711 INFO L225 Difference]: With dead ends: 13046 [2022-11-25 23:36:59,711 INFO L226 Difference]: Without dead ends: 8748 [2022-11-25 23:36:59,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:36:59,721 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 193 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:59,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 332 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:36:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8748 states. [2022-11-25 23:37:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8748 to 8297. [2022-11-25 23:37:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8297 states, 6909 states have (on average 1.2414242292661746) internal successors, (8577), 6922 states have internal predecessors, (8577), 745 states have call successors, (745), 622 states have call predecessors, (745), 642 states have return successors, (865), 753 states have call predecessors, (865), 745 states have call successors, (865) [2022-11-25 23:37:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 10187 transitions. [2022-11-25 23:37:00,683 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 10187 transitions. Word has length 111 [2022-11-25 23:37:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:00,684 INFO L495 AbstractCegarLoop]: Abstraction has 8297 states and 10187 transitions. [2022-11-25 23:37:00,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 23:37:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 10187 transitions. [2022-11-25 23:37:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-25 23:37:00,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:00,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-25 23:37:00,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:00,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:00,899 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:37:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash -499339926, now seen corresponding path program 1 times [2022-11-25 23:37:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:00,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799794957] [2022-11-25 23:37:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 23:37:00,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:00,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799794957] [2022-11-25 23:37:00,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799794957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:00,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:00,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:37:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124302644] [2022-11-25 23:37:00,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:00,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:00,985 INFO L87 Difference]: Start difference. First operand 8297 states and 10187 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 23:37:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:02,010 INFO L93 Difference]: Finished difference Result 17037 states and 21187 transitions. [2022-11-25 23:37:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:02,011 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 111 [2022-11-25 23:37:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:02,044 INFO L225 Difference]: With dead ends: 17037 [2022-11-25 23:37:02,045 INFO L226 Difference]: Without dead ends: 10549 [2022-11-25 23:37:02,058 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-25 23:37:02,059 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 40 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:02,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 233 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10549 states. [2022-11-25 23:37:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10549 to 8824. [2022-11-25 23:37:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8824 states, 7356 states have (on average 1.2600598151169113) internal successors, (9269), 7369 states have internal predecessors, (9269), 785 states have call successors, (785), 662 states have call predecessors, (785), 682 states have return successors, (905), 793 states have call predecessors, (905), 785 states have call successors, (905) [2022-11-25 23:37:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8824 states to 8824 states and 10959 transitions. [2022-11-25 23:37:03,171 INFO L78 Accepts]: Start accepts. Automaton has 8824 states and 10959 transitions. Word has length 111 [2022-11-25 23:37:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:03,172 INFO L495 AbstractCegarLoop]: Abstraction has 8824 states and 10959 transitions. [2022-11-25 23:37:03,172 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 23:37:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 8824 states and 10959 transitions. [2022-11-25 23:37:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-25 23:37:03,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:03,181 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:03,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:37:03,181 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:37:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 425714574, now seen corresponding path program 1 times [2022-11-25 23:37:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469710343] [2022-11-25 23:37:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-25 23:37:03,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:03,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469710343] [2022-11-25 23:37:03,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469710343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:03,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405253932] [2022-11-25 23:37:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:03,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:03,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:03,263 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:03,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:37:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:03,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:37:03,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-25 23:37:03,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:37:03,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405253932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:03,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:37:03,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-11-25 23:37:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406071231] [2022-11-25 23:37:03,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:03,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:37:03,484 INFO L87 Difference]: Start difference. First operand 8824 states and 10959 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 23:37:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:04,399 INFO L93 Difference]: Finished difference Result 16218 states and 20510 transitions. [2022-11-25 23:37:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:04,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 137 [2022-11-25 23:37:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:04,421 INFO L225 Difference]: With dead ends: 16218 [2022-11-25 23:37:04,422 INFO L226 Difference]: Without dead ends: 8806 [2022-11-25 23:37:04,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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-25 23:37:04,437 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 80 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:04,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 249 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8806 states. [2022-11-25 23:37:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8806 to 8712. [2022-11-25 23:37:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 7244 states have (on average 1.223495306460519) internal successors, (8863), 7257 states have internal predecessors, (8863), 785 states have call successors, (785), 662 states have call predecessors, (785), 682 states have return successors, (905), 793 states have call predecessors, (905), 785 states have call successors, (905) [2022-11-25 23:37:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 10553 transitions. [2022-11-25 23:37:05,421 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 10553 transitions. Word has length 137 [2022-11-25 23:37:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:05,421 INFO L495 AbstractCegarLoop]: Abstraction has 8712 states and 10553 transitions. [2022-11-25 23:37:05,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 23:37:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 10553 transitions. [2022-11-25 23:37:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-25 23:37:05,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:05,430 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-25 23:37:05,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:05,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 23:37:05,646 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:37:05,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -594734031, now seen corresponding path program 1 times [2022-11-25 23:37:05,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:05,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94994808] [2022-11-25 23:37:05,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-25 23:37:05,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:05,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94994808] [2022-11-25 23:37:05,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94994808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:05,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872936634] [2022-11-25 23:37:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:05,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:05,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:05,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:05,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:37:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:05,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:37:05,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:37:05,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:37:05,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872936634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:05,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:37:05,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-25 23:37:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640607651] [2022-11-25 23:37:05,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:05,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:05,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:05,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:05,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:37:05,986 INFO L87 Difference]: Start difference. First operand 8712 states and 10553 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 23:37:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:06,880 INFO L93 Difference]: Finished difference Result 15471 states and 19058 transitions. [2022-11-25 23:37:06,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:06,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 137 [2022-11-25 23:37:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:06,901 INFO L225 Difference]: With dead ends: 15471 [2022-11-25 23:37:06,901 INFO L226 Difference]: Without dead ends: 8712 [2022-11-25 23:37:06,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:37:06,913 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 94 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:06,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 123 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8712 states. [2022-11-25 23:37:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8712 to 8712. [2022-11-25 23:37:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 7244 states have (on average 1.2030646051905025) internal successors, (8715), 7257 states have internal predecessors, (8715), 785 states have call successors, (785), 662 states have call predecessors, (785), 682 states have return successors, (905), 793 states have call predecessors, (905), 785 states have call successors, (905) [2022-11-25 23:37:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 10405 transitions. [2022-11-25 23:37:07,752 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 10405 transitions. Word has length 137 [2022-11-25 23:37:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:07,752 INFO L495 AbstractCegarLoop]: Abstraction has 8712 states and 10405 transitions. [2022-11-25 23:37:07,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 23:37:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 10405 transitions. [2022-11-25 23:37:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 23:37:07,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:07,759 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-25 23:37:07,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:07,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:07,966 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:37:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1461594947, now seen corresponding path program 1 times [2022-11-25 23:37:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:07,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93676635] [2022-11-25 23:37:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:37:07,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:37:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:37:08,138 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:37:08,139 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:37:08,140 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 23:37:08,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 23:37:08,146 INFO L445 BasicCegarLoop]: Path program histogram: [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-25 23:37:08,151 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:37:08,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:37:08 BoogieIcfgContainer [2022-11-25 23:37:08,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:37:08,370 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:37:08,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:37:08,371 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:37:08,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:36:04" (3/4) ... [2022-11-25 23:37:08,373 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 23:37:08,529 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:37:08,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:37:08,530 INFO L158 Benchmark]: Toolchain (without parser) took 66243.73ms. Allocated memory was 136.3MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 104.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 263.7MB. Max. memory is 16.1GB. [2022-11-25 23:37:08,536 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory was 66.6MB in the beginning and 66.5MB in the end (delta: 56.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:37:08,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.94ms. Allocated memory is still 136.3MB. Free memory was 104.4MB in the beginning and 89.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 23:37:08,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.37ms. Allocated memory is still 136.3MB. Free memory was 89.8MB in the beginning and 87.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:37:08,537 INFO L158 Benchmark]: Boogie Preprocessor took 95.57ms. Allocated memory is still 136.3MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:37:08,537 INFO L158 Benchmark]: RCFGBuilder took 1129.89ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 85.8MB in the beginning and 130.6MB in the end (delta: -44.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-11-25 23:37:08,538 INFO L158 Benchmark]: TraceAbstraction took 64282.11ms. Allocated memory was 163.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 130.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 244.0MB. Max. memory is 16.1GB. [2022-11-25 23:37:08,538 INFO L158 Benchmark]: Witness Printer took 159.52ms. Allocated memory is still 2.4GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:37:08,540 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.32ms. Allocated memory is still 113.2MB. Free memory was 66.6MB in the beginning and 66.5MB in the end (delta: 56.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.94ms. Allocated memory is still 136.3MB. Free memory was 104.4MB in the beginning and 89.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.37ms. Allocated memory is still 136.3MB. Free memory was 89.8MB in the beginning and 87.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.57ms. Allocated memory is still 136.3MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1129.89ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 85.8MB in the beginning and 130.6MB in the end (delta: -44.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 64282.11ms. Allocated memory was 163.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 130.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 244.0MB. Max. memory is 16.1GB. * Witness Printer took 159.52ms. Allocated memory is still 2.4GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L697] int __retres1 ; [L701] CALL init_model() [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 [L701] RET init_model() [L702] CALL start_simulation() [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L645] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L646] CALL init_threads() [L281] COND TRUE m_i == 1 [L282] m_st = 0 [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 [L646] RET init_threads() [L647] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L418] COND FALSE !(M_E == 0) [L423] COND FALSE !(T1_E == 0) [L428] COND FALSE !(T2_E == 0) [L433] COND FALSE !(T3_E == 0) [L438] COND FALSE !(E_1 == 0) [L443] COND FALSE !(E_2 == 0) [L448] COND FALSE !(E_3 == 0) [L647] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L648] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L648] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L649] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L461] COND FALSE !(M_E == 1) [L466] COND FALSE !(T1_E == 1) [L471] COND FALSE !(T2_E == 1) [L476] COND FALSE !(T3_E == 1) [L481] COND FALSE !(E_1 == 1) [L486] COND FALSE !(E_2 == 1) [L491] COND FALSE !(E_3 == 1) [L649] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L652] COND TRUE 1 [L655] kernel_st = 1 [L656] CALL eval() [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 [L177] t3_pc = 1 [L178] t3_st = 2 [L399] RET transmit3() [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp_ndt_1) [L356] m_st = 1 [L357] CALL master() [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 [L67] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L548] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] RET master() [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 [L113] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 [L148] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L149] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L149] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 [L183] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.0s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4022 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3952 mSDsluCounter, 6744 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3632 mSDsCounter, 831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3170 IncrementalHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 831 mSolverCounterUnsat, 3112 mSDtfsCounter, 3170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 1219 SyntacticMatches, 7 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8824occurred in iteration=20, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 7607 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2909 NumberOfCodeBlocks, 2909 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2955 ConstructedInterpolants, 0 QuantifiedInterpolants, 5418 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4210 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 1399/1522 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 23:37:08,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb577b9f-2d05-40c2-ab40-32b9afc4b655/bin/utaipan-ByfvJB40ur/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