./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS --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 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 --- 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-8393723 [2022-11-19 07:37:52,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:37:52,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:37:52,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:37:52,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:37:52,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:37:52,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:37:52,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:37:52,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:37:52,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:37:52,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:37:52,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:37:52,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:37:52,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:37:52,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:37:52,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:37:52,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:37:52,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:37:52,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:37:52,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:37:52,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:37:52,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:37:52,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:37:52,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:37:52,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:37:52,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:37:52,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:37:52,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:37:52,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:37:52,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:37:52,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:37:52,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:37:52,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:37:52,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:37:52,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:37:52,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:37:52,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:37:52,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:37:52,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:37:52,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:37:52,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:37:52,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:37:52,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:37:52,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:37:52,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:37:52,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:37:52,743 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:37:52,743 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:37:52,744 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:37:52,744 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:37:52,744 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:37:52,745 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:37:52,745 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:37:52,745 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:37:52,745 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:37:52,746 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:37:52,746 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:37:52,746 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:37:52,747 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:37:52,747 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:37:52,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:37:52,748 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:37:52,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:37:52,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:37:52,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:37:52,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:37:52,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:37:52,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:37:52,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:37:52,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:37:52,750 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:37:52,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:37:52,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:37:52,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:37:52,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:37:52,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:37:52,752 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:37:52,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:37:52,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:37:52,752 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:37:52,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:37:52,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:37:52,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:37:52,753 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_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/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_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS 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 -> 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 [2022-11-19 07:37:53,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:37:53,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:37:53,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:37:53,056 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:37:53,057 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:37:53,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i [2022-11-19 07:37:53,123 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/data/842da176d/db96200c654b4b6c8b1118e44ac05f0d/FLAG57c6a1d16 [2022-11-19 07:37:53,736 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:37:53,736 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/sv-benchmarks/c/pthread-wmm/mix013.oepc.i [2022-11-19 07:37:53,758 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/data/842da176d/db96200c654b4b6c8b1118e44ac05f0d/FLAG57c6a1d16 [2022-11-19 07:37:54,020 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/data/842da176d/db96200c654b4b6c8b1118e44ac05f0d [2022-11-19 07:37:54,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:37:54,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:37:54,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:37:54,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:37:54,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:37:54,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f0ea46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54, skipping insertion in model container [2022-11-19 07:37:54,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:37:54,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:37:54,375 WARN L234 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_745e4c77-7ccc-444c-9c1f-25f584e1b542/sv-benchmarks/c/pthread-wmm/mix013.oepc.i[945,958] [2022-11-19 07:37:54,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:37:54,701 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:37:54,717 WARN L234 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_745e4c77-7ccc-444c-9c1f-25f584e1b542/sv-benchmarks/c/pthread-wmm/mix013.oepc.i[945,958] [2022-11-19 07:37:54,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:37:54,832 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:37:54,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54 WrapperNode [2022-11-19 07:37:54,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:37:54,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:37:54,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:37:54,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:37:54,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,924 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-19 07:37:54,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:37:54,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:37:54,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:37:54,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:37:54,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,986 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:54,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:37:54,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:37:54,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:37:54,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:37:55,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2022-11-19 07:37:55,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:37:55,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:37:55,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:37:55,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:37:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:37:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:37:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:37:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:37:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:37:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:37:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:37:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:37:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:37:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:37:55,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:37:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:37:55,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:37:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:37:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:37:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:37:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:37:55,098 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:37:55,276 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:37:55,278 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:37:55,732 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:37:55,904 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:37:55,905 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:37:55,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55 BoogieIcfgContainer [2022-11-19 07:37:55,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:37:55,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:37:55,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:37:55,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:37:55,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:37:54" (1/3) ... [2022-11-19 07:37:55,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cdac93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:55, skipping insertion in model container [2022-11-19 07:37:55,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (2/3) ... [2022-11-19 07:37:55,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cdac93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:55, skipping insertion in model container [2022-11-19 07:37:55,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55" (3/3) ... [2022-11-19 07:37:55,924 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.oepc.i [2022-11-19 07:37:55,934 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 07:37:55,946 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:37:55,946 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 07:37:55,946 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:37:56,052 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:37:56,089 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:37:56,104 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 302 flow [2022-11-19 07:37:56,108 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 302 flow [2022-11-19 07:37:56,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2022-11-19 07:37:56,210 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2022-11-19 07:37:56,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:37:56,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-19 07:37:56,220 INFO L119 LiptonReduction]: Number of co-enabled transitions 3548 [2022-11-19 07:38:02,363 INFO L134 LiptonReduction]: Checked pairs total: 10503 [2022-11-19 07:38:02,364 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-19 07:38:02,373 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2022-11-19 07:38:02,690 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5126 states, 5123 states have (on average 4.0499707202810855) internal successors, (20748), 5125 states have internal predecessors, (20748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:02,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:38:02,721 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;@8509ead, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:38:02,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-19 07:38:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 5126 states, 5123 states have (on average 4.0499707202810855) internal successors, (20748), 5125 states have internal predecessors, (20748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:38:02,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:02,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:38:02,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 579998, now seen corresponding path program 1 times [2022-11-19 07:38:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:02,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6452864] [2022-11-19 07:38:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:03,230 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-19 07:38:03,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:03,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6452864] [2022-11-19 07:38:03,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6452864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:03,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:03,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:38:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076457035] [2022-11-19 07:38:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:03,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:03,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:03,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:03,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:03,288 INFO L87 Difference]: Start difference. First operand has 5126 states, 5123 states have (on average 4.0499707202810855) internal successors, (20748), 5125 states have internal predecessors, (20748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:03,531 INFO L93 Difference]: Finished difference Result 4152 states and 16292 transitions. [2022-11-19 07:38:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:03,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 07:38:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:03,591 INFO L225 Difference]: With dead ends: 4152 [2022-11-19 07:38:03,591 INFO L226 Difference]: Without dead ends: 3972 [2022-11-19 07:38:03,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-19 07:38:03,597 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:03,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2022-11-19 07:38:03,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3972. [2022-11-19 07:38:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3971 states have (on average 3.9456056408964995) internal successors, (15668), 3971 states have internal predecessors, (15668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 15668 transitions. [2022-11-19 07:38:03,952 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 15668 transitions. Word has length 3 [2022-11-19 07:38:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:03,952 INFO L495 AbstractCegarLoop]: Abstraction has 3972 states and 15668 transitions. [2022-11-19 07:38:03,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 15668 transitions. [2022-11-19 07:38:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:38:03,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:03,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:03,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:38:03,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1948992397, now seen corresponding path program 1 times [2022-11-19 07:38:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:03,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837939460] [2022-11-19 07:38:03,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:04,348 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-19 07:38:04,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:04,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837939460] [2022-11-19 07:38:04,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837939460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:04,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:04,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:38:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177446413] [2022-11-19 07:38:04,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:04,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:04,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:04,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:04,356 INFO L87 Difference]: Start difference. First operand 3972 states and 15668 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:04,512 INFO L93 Difference]: Finished difference Result 3956 states and 15588 transitions. [2022-11-19 07:38:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:04,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 07:38:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:04,545 INFO L225 Difference]: With dead ends: 3956 [2022-11-19 07:38:04,546 INFO L226 Difference]: Without dead ends: 3956 [2022-11-19 07:38:04,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-19 07:38:04,598 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:04,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2022-11-19 07:38:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3956. [2022-11-19 07:38:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3955 states have (on average 3.94134007585335) internal successors, (15588), 3955 states have internal predecessors, (15588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 15588 transitions. [2022-11-19 07:38:04,821 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 15588 transitions. Word has length 11 [2022-11-19 07:38:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:04,822 INFO L495 AbstractCegarLoop]: Abstraction has 3956 states and 15588 transitions. [2022-11-19 07:38:04,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 15588 transitions. [2022-11-19 07:38:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:38:04,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:04,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:04,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:38:04,825 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:04,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1318940418, now seen corresponding path program 1 times [2022-11-19 07:38:04,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:04,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630584464] [2022-11-19 07:38:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:04,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:05,051 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-19 07:38:05,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:05,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630584464] [2022-11-19 07:38:05,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630584464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:05,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:05,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:38:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713264888] [2022-11-19 07:38:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:05,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:05,055 INFO L87 Difference]: Start difference. First operand 3956 states and 15588 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:05,279 INFO L93 Difference]: Finished difference Result 3672 states and 14338 transitions. [2022-11-19 07:38:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:05,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:38:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:05,328 INFO L225 Difference]: With dead ends: 3672 [2022-11-19 07:38:05,328 INFO L226 Difference]: Without dead ends: 3672 [2022-11-19 07:38:05,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-19 07:38:05,332 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:05,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:05,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2022-11-19 07:38:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3672. [2022-11-19 07:38:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 3671 states have (on average 3.905747752655952) internal successors, (14338), 3671 states have internal predecessors, (14338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 14338 transitions. [2022-11-19 07:38:05,620 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 14338 transitions. Word has length 13 [2022-11-19 07:38:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:05,621 INFO L495 AbstractCegarLoop]: Abstraction has 3672 states and 14338 transitions. [2022-11-19 07:38:05,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 14338 transitions. [2022-11-19 07:38:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:38:05,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:05,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:05,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:38:05,626 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:05,627 INFO L85 PathProgramCache]: Analyzing trace with hash 374276526, now seen corresponding path program 1 times [2022-11-19 07:38:05,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:05,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120454304] [2022-11-19 07:38:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:05,868 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-19 07:38:05,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:05,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120454304] [2022-11-19 07:38:05,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120454304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:05,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:05,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:38:05,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014395335] [2022-11-19 07:38:05,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:05,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:38:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:38:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:38:05,877 INFO L87 Difference]: Start difference. First operand 3672 states and 14338 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:06,017 INFO L93 Difference]: Finished difference Result 3472 states and 13468 transitions. [2022-11-19 07:38:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:06,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:38:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:06,042 INFO L225 Difference]: With dead ends: 3472 [2022-11-19 07:38:06,043 INFO L226 Difference]: Without dead ends: 3472 [2022-11-19 07:38:06,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:38:06,044 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:06,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2022-11-19 07:38:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2022-11-19 07:38:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3471 states have (on average 3.8801498127340825) internal successors, (13468), 3471 states have internal predecessors, (13468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 13468 transitions. [2022-11-19 07:38:06,226 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 13468 transitions. Word has length 13 [2022-11-19 07:38:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:06,226 INFO L495 AbstractCegarLoop]: Abstraction has 3472 states and 13468 transitions. [2022-11-19 07:38:06,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 13468 transitions. [2022-11-19 07:38:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:38:06,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:06,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:06,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:38:06,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1041973217, now seen corresponding path program 1 times [2022-11-19 07:38:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:06,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315569312] [2022-11-19 07:38:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:06,480 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-19 07:38:06,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315569312] [2022-11-19 07:38:06,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315569312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:06,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:06,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:38:06,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681002223] [2022-11-19 07:38:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:06,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:38:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:06,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:38:06,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:38:06,483 INFO L87 Difference]: Start difference. First operand 3472 states and 13468 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:06,680 INFO L93 Difference]: Finished difference Result 3428 states and 12088 transitions. [2022-11-19 07:38:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:38:06,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:38:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:06,696 INFO L225 Difference]: With dead ends: 3428 [2022-11-19 07:38:06,696 INFO L226 Difference]: Without dead ends: 2528 [2022-11-19 07:38:06,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 07:38:06,698 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:06,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 25 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2022-11-19 07:38:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2022-11-19 07:38:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2527 states have (on average 3.4618124258013454) internal successors, (8748), 2527 states have internal predecessors, (8748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 8748 transitions. [2022-11-19 07:38:06,805 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 8748 transitions. Word has length 15 [2022-11-19 07:38:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:06,805 INFO L495 AbstractCegarLoop]: Abstraction has 2528 states and 8748 transitions. [2022-11-19 07:38:06,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 8748 transitions. [2022-11-19 07:38:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:38:06,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:06,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:06,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:38:06,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:06,813 INFO L85 PathProgramCache]: Analyzing trace with hash 973861097, now seen corresponding path program 1 times [2022-11-19 07:38:06,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:06,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018043629] [2022-11-19 07:38:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:07,134 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-19 07:38:07,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:07,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018043629] [2022-11-19 07:38:07,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018043629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:07,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:07,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:38:07,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851352240] [2022-11-19 07:38:07,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:07,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:38:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:07,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:38:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:38:07,137 INFO L87 Difference]: Start difference. First operand 2528 states and 8748 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:07,361 INFO L93 Difference]: Finished difference Result 2140 states and 6896 transitions. [2022-11-19 07:38:07,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:38:07,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:38:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:07,369 INFO L225 Difference]: With dead ends: 2140 [2022-11-19 07:38:07,370 INFO L226 Difference]: Without dead ends: 1640 [2022-11-19 07:38:07,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:38:07,371 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:07,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 35 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:38:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2022-11-19 07:38:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2022-11-19 07:38:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 3.1702257474069553) internal successors, (5196), 1639 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5196 transitions. [2022-11-19 07:38:07,419 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5196 transitions. Word has length 18 [2022-11-19 07:38:07,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:07,420 INFO L495 AbstractCegarLoop]: Abstraction has 1640 states and 5196 transitions. [2022-11-19 07:38:07,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5196 transitions. [2022-11-19 07:38:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:38:07,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:07,424 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] [2022-11-19 07:38:07,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:38:07,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash 617531907, now seen corresponding path program 1 times [2022-11-19 07:38:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:07,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611363175] [2022-11-19 07:38:07,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:07,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:07,833 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-19 07:38:07,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:07,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611363175] [2022-11-19 07:38:07,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611363175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:07,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:07,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:38:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553796191] [2022-11-19 07:38:07,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:38:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:38:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:38:07,837 INFO L87 Difference]: Start difference. First operand 1640 states and 5196 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:08,090 INFO L93 Difference]: Finished difference Result 1465 states and 4632 transitions. [2022-11-19 07:38:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:38:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 07:38:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:08,096 INFO L225 Difference]: With dead ends: 1465 [2022-11-19 07:38:08,096 INFO L226 Difference]: Without dead ends: 1325 [2022-11-19 07:38:08,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:08,097 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 127 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:08,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 45 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:38:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-11-19 07:38:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-11-19 07:38:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 3.210725075528701) internal successors, (4251), 1324 states have internal predecessors, (4251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 4251 transitions. [2022-11-19 07:38:08,135 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 4251 transitions. Word has length 21 [2022-11-19 07:38:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:08,135 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 4251 transitions. [2022-11-19 07:38:08,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 4251 transitions. [2022-11-19 07:38:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:38:08,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:08,139 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] [2022-11-19 07:38:08,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:38:08,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash 49599487, now seen corresponding path program 1 times [2022-11-19 07:38:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:08,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778093180] [2022-11-19 07:38:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:08,917 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-19 07:38:08,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:08,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778093180] [2022-11-19 07:38:08,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778093180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:08,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:08,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:38:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758626790] [2022-11-19 07:38:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:08,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:38:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:38:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:38:08,920 INFO L87 Difference]: Start difference. First operand 1325 states and 4251 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:09,276 INFO L93 Difference]: Finished difference Result 2330 states and 7239 transitions. [2022-11-19 07:38:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:38:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-19 07:38:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:09,290 INFO L225 Difference]: With dead ends: 2330 [2022-11-19 07:38:09,290 INFO L226 Difference]: Without dead ends: 2087 [2022-11-19 07:38:09,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:09,293 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 60 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:09,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 65 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:38:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2022-11-19 07:38:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1704. [2022-11-19 07:38:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 3.150322959483265) internal successors, (5365), 1703 states have internal predecessors, (5365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 5365 transitions. [2022-11-19 07:38:09,352 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 5365 transitions. Word has length 25 [2022-11-19 07:38:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:09,353 INFO L495 AbstractCegarLoop]: Abstraction has 1704 states and 5365 transitions. [2022-11-19 07:38:09,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 5365 transitions. [2022-11-19 07:38:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:38:09,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:09,358 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] [2022-11-19 07:38:09,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:38:09,358 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash -997797507, now seen corresponding path program 2 times [2022-11-19 07:38:09,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:09,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757666603] [2022-11-19 07:38:09,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:09,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:10,391 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-19 07:38:10,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:10,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757666603] [2022-11-19 07:38:10,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757666603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:10,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:10,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:38:10,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088484993] [2022-11-19 07:38:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:10,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:38:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:10,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:38:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:10,394 INFO L87 Difference]: Start difference. First operand 1704 states and 5365 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:10,774 INFO L93 Difference]: Finished difference Result 2059 states and 6286 transitions. [2022-11-19 07:38:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:38:10,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-19 07:38:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:10,782 INFO L225 Difference]: With dead ends: 2059 [2022-11-19 07:38:10,782 INFO L226 Difference]: Without dead ends: 1951 [2022-11-19 07:38:10,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:38:10,784 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 80 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:10,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 47 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:38:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2022-11-19 07:38:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1568. [2022-11-19 07:38:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 3.1518825781748565) internal successors, (4939), 1567 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 4939 transitions. [2022-11-19 07:38:10,849 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 4939 transitions. Word has length 25 [2022-11-19 07:38:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:10,849 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 4939 transitions. [2022-11-19 07:38:10,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 4939 transitions. [2022-11-19 07:38:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:38:10,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:10,856 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] [2022-11-19 07:38:10,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:38:10,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash 548311231, now seen corresponding path program 3 times [2022-11-19 07:38:10,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:10,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643843622] [2022-11-19 07:38:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:11,181 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-19 07:38:11,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:11,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643843622] [2022-11-19 07:38:11,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643843622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:11,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:11,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:38:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105900798] [2022-11-19 07:38:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:11,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:38:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:38:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:11,183 INFO L87 Difference]: Start difference. First operand 1568 states and 4939 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:11,408 INFO L93 Difference]: Finished difference Result 1537 states and 4872 transitions. [2022-11-19 07:38:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:38:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-19 07:38:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:11,414 INFO L225 Difference]: With dead ends: 1537 [2022-11-19 07:38:11,414 INFO L226 Difference]: Without dead ends: 1395 [2022-11-19 07:38:11,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:38:11,415 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 126 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:11,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 40 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:38:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2022-11-19 07:38:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2022-11-19 07:38:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1394 states have (on average 3.19583931133429) internal successors, (4455), 1394 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 4455 transitions. [2022-11-19 07:38:11,458 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 4455 transitions. Word has length 25 [2022-11-19 07:38:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:11,459 INFO L495 AbstractCegarLoop]: Abstraction has 1395 states and 4455 transitions. [2022-11-19 07:38:11,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 4455 transitions. [2022-11-19 07:38:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:38:11,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:11,463 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-19 07:38:11,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:38:11,464 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1560756509, now seen corresponding path program 1 times [2022-11-19 07:38:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:11,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650044246] [2022-11-19 07:38:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:11,753 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-19 07:38:11,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650044246] [2022-11-19 07:38:11,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650044246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:11,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:11,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:38:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324708982] [2022-11-19 07:38:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:11,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:38:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:38:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:38:11,756 INFO L87 Difference]: Start difference. First operand 1395 states and 4455 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:11,884 INFO L93 Difference]: Finished difference Result 1895 states and 5976 transitions. [2022-11-19 07:38:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:38:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 07:38:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:11,890 INFO L225 Difference]: With dead ends: 1895 [2022-11-19 07:38:11,890 INFO L226 Difference]: Without dead ends: 1095 [2022-11-19 07:38:11,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 07:38:11,891 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:11,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 19 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-11-19 07:38:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2022-11-19 07:38:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 3.0978062157221204) internal successors, (3389), 1094 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 3389 transitions. [2022-11-19 07:38:11,922 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 3389 transitions. Word has length 29 [2022-11-19 07:38:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:11,922 INFO L495 AbstractCegarLoop]: Abstraction has 1095 states and 3389 transitions. [2022-11-19 07:38:11,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 3389 transitions. [2022-11-19 07:38:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:38:11,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:11,926 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-19 07:38:11,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:38:11,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1397715329, now seen corresponding path program 2 times [2022-11-19 07:38:11,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:11,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407494095] [2022-11-19 07:38:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:12,159 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-19 07:38:12,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:12,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407494095] [2022-11-19 07:38:12,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407494095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:12,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:12,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:38:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599357035] [2022-11-19 07:38:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:12,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:38:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:38:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:38:12,162 INFO L87 Difference]: Start difference. First operand 1095 states and 3389 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:12,290 INFO L93 Difference]: Finished difference Result 1562 states and 4769 transitions. [2022-11-19 07:38:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:38:12,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 07:38:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:12,293 INFO L225 Difference]: With dead ends: 1562 [2022-11-19 07:38:12,293 INFO L226 Difference]: Without dead ends: 630 [2022-11-19 07:38:12,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 07:38:12,294 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:12,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-11-19 07:38:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-11-19 07:38:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 2.879173290937997) internal successors, (1811), 629 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1811 transitions. [2022-11-19 07:38:12,311 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1811 transitions. Word has length 29 [2022-11-19 07:38:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:12,312 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 1811 transitions. [2022-11-19 07:38:12,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1811 transitions. [2022-11-19 07:38:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:38:12,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:12,314 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-19 07:38:12,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:38:12,315 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1337263915, now seen corresponding path program 3 times [2022-11-19 07:38:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:12,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777948582] [2022-11-19 07:38:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:13,203 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-19 07:38:13,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:13,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777948582] [2022-11-19 07:38:13,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777948582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:13,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:13,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:38:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543290501] [2022-11-19 07:38:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:13,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:38:13,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:38:13,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:13,206 INFO L87 Difference]: Start difference. First operand 630 states and 1811 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:13,575 INFO L93 Difference]: Finished difference Result 990 states and 2761 transitions. [2022-11-19 07:38:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:38:13,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 07:38:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:13,579 INFO L225 Difference]: With dead ends: 990 [2022-11-19 07:38:13,579 INFO L226 Difference]: Without dead ends: 835 [2022-11-19 07:38:13,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:38:13,580 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:13,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 53 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:38:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-11-19 07:38:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 682. [2022-11-19 07:38:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 2.859030837004405) internal successors, (1947), 681 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1947 transitions. [2022-11-19 07:38:13,604 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1947 transitions. Word has length 29 [2022-11-19 07:38:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:13,605 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 1947 transitions. [2022-11-19 07:38:13,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1947 transitions. [2022-11-19 07:38:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:38:13,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:13,607 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-19 07:38:13,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:38:13,608 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash -631728935, now seen corresponding path program 4 times [2022-11-19 07:38:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:13,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631931137] [2022-11-19 07:38:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:13,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:14,721 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-19 07:38:14,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:14,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631931137] [2022-11-19 07:38:14,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631931137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:14,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:14,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:38:14,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976134721] [2022-11-19 07:38:14,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:14,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:38:14,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:14,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:38:14,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:38:14,723 INFO L87 Difference]: Start difference. First operand 682 states and 1947 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:15,057 INFO L93 Difference]: Finished difference Result 957 states and 2651 transitions. [2022-11-19 07:38:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:38:15,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 07:38:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:15,060 INFO L225 Difference]: With dead ends: 957 [2022-11-19 07:38:15,061 INFO L226 Difference]: Without dead ends: 759 [2022-11-19 07:38:15,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:38:15,061 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 76 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:15,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 53 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:38:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-11-19 07:38:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 622. [2022-11-19 07:38:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 2.8357487922705316) internal successors, (1761), 621 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1761 transitions. [2022-11-19 07:38:15,084 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1761 transitions. Word has length 29 [2022-11-19 07:38:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:15,085 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 1761 transitions. [2022-11-19 07:38:15,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1761 transitions. [2022-11-19 07:38:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:38:15,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:15,087 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-19 07:38:15,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:38:15,087 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 888923487, now seen corresponding path program 5 times [2022-11-19 07:38:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:15,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801575616] [2022-11-19 07:38:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:16,532 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-19 07:38:16,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:16,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801575616] [2022-11-19 07:38:16,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801575616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:16,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:16,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:38:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168793716] [2022-11-19 07:38:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:16,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:38:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:16,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:38:16,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:38:16,534 INFO L87 Difference]: Start difference. First operand 622 states and 1761 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:16,876 INFO L93 Difference]: Finished difference Result 648 states and 1815 transitions. [2022-11-19 07:38:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:38:16,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 07:38:16,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:16,878 INFO L225 Difference]: With dead ends: 648 [2022-11-19 07:38:16,878 INFO L226 Difference]: Without dead ends: 510 [2022-11-19 07:38:16,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:38:16,879 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:16,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 48 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:38:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-19 07:38:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 398. [2022-11-19 07:38:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.8035264483627205) internal successors, (1113), 397 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1113 transitions. [2022-11-19 07:38:16,894 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1113 transitions. Word has length 29 [2022-11-19 07:38:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:16,895 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 1113 transitions. [2022-11-19 07:38:16,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:38:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1113 transitions. [2022-11-19 07:38:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:38:16,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:16,896 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-19 07:38:16,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:38:16,897 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:38:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1508628275, now seen corresponding path program 6 times [2022-11-19 07:38:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:16,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042571786] [2022-11-19 07:38:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:16,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:38:16,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:38:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:38:17,134 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:38:17,136 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:38:17,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-19 07:38:17,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-19 07:38:17,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-19 07:38:17,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-19 07:38:17,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-19 07:38:17,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-19 07:38:17,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-19 07:38:17,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:38:17,144 INFO L444 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:17,150 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:38:17,150 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:38:17,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:38:17 BasicIcfg [2022-11-19 07:38:17,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:38:17,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:38:17,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:38:17,276 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:38:17,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55" (3/4) ... [2022-11-19 07:38:17,279 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 07:38:17,360 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:38:17,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:38:17,361 INFO L158 Benchmark]: Toolchain (without parser) took 23337.34ms. Allocated memory was 127.9MB in the beginning and 761.3MB in the end (delta: 633.3MB). Free memory was 85.1MB in the beginning and 405.9MB in the end (delta: -320.8MB). Peak memory consumption was 312.4MB. Max. memory is 16.1GB. [2022-11-19 07:38:17,361 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 127.9MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:38:17,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 807.08ms. Allocated memory is still 127.9MB. Free memory was 84.8MB in the beginning and 86.5MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:38:17,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.92ms. Allocated memory is still 127.9MB. Free memory was 86.5MB in the beginning and 83.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:38:17,362 INFO L158 Benchmark]: Boogie Preprocessor took 67.65ms. Allocated memory is still 127.9MB. Free memory was 83.9MB in the beginning and 82.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:38:17,363 INFO L158 Benchmark]: RCFGBuilder took 912.67ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 81.8MB in the beginning and 127.4MB in the end (delta: -45.6MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-11-19 07:38:17,363 INFO L158 Benchmark]: TraceAbstraction took 21365.47ms. Allocated memory was 157.3MB in the beginning and 761.3MB in the end (delta: 604.0MB). Free memory was 126.4MB in the beginning and 423.7MB in the end (delta: -297.4MB). Peak memory consumption was 305.6MB. Max. memory is 16.1GB. [2022-11-19 07:38:17,363 INFO L158 Benchmark]: Witness Printer took 84.72ms. Allocated memory is still 761.3MB. Free memory was 423.7MB in the beginning and 405.9MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-19 07:38:17,365 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.26ms. Allocated memory is still 127.9MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 807.08ms. Allocated memory is still 127.9MB. Free memory was 84.8MB in the beginning and 86.5MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.92ms. Allocated memory is still 127.9MB. Free memory was 86.5MB in the beginning and 83.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.65ms. Allocated memory is still 127.9MB. Free memory was 83.9MB in the beginning and 82.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 912.67ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 81.8MB in the beginning and 127.4MB in the end (delta: -45.6MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21365.47ms. Allocated memory was 157.3MB in the beginning and 761.3MB in the end (delta: 604.0MB). Free memory was 126.4MB in the beginning and 423.7MB in the end (delta: -297.4MB). Peak memory consumption was 305.6MB. Max. memory is 16.1GB. * Witness Printer took 84.72ms. Allocated memory is still 761.3MB. Free memory was 423.7MB in the beginning and 405.9MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 152 PlacesBefore, 48 PlacesAfterwards, 141 TransitionsBefore, 36 TransitionsAfterwards, 3548 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 10503 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5483, independent: 5222, independent conditional: 0, independent unconditional: 5222, dependent: 261, dependent conditional: 0, dependent unconditional: 261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2773, independent: 2675, independent conditional: 0, independent unconditional: 2675, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2773, independent: 2649, independent conditional: 0, independent unconditional: 2649, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 655, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 607, dependent conditional: 0, dependent unconditional: 607, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5483, independent: 2547, independent conditional: 0, independent unconditional: 2547, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 2773, unknown conditional: 0, unknown unconditional: 2773] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 328, Positive conditional cache size: 0, Positive unconditional cache size: 328, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L742] 0 _Bool a$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L712] 0 int __unbuffered_p0_EAX = 0; [L726] 0 int a$mem_tmp; [L737] 0 _Bool a$read_delayed; [L714] 0 int __unbuffered_p1_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L735] 0 _Bool a$r_buff1_thd3; [L718] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$r_buff1_thd1; [L739] 0 int a$w_buff0; [L734] 0 _Bool a$r_buff1_thd2; [L741] 0 int a$w_buff1; [L725] 0 _Bool a$flush_delayed; [L732] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L738] 0 int *a$read_delayed_var; [L744] 0 _Bool main$tmp_guard1; [L743] 0 _Bool main$tmp_guard0; [L740] 0 _Bool a$w_buff0_used; [L716] 0 int __unbuffered_p1_EBX = 0; [L728] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd0; [L720] 0 int __unbuffered_p3_EAX = 0; [L730] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd2; [L731] 0 _Bool a$r_buff0_thd4; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L873] 0 pthread_t t321; [L874] FCALL, FORK 0 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t321, ((void *)0), P0, ((void *)0))=-2, t321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t322; [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t322, ((void *)0), P1, ((void *)0))=-1, t321={5:0}, t322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t323; [L878] FCALL, FORK 0 pthread_create(&t323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t323, ((void *)0), P2, ((void *)0))=0, t321={5:0}, t322={6:0}, t323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t324; [L880] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t324, ((void *)0), P3, ((void *)0))=1, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L829] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 835 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 835 mSDsluCounter, 481 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 334 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2267 IncrementalHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 147 mSDtfsCounter, 2267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5126occurred in iteration=0, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 1168 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 3214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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-19 07:38:17,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_745e4c77-7ccc-444c-9c1f-25f584e1b542/bin/utaipan-I9t0OCRTmS/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