./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba --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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- 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-b5237d8 [2022-11-22 00:09:37,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:09:37,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:09:37,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:09:37,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:09:37,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:09:37,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:09:37,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:09:37,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:09:37,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:09:37,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:09:37,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:09:37,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:09:37,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:09:37,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:09:38,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:09:38,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:09:38,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:09:38,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:09:38,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:09:38,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:09:38,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:09:38,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:09:38,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:09:38,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:09:38,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:09:38,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:09:38,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:09:38,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:09:38,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:09:38,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:09:38,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:09:38,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:09:38,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:09:38,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:09:38,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:09:38,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:09:38,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:09:38,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:09:38,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:09:38,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:09:38,026 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 00:09:38,049 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:09:38,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:09:38,050 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:09:38,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:09:38,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:09:38,051 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:09:38,051 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:09:38,051 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:09:38,051 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:09:38,052 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:09:38,052 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:09:38,052 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:09:38,052 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:09:38,052 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:09:38,053 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:09:38,053 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:09:38,053 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:09:38,053 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:09:38,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:09:38,054 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:09:38,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:09:38,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:09:38,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:09:38,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:09:38,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:09:38,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:09:38,069 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:09:38,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:09:38,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:09:38,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:09:38,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:09:38,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:09:38,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:09:38,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:09:38,071 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:09:38,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:09:38,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:09:38,071 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:09:38,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:09:38,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:09:38,072 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:09:38,072 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_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/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_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2022-11-22 00:09:38,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:09:38,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:09:38,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:09:38,477 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:09:38,477 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:09:38,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-11-22 00:09:41,567 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:09:41,858 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:09:41,858 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-11-22 00:09:41,872 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/data/6d921bdc3/e9543c377ced4e9494f0b184ece0b390/FLAG2f2e1e795 [2022-11-22 00:09:41,887 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/data/6d921bdc3/e9543c377ced4e9494f0b184ece0b390 [2022-11-22 00:09:41,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:09:41,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:09:41,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:09:41,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:09:41,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:09:41,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:09:41" (1/1) ... [2022-11-22 00:09:41,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ea9c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:41, skipping insertion in model container [2022-11-22 00:09:41,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:09:41" (1/1) ... [2022-11-22 00:09:41,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:09:41,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:09:42,140 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2022-11-22 00:09:42,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:09:42,483 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:09:42,497 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2022-11-22 00:09:42,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:09:42,633 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:09:42,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42 WrapperNode [2022-11-22 00:09:42,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:09:42,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:09:42,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:09:42,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:09:42,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,721 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-11-22 00:09:42,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:09:42,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:09:42,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:09:42,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:09:42,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,818 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:09:42,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:09:42,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:09:42,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:09:42,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (1/1) ... [2022-11-22 00:09:42,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:09:42,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:09:42,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:09:42,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:09:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:09:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:09:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:09:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:09:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:09:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:09:42,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:09:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:09:42,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:09:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:09:42,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:09:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-22 00:09:42,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-22 00:09:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:09:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:09:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:09:42,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:09:42,935 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:09:43,128 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:09:43,130 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:09:43,527 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:09:43,847 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:09:43,847 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:09:43,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:09:43 BoogieIcfgContainer [2022-11-22 00:09:43,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:09:43,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:09:43,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:09:43,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:09:43,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:09:41" (1/3) ... [2022-11-22 00:09:43,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26db68fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:09:43, skipping insertion in model container [2022-11-22 00:09:43,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:09:42" (2/3) ... [2022-11-22 00:09:43,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26db68fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:09:43, skipping insertion in model container [2022-11-22 00:09:43,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:09:43" (3/3) ... [2022-11-22 00:09:43,864 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2022-11-22 00:09:43,875 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 00:09:43,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:09:43,887 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 00:09:43,887 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:09:43,996 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:09:44,052 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:09:44,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 292 flow [2022-11-22 00:09:44,082 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 292 flow [2022-11-22 00:09:44,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-22 00:09:44,201 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-22 00:09:44,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:09:44,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-22 00:09:44,213 INFO L119 LiptonReduction]: Number of co-enabled transitions 2934 [2022-11-22 00:09:50,139 INFO L134 LiptonReduction]: Checked pairs total: 7181 [2022-11-22 00:09:50,139 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-22 00:09:50,147 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2022-11-22 00:09:50,278 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 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-22 00:09:50,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:09:50,304 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;@b26b766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:09:50,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-22 00:09:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 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-22 00:09:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 00:09:50,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:50,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:09:50,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1960543649, now seen corresponding path program 1 times [2022-11-22 00:09:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:50,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257911419] [2022-11-22 00:09:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:50,892 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-22 00:09:50,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:50,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257911419] [2022-11-22 00:09:50,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257911419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:50,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:50,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:09:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871786824] [2022-11-22 00:09:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:50,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:09:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:50,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:09:50,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:09:50,944 INFO L87 Difference]: Start difference. First operand has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-22 00:09:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:51,103 INFO L93 Difference]: Finished difference Result 1770 states and 6608 transitions. [2022-11-22 00:09:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:09:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-11-22 00:09:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:51,172 INFO L225 Difference]: With dead ends: 1770 [2022-11-22 00:09:51,172 INFO L226 Difference]: Without dead ends: 1706 [2022-11-22 00:09:51,173 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-22 00:09:51,176 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:51,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:09:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2022-11-22 00:09:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2022-11-22 00:09:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 3.7536656891495603) internal successors, (6400), 1705 states have internal predecessors, (6400), 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-22 00:09:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 6400 transitions. [2022-11-22 00:09:51,351 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 6400 transitions. Word has length 9 [2022-11-22 00:09:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:51,353 INFO L495 AbstractCegarLoop]: Abstraction has 1706 states and 6400 transitions. [2022-11-22 00:09:51,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-22 00:09:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 6400 transitions. [2022-11-22 00:09:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:09:51,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:51,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:09:51,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:09:51,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:51,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1408129318, now seen corresponding path program 1 times [2022-11-22 00:09:51,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:51,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673533496] [2022-11-22 00:09:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:51,602 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-22 00:09:51,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:51,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673533496] [2022-11-22 00:09:51,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673533496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:51,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:51,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:09:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866344008] [2022-11-22 00:09:51,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:51,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:09:51,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:51,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:09:51,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:09:51,608 INFO L87 Difference]: Start difference. First operand 1706 states and 6400 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-22 00:09:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:51,704 INFO L93 Difference]: Finished difference Result 1578 states and 5856 transitions. [2022-11-22 00:09:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:09:51,706 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-22 00:09:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:51,718 INFO L225 Difference]: With dead ends: 1578 [2022-11-22 00:09:51,718 INFO L226 Difference]: Without dead ends: 1578 [2022-11-22 00:09:51,719 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-22 00:09:51,722 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:51,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:09:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-11-22 00:09:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2022-11-22 00:09:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 3.713379835129994) internal successors, (5856), 1577 states have internal predecessors, (5856), 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-22 00:09:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 5856 transitions. [2022-11-22 00:09:51,792 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 5856 transitions. Word has length 11 [2022-11-22 00:09:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:51,793 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 5856 transitions. [2022-11-22 00:09:51,793 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-22 00:09:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 5856 transitions. [2022-11-22 00:09:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:09:51,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:51,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:09:51,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:09:51,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash -297617673, now seen corresponding path program 1 times [2022-11-22 00:09:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:51,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617384746] [2022-11-22 00:09:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:52,189 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-22 00:09:52,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:52,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617384746] [2022-11-22 00:09:52,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617384746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:52,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:52,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:09:52,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420213315] [2022-11-22 00:09:52,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:52,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:09:52,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:09:52,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:09:52,196 INFO L87 Difference]: Start difference. First operand 1578 states and 5856 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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-22 00:09:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:52,372 INFO L93 Difference]: Finished difference Result 1611 states and 5420 transitions. [2022-11-22 00:09:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:09:52,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) 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-22 00:09:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:52,381 INFO L225 Difference]: With dead ends: 1611 [2022-11-22 00:09:52,381 INFO L226 Difference]: Without dead ends: 1227 [2022-11-22 00:09:52,383 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-22 00:09:52,384 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:52,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 15 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:09:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-11-22 00:09:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1227. [2022-11-22 00:09:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1226 states have (on average 3.3450244698205545) internal successors, (4101), 1226 states have internal predecessors, (4101), 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-22 00:09:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 4101 transitions. [2022-11-22 00:09:52,434 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 4101 transitions. Word has length 13 [2022-11-22 00:09:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:52,435 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 4101 transitions. [2022-11-22 00:09:52,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) 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-22 00:09:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 4101 transitions. [2022-11-22 00:09:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:09:52,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:52,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:09:52,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:09:52,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1422286718, now seen corresponding path program 1 times [2022-11-22 00:09:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:52,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036687935] [2022-11-22 00:09:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:52,767 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-22 00:09:52,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:52,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036687935] [2022-11-22 00:09:52,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036687935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:52,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:52,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:09:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811134955] [2022-11-22 00:09:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:52,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:09:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:52,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:09:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:09:52,774 INFO L87 Difference]: Start difference. First operand 1227 states and 4101 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-22 00:09:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:52,985 INFO L93 Difference]: Finished difference Result 1044 states and 3179 transitions. [2022-11-22 00:09:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:09:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-11-22 00:09:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:52,991 INFO L225 Difference]: With dead ends: 1044 [2022-11-22 00:09:52,991 INFO L226 Difference]: Without dead ends: 795 [2022-11-22 00:09:52,992 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-22 00:09:52,993 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 62 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:52,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 21 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:09:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-11-22 00:09:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-11-22 00:09:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 2.9886649874055418) internal successors, (2373), 794 states have internal predecessors, (2373), 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-22 00:09:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2373 transitions. [2022-11-22 00:09:53,023 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 2373 transitions. Word has length 16 [2022-11-22 00:09:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:53,023 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 2373 transitions. [2022-11-22 00:09:53,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-22 00:09:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 2373 transitions. [2022-11-22 00:09:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:09:53,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:53,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:09:53,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:09:53,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:53,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1683030763, now seen corresponding path program 1 times [2022-11-22 00:09:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:53,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968093773] [2022-11-22 00:09:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:53,256 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-22 00:09:53,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:53,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968093773] [2022-11-22 00:09:53,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968093773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:53,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:53,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:09:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275446410] [2022-11-22 00:09:53,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:53,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:09:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:09:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:09:53,259 INFO L87 Difference]: Start difference. First operand 795 states and 2373 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-22 00:09:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:53,397 INFO L93 Difference]: Finished difference Result 1062 states and 3087 transitions. [2022-11-22 00:09:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:09:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2022-11-22 00:09:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:53,402 INFO L225 Difference]: With dead ends: 1062 [2022-11-22 00:09:53,403 INFO L226 Difference]: Without dead ends: 822 [2022-11-22 00:09:53,403 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-22 00:09:53,404 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:53,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:09:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-11-22 00:09:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 795. [2022-11-22 00:09:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 2.9055415617128464) internal successors, (2307), 794 states have internal predecessors, (2307), 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-22 00:09:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2307 transitions. [2022-11-22 00:09:53,433 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 2307 transitions. Word has length 19 [2022-11-22 00:09:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:53,433 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 2307 transitions. [2022-11-22 00:09:53,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-22 00:09:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 2307 transitions. [2022-11-22 00:09:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:09:53,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:53,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:09:53,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:09:53,437 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1582944827, now seen corresponding path program 1 times [2022-11-22 00:09:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:53,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974632863] [2022-11-22 00:09:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:53,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:53,728 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-22 00:09:53,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:53,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974632863] [2022-11-22 00:09:53,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974632863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:53,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:53,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:09:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976301236] [2022-11-22 00:09:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:53,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:09:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:09:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:09:53,730 INFO L87 Difference]: Start difference. First operand 795 states and 2307 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-22 00:09:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:53,937 INFO L93 Difference]: Finished difference Result 684 states and 1950 transitions. [2022-11-22 00:09:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:09:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-11-22 00:09:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:53,942 INFO L225 Difference]: With dead ends: 684 [2022-11-22 00:09:53,942 INFO L226 Difference]: Without dead ends: 597 [2022-11-22 00:09:53,942 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-22 00:09:53,943 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 104 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:53,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 26 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:09:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-22 00:09:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2022-11-22 00:09:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 2.901006711409396) internal successors, (1729), 596 states have internal predecessors, (1729), 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-22 00:09:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1729 transitions. [2022-11-22 00:09:53,964 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1729 transitions. Word has length 19 [2022-11-22 00:09:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:53,965 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 1729 transitions. [2022-11-22 00:09:53,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-22 00:09:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1729 transitions. [2022-11-22 00:09:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:09:53,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:53,967 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] [2022-11-22 00:09:53,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:09:53,968 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash -316471714, now seen corresponding path program 1 times [2022-11-22 00:09:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:53,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208483838] [2022-11-22 00:09:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:54,191 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-22 00:09:54,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:54,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208483838] [2022-11-22 00:09:54,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208483838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:54,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:54,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:09:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532888129] [2022-11-22 00:09:54,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:54,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:09:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:54,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:09:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:09:54,194 INFO L87 Difference]: Start difference. First operand 597 states and 1729 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-22 00:09:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:54,346 INFO L93 Difference]: Finished difference Result 815 states and 2292 transitions. [2022-11-22 00:09:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:09:54,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-22 00:09:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:54,351 INFO L225 Difference]: With dead ends: 815 [2022-11-22 00:09:54,351 INFO L226 Difference]: Without dead ends: 761 [2022-11-22 00:09:54,352 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-22 00:09:54,352 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:54,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 8 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:09:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-11-22 00:09:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 631. [2022-11-22 00:09:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 2.842857142857143) internal successors, (1791), 630 states have internal predecessors, (1791), 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-22 00:09:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1791 transitions. [2022-11-22 00:09:54,376 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1791 transitions. Word has length 22 [2022-11-22 00:09:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:54,377 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 1791 transitions. [2022-11-22 00:09:54,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-22 00:09:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1791 transitions. [2022-11-22 00:09:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:09:54,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:54,379 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] [2022-11-22 00:09:54,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:09:54,380 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2081737834, now seen corresponding path program 2 times [2022-11-22 00:09:54,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:54,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662108455] [2022-11-22 00:09:54,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:54,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:54,609 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-22 00:09:54,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:54,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662108455] [2022-11-22 00:09:54,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662108455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:54,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:54,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:09:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145435905] [2022-11-22 00:09:54,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:54,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:09:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:54,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:09:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:09:54,612 INFO L87 Difference]: Start difference. First operand 631 states and 1791 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-22 00:09:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:54,732 INFO L93 Difference]: Finished difference Result 849 states and 2354 transitions. [2022-11-22 00:09:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:09:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-22 00:09:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:54,736 INFO L225 Difference]: With dead ends: 849 [2022-11-22 00:09:54,736 INFO L226 Difference]: Without dead ends: 509 [2022-11-22 00:09:54,736 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-22 00:09:54,737 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 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-22 00:09:54,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:09:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-11-22 00:09:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2022-11-22 00:09:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 2.6363636363636362) internal successors, (1334), 506 states have internal predecessors, (1334), 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-22 00:09:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1334 transitions. [2022-11-22 00:09:54,755 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1334 transitions. Word has length 22 [2022-11-22 00:09:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:54,756 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 1334 transitions. [2022-11-22 00:09:54,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-22 00:09:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1334 transitions. [2022-11-22 00:09:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:09:54,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:54,758 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] [2022-11-22 00:09:54,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:09:54,759 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1904416270, now seen corresponding path program 3 times [2022-11-22 00:09:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:54,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645024218] [2022-11-22 00:09:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:55,030 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-22 00:09:55,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:55,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645024218] [2022-11-22 00:09:55,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645024218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:55,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:55,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:09:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873007679] [2022-11-22 00:09:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:55,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:09:55,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:09:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:09:55,033 INFO L87 Difference]: Start difference. First operand 507 states and 1334 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-22 00:09:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:55,215 INFO L93 Difference]: Finished difference Result 482 states and 1284 transitions. [2022-11-22 00:09:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:09:55,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-11-22 00:09:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:55,217 INFO L225 Difference]: With dead ends: 482 [2022-11-22 00:09:55,217 INFO L226 Difference]: Without dead ends: 185 [2022-11-22 00:09:55,217 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-22 00:09:55,218 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 101 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:55,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 15 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:09:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-22 00:09:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-22 00:09:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.4184782608695654) internal successors, (445), 184 states have internal predecessors, (445), 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-22 00:09:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 445 transitions. [2022-11-22 00:09:55,224 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 445 transitions. Word has length 22 [2022-11-22 00:09:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:55,224 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 445 transitions. [2022-11-22 00:09:55,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-22 00:09:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 445 transitions. [2022-11-22 00:09:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 00:09:55,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:55,225 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-22 00:09:55,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:09:55,226 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1752861719, now seen corresponding path program 1 times [2022-11-22 00:09:55,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:55,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405056650] [2022-11-22 00:09:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:09:56,531 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-22 00:09:56,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:09:56,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405056650] [2022-11-22 00:09:56,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405056650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:09:56,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:09:56,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:09:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24946475] [2022-11-22 00:09:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:09:56,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:09:56,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:09:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:09:56,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:09:56,535 INFO L87 Difference]: Start difference. First operand 185 states and 445 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-22 00:09:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:09:56,736 INFO L93 Difference]: Finished difference Result 219 states and 519 transitions. [2022-11-22 00:09:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:09:56,736 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-22 00:09:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:09:56,737 INFO L225 Difference]: With dead ends: 219 [2022-11-22 00:09:56,737 INFO L226 Difference]: Without dead ends: 137 [2022-11-22 00:09:56,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:09:56,738 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 57 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:09:56,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:09:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-22 00:09:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-11-22 00:09:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.1838235294117645) internal successors, (297), 136 states have internal predecessors, (297), 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-22 00:09:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 297 transitions. [2022-11-22 00:09:56,743 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 297 transitions. Word has length 25 [2022-11-22 00:09:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:09:56,743 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 297 transitions. [2022-11-22 00:09:56,743 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-22 00:09:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 297 transitions. [2022-11-22 00:09:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 00:09:56,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:09:56,744 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-22 00:09:56,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:09:56,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 00:09:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:09:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash -934002231, now seen corresponding path program 2 times [2022-11-22 00:09:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:09:56,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222093304] [2022-11-22 00:09:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:09:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:09:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:09:56,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:09:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:09:56,934 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 00:09:56,935 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:09:56,936 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-22 00:09:56,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-22 00:09:56,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-22 00:09:56,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-22 00:09:56,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-22 00:09:56,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-22 00:09:56,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-22 00:09:56,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:09:56,941 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:09:56,947 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:09:56,947 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:09:57,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:09:57 BasicIcfg [2022-11-22 00:09:57,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:09:57,065 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:09:57,065 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:09:57,065 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:09:57,066 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:09:43" (3/4) ... [2022-11-22 00:09:57,068 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 00:09:57,155 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:09:57,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:09:57,156 INFO L158 Benchmark]: Toolchain (without parser) took 15256.40ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 150.8MB in the beginning and 225.7MB in the end (delta: -74.9MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-11-22 00:09:57,156 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:09:57,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 733.80ms. Allocated memory is still 178.3MB. Free memory was 150.8MB in the beginning and 126.9MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-22 00:09:57,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.14ms. Allocated memory is still 178.3MB. Free memory was 126.9MB in the beginning and 123.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:09:57,157 INFO L158 Benchmark]: Boogie Preprocessor took 98.89ms. Allocated memory is still 178.3MB. Free memory was 123.6MB in the beginning and 148.0MB in the end (delta: -24.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:09:57,158 INFO L158 Benchmark]: RCFGBuilder took 1023.47ms. Allocated memory is still 178.3MB. Free memory was 148.0MB in the beginning and 110.3MB in the end (delta: 37.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-22 00:09:57,159 INFO L158 Benchmark]: TraceAbstraction took 13211.46ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 109.4MB in the beginning and 242.5MB in the end (delta: -133.1MB). Peak memory consumption was 155.5MB. Max. memory is 16.1GB. [2022-11-22 00:09:57,159 INFO L158 Benchmark]: Witness Printer took 90.94ms. Allocated memory is still 310.4MB. Free memory was 242.5MB in the beginning and 225.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-22 00:09:57,163 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.28ms. Allocated memory is still 121.6MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 733.80ms. Allocated memory is still 178.3MB. Free memory was 150.8MB in the beginning and 126.9MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.14ms. Allocated memory is still 178.3MB. Free memory was 126.9MB in the beginning and 123.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.89ms. Allocated memory is still 178.3MB. Free memory was 123.6MB in the beginning and 148.0MB in the end (delta: -24.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1023.47ms. Allocated memory is still 178.3MB. Free memory was 148.0MB in the beginning and 110.3MB in the end (delta: 37.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13211.46ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 109.4MB in the beginning and 242.5MB in the end (delta: -133.1MB). Peak memory consumption was 155.5MB. Max. memory is 16.1GB. * Witness Printer took 90.94ms. Allocated memory is still 310.4MB. Free memory was 242.5MB in the beginning and 225.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 147 PlacesBefore, 44 PlacesAfterwards, 136 TransitionsBefore, 32 TransitionsAfterwards, 2934 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 7181 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3708, independent: 3517, independent conditional: 0, independent unconditional: 3517, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2175, independent: 2114, independent conditional: 0, independent unconditional: 2114, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2175, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 434, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 374, dependent conditional: 0, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3708, independent: 1403, independent conditional: 0, independent unconditional: 1403, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 2175, unknown conditional: 0, unknown unconditional: 2175] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-3, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-2, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=-1, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 869]: 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: 873]: 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: 867]: 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: 871]: 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, 170 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 939 IncrementalHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 53 mSDtfsCounter, 939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 159 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-22 00:09:57,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e430af0b-fa95-41b8-9ced-82323a22d16c/bin/utaipan-g80aRyZoba/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