./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 04:03:38,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:03:38,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:03:38,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:03:38,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:03:38,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:03:38,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:03:38,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:03:38,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:03:38,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:03:38,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:03:38,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:03:38,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:03:38,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:03:38,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:03:38,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:03:38,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:03:38,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:03:38,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:03:38,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:03:38,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:03:38,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:03:38,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:03:38,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:03:38,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:03:38,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:03:38,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:03:38,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:03:38,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:03:38,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:03:38,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:03:38,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:03:38,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:03:38,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:03:38,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:03:38,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:03:38,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:03:38,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:03:38,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:03:38,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:03:38,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:03:38,360 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 04:03:38,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:03:38,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:03:38,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:03:38,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:03:38,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:03:38,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:03:38,410 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:03:38,410 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:03:38,411 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:03:38,411 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:03:38,412 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:03:38,412 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:03:38,413 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:03:38,413 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:03:38,413 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:03:38,414 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:03:38,414 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:03:38,414 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:03:38,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:03:38,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:03:38,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:03:38,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:03:38,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:03:38,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:03:38,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:03:38,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:03:38,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:03:38,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:03:38,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:03:38,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:03:38,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:03:38,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:03:38,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:03:38,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:03:38,420 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:03:38,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:03:38,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:03:38,420 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:03:38,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:03:38,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:03:38,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:03:38,421 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_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b [2022-11-03 04:03:38,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:03:38,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:03:38,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:03:38,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:03:38,818 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:03:38,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-03 04:03:38,906 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/data/e17a5332f/aadc62beb28e4982ad7aa2458ad3eef5/FLAGe2c74d5b7 [2022-11-03 04:03:39,555 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:03:39,555 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-03 04:03:39,576 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/data/e17a5332f/aadc62beb28e4982ad7aa2458ad3eef5/FLAGe2c74d5b7 [2022-11-03 04:03:39,907 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/data/e17a5332f/aadc62beb28e4982ad7aa2458ad3eef5 [2022-11-03 04:03:39,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:03:39,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:03:39,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:03:39,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:03:39,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:03:39,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:03:39" (1/1) ... [2022-11-03 04:03:39,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f972be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:39, skipping insertion in model container [2022-11-03 04:03:39,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:03:39" (1/1) ... [2022-11-03 04:03:39,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:03:39,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:03:40,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-11-03 04:03:40,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-11-03 04:03:40,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:03:40,304 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:03:40,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-11-03 04:03:40,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-11-03 04:03:40,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:03:40,383 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:03:40,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40 WrapperNode [2022-11-03 04:03:40,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:03:40,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:03:40,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:03:40,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:03:40,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,463 INFO L138 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 422 [2022-11-03 04:03:40,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:03:40,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:03:40,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:03:40,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:03:40,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,497 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:03:40,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:03:40,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:03:40,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:03:40,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (1/1) ... [2022-11-03 04:03:40,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:03:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:40,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:03:40,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:03:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:03:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 04:03:40,620 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 04:03:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-11-03 04:03:40,621 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-11-03 04:03:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-03 04:03:40,621 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-03 04:03:40,621 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-03 04:03:40,621 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-03 04:03:40,622 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-03 04:03:40,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-03 04:03:40,622 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-03 04:03:40,622 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-03 04:03:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-03 04:03:40,623 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-03 04:03:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:03:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-03 04:03:40,623 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-03 04:03:40,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:03:40,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:03:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-03 04:03:40,624 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-03 04:03:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-11-03 04:03:40,625 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-11-03 04:03:40,752 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:03:40,755 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:03:41,523 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:03:41,713 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:03:41,715 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-03 04:03:41,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:03:41 BoogieIcfgContainer [2022-11-03 04:03:41,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:03:41,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:03:41,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:03:41,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:03:41,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:03:39" (1/3) ... [2022-11-03 04:03:41,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b36cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:03:41, skipping insertion in model container [2022-11-03 04:03:41,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:03:40" (2/3) ... [2022-11-03 04:03:41,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b36cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:03:41, skipping insertion in model container [2022-11-03 04:03:41,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:03:41" (3/3) ... [2022-11-03 04:03:41,734 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-03 04:03:41,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:03:41,759 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 04:03:41,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:03:41,872 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;@18413f1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:03:41,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 04:03:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 95 states have internal predecessors, (135), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-03 04:03:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 04:03:41,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:41,900 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] [2022-11-03 04:03:41,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2115007351, now seen corresponding path program 1 times [2022-11-03 04:03:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:41,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682042926] [2022-11-03 04:03:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:41,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:42,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:42,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682042926] [2022-11-03 04:03:42,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682042926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:42,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:42,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:03:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281068313] [2022-11-03 04:03:42,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:42,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:03:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:03:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:42,464 INFO L87 Difference]: Start difference. First operand has 124 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 95 states have internal predecessors, (135), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:03:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:42,717 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-11-03 04:03:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:03:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-03 04:03:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:42,736 INFO L225 Difference]: With dead ends: 280 [2022-11-03 04:03:42,736 INFO L226 Difference]: Without dead ends: 156 [2022-11-03 04:03:42,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:42,744 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 146 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:42,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 210 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:03:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-03 04:03:42,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-11-03 04:03:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 118 states have internal predecessors, (162), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-03 04:03:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 210 transitions. [2022-11-03 04:03:42,817 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 210 transitions. Word has length 28 [2022-11-03 04:03:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:42,818 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 210 transitions. [2022-11-03 04:03:42,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:03:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 210 transitions. [2022-11-03 04:03:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 04:03:42,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:42,823 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] [2022-11-03 04:03:42,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:03:42,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash -346560277, now seen corresponding path program 1 times [2022-11-03 04:03:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:42,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889353310] [2022-11-03 04:03:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:42,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:42,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889353310] [2022-11-03 04:03:42,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889353310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:42,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:42,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:03:42,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252805411] [2022-11-03 04:03:42,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:42,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:03:42,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:42,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:03:42,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:42,937 INFO L87 Difference]: Start difference. First operand 152 states and 210 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:03:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:43,081 INFO L93 Difference]: Finished difference Result 308 states and 427 transitions. [2022-11-03 04:03:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:03:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-11-03 04:03:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:43,085 INFO L225 Difference]: With dead ends: 308 [2022-11-03 04:03:43,086 INFO L226 Difference]: Without dead ends: 227 [2022-11-03 04:03:43,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:43,089 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 144 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:43,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 195 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:03:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-03 04:03:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2022-11-03 04:03:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 174 states have (on average 1.396551724137931) internal successors, (243), 178 states have internal predecessors, (243), 33 states have call successors, (33), 16 states have call predecessors, (33), 14 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-03 04:03:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 305 transitions. [2022-11-03 04:03:43,129 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 305 transitions. Word has length 29 [2022-11-03 04:03:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:43,130 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 305 transitions. [2022-11-03 04:03:43,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:03:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 305 transitions. [2022-11-03 04:03:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:03:43,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:43,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:43,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:03:43,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1395719567, now seen corresponding path program 1 times [2022-11-03 04:03:43,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:43,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527699553] [2022-11-03 04:03:43,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:43,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:43,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527699553] [2022-11-03 04:03:43,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527699553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:43,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:43,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:03:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369203034] [2022-11-03 04:03:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:43,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:03:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:43,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:03:43,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:43,202 INFO L87 Difference]: Start difference. First operand 223 states and 305 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:03:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:43,331 INFO L93 Difference]: Finished difference Result 463 states and 633 transitions. [2022-11-03 04:03:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:03:43,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-03 04:03:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:43,336 INFO L225 Difference]: With dead ends: 463 [2022-11-03 04:03:43,336 INFO L226 Difference]: Without dead ends: 311 [2022-11-03 04:03:43,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:43,339 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:43,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 275 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:03:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-03 04:03:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 297. [2022-11-03 04:03:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 237 states have (on average 1.3839662447257384) internal successors, (328), 243 states have internal predecessors, (328), 39 states have call successors, (39), 21 states have call predecessors, (39), 19 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 04:03:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 402 transitions. [2022-11-03 04:03:43,378 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 402 transitions. Word has length 30 [2022-11-03 04:03:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:43,379 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 402 transitions. [2022-11-03 04:03:43,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:03:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 402 transitions. [2022-11-03 04:03:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:03:43,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:43,385 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] [2022-11-03 04:03:43,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 04:03:43,385 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:43,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1885094258, now seen corresponding path program 1 times [2022-11-03 04:03:43,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:43,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25959598] [2022-11-03 04:03:43,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:43,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:43,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25959598] [2022-11-03 04:03:43,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25959598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:43,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:43,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:03:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482059911] [2022-11-03 04:03:43,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:43,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:03:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:03:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:03:43,487 INFO L87 Difference]: Start difference. First operand 297 states and 402 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 04:03:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:43,727 INFO L93 Difference]: Finished difference Result 415 states and 571 transitions. [2022-11-03 04:03:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:03:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2022-11-03 04:03:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:43,734 INFO L225 Difference]: With dead ends: 415 [2022-11-03 04:03:43,735 INFO L226 Difference]: Without dead ends: 350 [2022-11-03 04:03:43,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:03:43,749 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 215 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:43,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 310 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:03:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-03 04:03:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2022-11-03 04:03:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 272 states have (on average 1.3602941176470589) internal successors, (370), 279 states have internal predecessors, (370), 50 states have call successors, (50), 27 states have call predecessors, (50), 25 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 04:03:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 466 transitions. [2022-11-03 04:03:43,814 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 466 transitions. Word has length 35 [2022-11-03 04:03:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:43,815 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 466 transitions. [2022-11-03 04:03:43,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 04:03:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 466 transitions. [2022-11-03 04:03:43,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 04:03:43,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:43,823 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 04:03:43,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 04:03:43,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:43,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1693445601, now seen corresponding path program 1 times [2022-11-03 04:03:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:43,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387583820] [2022-11-03 04:03:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:03:43,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:43,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387583820] [2022-11-03 04:03:43,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387583820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:43,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:43,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:03:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658941654] [2022-11-03 04:03:43,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:43,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:03:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:43,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:03:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:43,986 INFO L87 Difference]: Start difference. First operand 349 states and 466 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:03:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:44,104 INFO L93 Difference]: Finished difference Result 512 states and 684 transitions. [2022-11-03 04:03:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:03:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2022-11-03 04:03:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:44,109 INFO L225 Difference]: With dead ends: 512 [2022-11-03 04:03:44,109 INFO L226 Difference]: Without dead ends: 354 [2022-11-03 04:03:44,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:44,117 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 32 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 305 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-03 04:03:44,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 305 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:03:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-03 04:03:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 343. [2022-11-03 04:03:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 266 states have (on average 1.3383458646616542) internal successors, (356), 273 states have internal predecessors, (356), 50 states have call successors, (50), 27 states have call predecessors, (50), 25 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 04:03:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 452 transitions. [2022-11-03 04:03:44,170 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 452 transitions. Word has length 43 [2022-11-03 04:03:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:44,171 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 452 transitions. [2022-11-03 04:03:44,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:03:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 452 transitions. [2022-11-03 04:03:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 04:03:44,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:44,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:44,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 04:03:44,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash 92348433, now seen corresponding path program 1 times [2022-11-03 04:03:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:44,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342592952] [2022-11-03 04:03:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 04:03:44,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:44,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342592952] [2022-11-03 04:03:44,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342592952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:44,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:44,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:03:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203068877] [2022-11-03 04:03:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:44,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:03:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:03:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:44,266 INFO L87 Difference]: Start difference. First operand 343 states and 452 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:03:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:44,349 INFO L93 Difference]: Finished difference Result 592 states and 776 transitions. [2022-11-03 04:03:44,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:03:44,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-11-03 04:03:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:44,353 INFO L225 Difference]: With dead ends: 592 [2022-11-03 04:03:44,353 INFO L226 Difference]: Without dead ends: 389 [2022-11-03 04:03:44,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:44,355 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 129 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:44,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 192 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:03:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-03 04:03:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2022-11-03 04:03:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 305 states have (on average 1.3081967213114754) internal successors, (399), 312 states have internal predecessors, (399), 54 states have call successors, (54), 30 states have call predecessors, (54), 28 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-03 04:03:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 503 transitions. [2022-11-03 04:03:44,416 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 503 transitions. Word has length 46 [2022-11-03 04:03:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:44,416 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 503 transitions. [2022-11-03 04:03:44,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:03:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 503 transitions. [2022-11-03 04:03:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 04:03:44,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:44,422 INFO L195 NwaCegarLoop]: trace histogram [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-03 04:03:44,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 04:03:44,422 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1767974607, now seen corresponding path program 1 times [2022-11-03 04:03:44,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:44,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116700446] [2022-11-03 04:03:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:44,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 04:03:44,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:44,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116700446] [2022-11-03 04:03:44,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116700446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:44,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:44,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:03:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653146128] [2022-11-03 04:03:44,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:44,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:03:44,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:44,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:03:44,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:03:44,578 INFO L87 Difference]: Start difference. First operand 389 states and 503 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:03:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:44,824 INFO L93 Difference]: Finished difference Result 429 states and 550 transitions. [2022-11-03 04:03:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:03:44,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-11-03 04:03:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:44,828 INFO L225 Difference]: With dead ends: 429 [2022-11-03 04:03:44,828 INFO L226 Difference]: Without dead ends: 426 [2022-11-03 04:03:44,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:03:44,830 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 242 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:44,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 190 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:03:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-03 04:03:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 388. [2022-11-03 04:03:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 305 states have (on average 1.301639344262295) internal successors, (397), 311 states have internal predecessors, (397), 53 states have call successors, (53), 30 states have call predecessors, (53), 28 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-03 04:03:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 500 transitions. [2022-11-03 04:03:44,879 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 500 transitions. Word has length 47 [2022-11-03 04:03:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:44,881 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 500 transitions. [2022-11-03 04:03:44,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:03:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 500 transitions. [2022-11-03 04:03:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 04:03:44,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:44,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:44,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 04:03:44,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1026748244, now seen corresponding path program 1 times [2022-11-03 04:03:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:44,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023576462] [2022-11-03 04:03:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 04:03:45,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023576462] [2022-11-03 04:03:45,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023576462] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:45,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673829224] [2022-11-03 04:03:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:45,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:45,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:45,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:45,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 04:03:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:45,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:03:45,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:45,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 04:03:45,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673829224] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:45,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1279556278] [2022-11-03 04:03:45,798 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2022-11-03 04:03:45,799 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:03:45,803 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:03:45,809 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:03:45,809 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:03:47,848 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 75 for LOIs [2022-11-03 04:03:47,857 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 90 for LOIs [2022-11-03 04:03:47,870 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 196 for LOIs [2022-11-03 04:03:48,988 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:04:00,307 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7941#(and (= ~t1_pc~0 0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~p_last_write~0 2147483647) (= ~E_M~0 2) (= ~a_t~0 0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-11-03 04:04:00,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:04:00,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:04:00,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-11-03 04:04:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224761085] [2022-11-03 04:04:00,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:04:00,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:04:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:04:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 04:04:00,311 INFO L87 Difference]: Start difference. First operand 388 states and 500 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 04:04:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:00,697 INFO L93 Difference]: Finished difference Result 831 states and 1068 transitions. [2022-11-03 04:04:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:04:00,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-11-03 04:04:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:00,707 INFO L225 Difference]: With dead ends: 831 [2022-11-03 04:04:00,707 INFO L226 Difference]: Without dead ends: 828 [2022-11-03 04:04:00,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 04:04:00,709 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 390 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:00,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 541 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:04:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-03 04:04:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 597. [2022-11-03 04:04:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 482 states have (on average 1.3070539419087137) internal successors, (630), 490 states have internal predecessors, (630), 72 states have call successors, (72), 43 states have call predecessors, (72), 41 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-11-03 04:04:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 771 transitions. [2022-11-03 04:04:00,783 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 771 transitions. Word has length 48 [2022-11-03 04:04:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:00,783 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 771 transitions. [2022-11-03 04:04:00,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 04:04:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 771 transitions. [2022-11-03 04:04:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 04:04:00,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:00,786 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 04:04:00,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 04:04:01,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:01,001 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1361579102, now seen corresponding path program 1 times [2022-11-03 04:04:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:01,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491568545] [2022-11-03 04:04:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:04:01,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:01,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491568545] [2022-11-03 04:04:01,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491568545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:01,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:01,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 04:04:01,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231470889] [2022-11-03 04:04:01,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:01,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:04:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:01,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:04:01,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:04:01,288 INFO L87 Difference]: Start difference. First operand 597 states and 771 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 04:04:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:01,683 INFO L93 Difference]: Finished difference Result 829 states and 1074 transitions. [2022-11-03 04:04:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:04:01,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 60 [2022-11-03 04:04:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:01,688 INFO L225 Difference]: With dead ends: 829 [2022-11-03 04:04:01,688 INFO L226 Difference]: Without dead ends: 713 [2022-11-03 04:04:01,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:04:01,690 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 249 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 340 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-03 04:04:01,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 340 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:04:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-03 04:04:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 697. [2022-11-03 04:04:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 550 states have (on average 1.3) internal successors, (715), 559 states have internal predecessors, (715), 92 states have call successors, (92), 55 states have call predecessors, (92), 53 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-11-03 04:04:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 896 transitions. [2022-11-03 04:04:01,765 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 896 transitions. Word has length 60 [2022-11-03 04:04:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:01,765 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 896 transitions. [2022-11-03 04:04:01,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 04:04:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 896 transitions. [2022-11-03 04:04:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-03 04:04:01,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:01,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:01,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 04:04:01,769 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:01,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1328661265, now seen corresponding path program 1 times [2022-11-03 04:04:01,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:01,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803227983] [2022-11-03 04:04:01,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:04:01,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:01,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803227983] [2022-11-03 04:04:01,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803227983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:01,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:01,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:04:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675737169] [2022-11-03 04:04:01,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:01,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:01,844 INFO L87 Difference]: Start difference. First operand 697 states and 896 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 04:04:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:01,973 INFO L93 Difference]: Finished difference Result 865 states and 1112 transitions. [2022-11-03 04:04:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:01,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-11-03 04:04:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:01,979 INFO L225 Difference]: With dead ends: 865 [2022-11-03 04:04:01,981 INFO L226 Difference]: Without dead ends: 747 [2022-11-03 04:04:01,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:01,983 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 27 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 300 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-03 04:04:01,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 300 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:04:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-11-03 04:04:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 717. [2022-11-03 04:04:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 566 states have (on average 1.302120141342756) internal successors, (737), 575 states have internal predecessors, (737), 94 states have call successors, (94), 57 states have call predecessors, (94), 55 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2022-11-03 04:04:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 922 transitions. [2022-11-03 04:04:02,070 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 922 transitions. Word has length 61 [2022-11-03 04:04:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:02,070 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 922 transitions. [2022-11-03 04:04:02,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 04:04:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 922 transitions. [2022-11-03 04:04:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-03 04:04:02,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:02,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:02,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 04:04:02,074 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash 563028075, now seen corresponding path program 2 times [2022-11-03 04:04:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:02,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709393488] [2022-11-03 04:04:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 04:04:02,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:02,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709393488] [2022-11-03 04:04:02,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709393488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:02,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:02,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:04:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97711088] [2022-11-03 04:04:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:02,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:02,115 INFO L87 Difference]: Start difference. First operand 717 states and 922 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 04:04:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:02,226 INFO L93 Difference]: Finished difference Result 1047 states and 1355 transitions. [2022-11-03 04:04:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:02,227 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), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2022-11-03 04:04:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:02,230 INFO L225 Difference]: With dead ends: 1047 [2022-11-03 04:04:02,230 INFO L226 Difference]: Without dead ends: 659 [2022-11-03 04:04:02,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:02,232 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 142 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:02,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 205 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:04:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-11-03 04:04:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 650. [2022-11-03 04:04:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 509 states have (on average 1.2888015717092338) internal successors, (656), 519 states have internal predecessors, (656), 88 states have call successors, (88), 53 states have call predecessors, (88), 51 states have return successors, (85), 78 states have call predecessors, (85), 85 states have call successors, (85) [2022-11-03 04:04:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 829 transitions. [2022-11-03 04:04:02,301 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 829 transitions. Word has length 61 [2022-11-03 04:04:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:02,301 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 829 transitions. [2022-11-03 04:04:02,302 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), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 04:04:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 829 transitions. [2022-11-03 04:04:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-03 04:04:02,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:02,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:02,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 04:04:02,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash 469272451, now seen corresponding path program 1 times [2022-11-03 04:04:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:02,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851487675] [2022-11-03 04:04:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 04:04:02,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:02,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851487675] [2022-11-03 04:04:02,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851487675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:02,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:02,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:04:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137426129] [2022-11-03 04:04:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:02,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:02,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:02,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:02,354 INFO L87 Difference]: Start difference. First operand 650 states and 829 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 04:04:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:02,484 INFO L93 Difference]: Finished difference Result 1006 states and 1289 transitions. [2022-11-03 04:04:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:02,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2022-11-03 04:04:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:02,489 INFO L225 Difference]: With dead ends: 1006 [2022-11-03 04:04:02,489 INFO L226 Difference]: Without dead ends: 769 [2022-11-03 04:04:02,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:02,491 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 128 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 241 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-03 04:04:02,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 241 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:04:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-11-03 04:04:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 762. [2022-11-03 04:04:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 587 states have (on average 1.2793867120954003) internal successors, (751), 598 states have internal predecessors, (751), 109 states have call successors, (109), 66 states have call predecessors, (109), 64 states have return successors, (106), 98 states have call predecessors, (106), 106 states have call successors, (106) [2022-11-03 04:04:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 966 transitions. [2022-11-03 04:04:02,586 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 966 transitions. Word has length 77 [2022-11-03 04:04:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:02,587 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 966 transitions. [2022-11-03 04:04:02,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 04:04:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 966 transitions. [2022-11-03 04:04:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-03 04:04:02,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:02,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:02,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 04:04:02,590 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1714106864, now seen corresponding path program 1 times [2022-11-03 04:04:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:02,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410305664] [2022-11-03 04:04:02,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 04:04:02,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:02,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410305664] [2022-11-03 04:04:02,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410305664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:02,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:02,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:04:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677461458] [2022-11-03 04:04:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:02,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:02,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:02,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:02,641 INFO L87 Difference]: Start difference. First operand 762 states and 966 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 04:04:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:02,754 INFO L93 Difference]: Finished difference Result 889 states and 1125 transitions. [2022-11-03 04:04:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:02,755 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2022-11-03 04:04:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:02,758 INFO L225 Difference]: With dead ends: 889 [2022-11-03 04:04:02,758 INFO L226 Difference]: Without dead ends: 355 [2022-11-03 04:04:02,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:02,760 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 27 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 276 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.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:02,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 276 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:04:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-03 04:04:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-11-03 04:04:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 244 states have (on average 1.2663934426229508) internal successors, (309), 249 states have internal predecessors, (309), 71 states have call successors, (71), 40 states have call predecessors, (71), 39 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2022-11-03 04:04:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 449 transitions. [2022-11-03 04:04:02,801 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 449 transitions. Word has length 73 [2022-11-03 04:04:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:02,802 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 449 transitions. [2022-11-03 04:04:02,802 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 04:04:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 449 transitions. [2022-11-03 04:04:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 04:04:02,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:02,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:02,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 04:04:02,805 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:02,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1810930104, now seen corresponding path program 1 times [2022-11-03 04:04:02,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:02,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499497164] [2022-11-03 04:04:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 04:04:02,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:02,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499497164] [2022-11-03 04:04:02,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499497164] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:02,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216185671] [2022-11-03 04:04:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:02,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:03,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 04:04:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:03,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 04:04:03,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 04:04:03,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:04:03,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216185671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:03,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:04:03,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 04:04:03,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122269450] [2022-11-03 04:04:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:03,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:03,198 INFO L87 Difference]: Start difference. First operand 355 states and 449 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 04:04:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:03,292 INFO L93 Difference]: Finished difference Result 597 states and 773 transitions. [2022-11-03 04:04:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:03,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 88 [2022-11-03 04:04:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:03,295 INFO L225 Difference]: With dead ends: 597 [2022-11-03 04:04:03,295 INFO L226 Difference]: Without dead ends: 361 [2022-11-03 04:04:03,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:03,297 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:03,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 178 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:04:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-03 04:04:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 353. [2022-11-03 04:04:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 242 states have (on average 1.2272727272727273) internal successors, (297), 247 states have internal predecessors, (297), 71 states have call successors, (71), 40 states have call predecessors, (71), 39 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2022-11-03 04:04:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 437 transitions. [2022-11-03 04:04:03,339 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 437 transitions. Word has length 88 [2022-11-03 04:04:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:03,340 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 437 transitions. [2022-11-03 04:04:03,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 04:04:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 437 transitions. [2022-11-03 04:04:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 04:04:03,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:03,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:03,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:03,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 04:04:03,558 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash 119487238, now seen corresponding path program 1 times [2022-11-03 04:04:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:03,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172793573] [2022-11-03 04:04:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 04:04:03,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:03,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172793573] [2022-11-03 04:04:03,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172793573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:03,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464895460] [2022-11-03 04:04:03,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:03,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:03,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:03,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:03,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 04:04:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:03,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 04:04:03,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 04:04:03,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:04:03,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464895460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:03,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:04:03,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 04:04:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20245244] [2022-11-03 04:04:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:03,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:03,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:03,933 INFO L87 Difference]: Start difference. First operand 353 states and 437 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 04:04:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:04,010 INFO L93 Difference]: Finished difference Result 647 states and 799 transitions. [2022-11-03 04:04:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:04,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2022-11-03 04:04:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:04,014 INFO L225 Difference]: With dead ends: 647 [2022-11-03 04:04:04,014 INFO L226 Difference]: Without dead ends: 414 [2022-11-03 04:04:04,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:04,018 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 74 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:04,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 97 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:04:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-11-03 04:04:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-11-03 04:04:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 293 states have (on average 1.1979522184300342) internal successors, (351), 298 states have internal predecessors, (351), 73 states have call successors, (73), 48 states have call predecessors, (73), 47 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2022-11-03 04:04:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 495 transitions. [2022-11-03 04:04:04,088 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 495 transitions. Word has length 88 [2022-11-03 04:04:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:04,088 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 495 transitions. [2022-11-03 04:04:04,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 04:04:04,089 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 495 transitions. [2022-11-03 04:04:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-03 04:04:04,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:04,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:04,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:04,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 04:04:04,306 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash 132674569, now seen corresponding path program 1 times [2022-11-03 04:04:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:04,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800775362] [2022-11-03 04:04:04,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 04:04:04,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:04,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800775362] [2022-11-03 04:04:04,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800775362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:04,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464788194] [2022-11-03 04:04:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:04,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:04,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:04,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:04,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 04:04:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:04,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 04:04:04,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 04:04:04,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:04:04,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464788194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:04,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:04:04,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 04:04:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559293570] [2022-11-03 04:04:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:04,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:04,678 INFO L87 Difference]: Start difference. First operand 414 states and 495 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 04:04:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:04,794 INFO L93 Difference]: Finished difference Result 966 states and 1155 transitions. [2022-11-03 04:04:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2022-11-03 04:04:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:04,798 INFO L225 Difference]: With dead ends: 966 [2022-11-03 04:04:04,798 INFO L226 Difference]: Without dead ends: 559 [2022-11-03 04:04:04,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:04,800 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:04,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 159 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:04:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-11-03 04:04:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 450. [2022-11-03 04:04:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 319 states have (on average 1.2006269592476488) internal successors, (383), 325 states have internal predecessors, (383), 78 states have call successors, (78), 53 states have call predecessors, (78), 52 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2022-11-03 04:04:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 537 transitions. [2022-11-03 04:04:04,865 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 537 transitions. Word has length 89 [2022-11-03 04:04:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:04,866 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 537 transitions. [2022-11-03 04:04:04,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 04:04:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 537 transitions. [2022-11-03 04:04:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-03 04:04:04,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:04,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:04,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:05,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:05,084 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:05,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1476981626, now seen corresponding path program 1 times [2022-11-03 04:04:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:05,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839417316] [2022-11-03 04:04:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 04:04:05,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:05,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839417316] [2022-11-03 04:04:05,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839417316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:05,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989307593] [2022-11-03 04:04:05,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:05,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:05,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:05,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:05,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 04:04:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:05,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 04:04:05,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 04:04:05,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:04:05,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989307593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:05,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:04:05,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 04:04:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585238017] [2022-11-03 04:04:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:05,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:05,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:05,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:05,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:04:05,380 INFO L87 Difference]: Start difference. First operand 450 states and 537 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 04:04:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:05,527 INFO L93 Difference]: Finished difference Result 847 states and 1016 transitions. [2022-11-03 04:04:05,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:05,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2022-11-03 04:04:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:05,531 INFO L225 Difference]: With dead ends: 847 [2022-11-03 04:04:05,531 INFO L226 Difference]: Without dead ends: 553 [2022-11-03 04:04:05,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:04:05,533 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:05,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 188 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:04:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-11-03 04:04:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 484. [2022-11-03 04:04:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 345 states have (on average 1.208695652173913) internal successors, (417), 351 states have internal predecessors, (417), 82 states have call successors, (82), 57 states have call predecessors, (82), 56 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-03 04:04:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 579 transitions. [2022-11-03 04:04:05,600 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 579 transitions. Word has length 89 [2022-11-03 04:04:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:05,601 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 579 transitions. [2022-11-03 04:04:05,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 04:04:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 579 transitions. [2022-11-03 04:04:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-03 04:04:05,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:05,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:05,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:05,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 04:04:05,818 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:05,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1931370246, now seen corresponding path program 1 times [2022-11-03 04:04:05,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:05,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023085636] [2022-11-03 04:04:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:05,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 04:04:05,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:05,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023085636] [2022-11-03 04:04:05,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023085636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:05,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:05,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:04:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292665541] [2022-11-03 04:04:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:05,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:04:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:04:05,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:04:05,946 INFO L87 Difference]: Start difference. First operand 484 states and 579 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 04:04:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:06,242 INFO L93 Difference]: Finished difference Result 1228 states and 1477 transitions. [2022-11-03 04:04:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:04:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 90 [2022-11-03 04:04:06,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:06,248 INFO L225 Difference]: With dead ends: 1228 [2022-11-03 04:04:06,248 INFO L226 Difference]: Without dead ends: 978 [2022-11-03 04:04:06,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:04:06,249 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 137 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:06,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 243 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:04:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-11-03 04:04:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 782. [2022-11-03 04:04:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 557 states have (on average 1.2118491921005385) internal successors, (675), 562 states have internal predecessors, (675), 133 states have call successors, (133), 92 states have call predecessors, (133), 91 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-11-03 04:04:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 939 transitions. [2022-11-03 04:04:06,363 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 939 transitions. Word has length 90 [2022-11-03 04:04:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:06,363 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 939 transitions. [2022-11-03 04:04:06,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 04:04:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 939 transitions. [2022-11-03 04:04:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-03 04:04:06,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:06,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:06,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 04:04:06,366 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash -784450633, now seen corresponding path program 1 times [2022-11-03 04:04:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:06,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695965949] [2022-11-03 04:04:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 04:04:06,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 04:04:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 04:04:06,444 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 04:04:06,444 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 04:04:06,445 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 04:04:06,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 04:04:06,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 04:04:06,451 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:06,456 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 04:04:06,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:04:06 BoogieIcfgContainer [2022-11-03 04:04:06,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 04:04:06,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 04:04:06,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 04:04:06,613 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 04:04:06,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:03:41" (3/4) ... [2022-11-03 04:04:06,615 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 04:04:06,733 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 04:04:06,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 04:04:06,734 INFO L158 Benchmark]: Toolchain (without parser) took 26823.06ms. Allocated memory was 94.4MB in the beginning and 362.8MB in the end (delta: 268.4MB). Free memory was 59.6MB in the beginning and 215.4MB in the end (delta: -155.8MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. [2022-11-03 04:04:06,735 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 94.4MB. Free memory was 76.2MB in the beginning and 76.1MB in the end (delta: 121.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:04:06,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.32ms. Allocated memory is still 94.4MB. Free memory was 59.4MB in the beginning and 66.5MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 04:04:06,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.19ms. Allocated memory is still 94.4MB. Free memory was 66.5MB in the beginning and 63.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 04:04:06,737 INFO L158 Benchmark]: Boogie Preprocessor took 40.46ms. Allocated memory is still 94.4MB. Free memory was 63.9MB in the beginning and 61.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:04:06,738 INFO L158 Benchmark]: RCFGBuilder took 1214.82ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 61.4MB in the beginning and 87.0MB in the end (delta: -25.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-11-03 04:04:06,739 INFO L158 Benchmark]: TraceAbstraction took 24886.98ms. Allocated memory was 132.1MB in the beginning and 362.8MB in the end (delta: 230.7MB). Free memory was 86.5MB in the beginning and 226.9MB in the end (delta: -140.5MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. [2022-11-03 04:04:06,739 INFO L158 Benchmark]: Witness Printer took 120.57ms. Allocated memory is still 362.8MB. Free memory was 226.9MB in the beginning and 215.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 04:04:06,744 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.33ms. Allocated memory is still 94.4MB. Free memory was 76.2MB in the beginning and 76.1MB in the end (delta: 121.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.32ms. Allocated memory is still 94.4MB. Free memory was 59.4MB in the beginning and 66.5MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.19ms. Allocated memory is still 94.4MB. Free memory was 66.5MB in the beginning and 63.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.46ms. Allocated memory is still 94.4MB. Free memory was 63.9MB in the beginning and 61.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1214.82ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 61.4MB in the beginning and 87.0MB in the end (delta: -25.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24886.98ms. Allocated memory was 132.1MB in the beginning and 362.8MB in the end (delta: 230.7MB). Free memory was 86.5MB in the beginning and 226.9MB in the end (delta: -140.5MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. * Witness Printer took 120.57ms. Allocated memory is still 362.8MB. Free memory was 226.9MB in the beginning and 215.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] int local ; [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 [L804] RET init_threads2() [L805] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] COND FALSE !(M_E == 0) [L646] COND FALSE !(T1_E == 0) [L651] COND FALSE !(E_M == 0) [L656] COND FALSE !(E_1 == 0) [L805] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) [L806] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] COND FALSE !(M_E == 1) [L674] COND FALSE !(T1_E == 1) [L679] COND FALSE !(E_M == 1) [L684] COND FALSE !(E_1 == 1) [L807] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] COND TRUE 1 [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] int __retres1 ; [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 [L483] t1_pc = 1 [L484] t1_st = 2 [L622] RET transmit1() [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] int __retres1 ; [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] COND TRUE 1 [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L431] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 [L723] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET master() [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 [L489] token += 1 [L490] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) [L723] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 [L483] t1_pc = 1 [L484] t1_st = 2 [L622] RET transmit1() [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] int __retres1 ; [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 1) [L444] COND TRUE tmp_var <= 5 [L445] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L453] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 124 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2287 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2274 mSDsluCounter, 4445 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2105 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1276 IncrementalHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 2636 mSDtfsCounter, 1276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 506 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=782occurred in iteration=18, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 747 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1577 NumberOfCodeBlocks, 1577 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1508 ConstructedInterpolants, 0 QuantifiedInterpolants, 2938 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1813 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 24 InterpolantComputations, 17 PerfectInterpolantSequences, 603/659 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-03 04:04:06,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19682747-6969-4a18-bb9d-4f7baafbb494/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE