./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW --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 eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e --- 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-4e7fbc6 [2022-11-23 16:12:35,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 16:12:35,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 16:12:35,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 16:12:35,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 16:12:35,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 16:12:35,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 16:12:35,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 16:12:35,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 16:12:35,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 16:12:35,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 16:12:35,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 16:12:35,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 16:12:35,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 16:12:35,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 16:12:35,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 16:12:35,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 16:12:35,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 16:12:35,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 16:12:35,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 16:12:35,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 16:12:35,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 16:12:35,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 16:12:35,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 16:12:35,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 16:12:35,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 16:12:35,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 16:12:35,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 16:12:35,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 16:12:35,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 16:12:35,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 16:12:35,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 16:12:35,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 16:12:35,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 16:12:35,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 16:12:35,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 16:12:35,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 16:12:35,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 16:12:35,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 16:12:35,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 16:12:35,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 16:12:35,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 16:12:35,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 16:12:35,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 16:12:35,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 16:12:35,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 16:12:35,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 16:12:35,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 16:12:35,858 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 16:12:35,858 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 16:12:35,858 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 16:12:35,859 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 16:12:35,859 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 16:12:35,859 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 16:12:35,860 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 16:12:35,860 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 16:12:35,860 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 16:12:35,861 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 16:12:35,861 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 16:12:35,861 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 16:12:35,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 16:12:35,863 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 16:12:35,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 16:12:35,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 16:12:35,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 16:12:35,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 16:12:35,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 16:12:35,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 16:12:35,865 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 16:12:35,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 16:12:35,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 16:12:35,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 16:12:35,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 16:12:35,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 16:12:35,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:12:35,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 16:12:35,867 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 16:12:35,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 16:12:35,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 16:12:35,868 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 16:12:35,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 16:12:35,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 16:12:35,869 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 16:12:35,869 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_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/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_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW 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 -> eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e [2022-11-23 16:12:36,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 16:12:36,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 16:12:36,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 16:12:36,331 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 16:12:36,332 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 16:12:36,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix033.opt.i [2022-11-23 16:12:39,958 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 16:12:40,291 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 16:12:40,292 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/sv-benchmarks/c/pthread-wmm/mix033.opt.i [2022-11-23 16:12:40,345 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/data/0cbe110aa/72e5541c9e7043d798d9011a6608f205/FLAG53104f61c [2022-11-23 16:12:40,409 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/data/0cbe110aa/72e5541c9e7043d798d9011a6608f205 [2022-11-23 16:12:40,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 16:12:40,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 16:12:40,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 16:12:40,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 16:12:40,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 16:12:40,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:12:40" (1/1) ... [2022-11-23 16:12:40,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75642cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:40, skipping insertion in model container [2022-11-23 16:12:40,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:12:40" (1/1) ... [2022-11-23 16:12:40,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 16:12:40,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:12:40,673 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_40ba2f35-c414-4fc4-9afa-6118b47654b3/sv-benchmarks/c/pthread-wmm/mix033.opt.i[944,957] [2022-11-23 16:12:40,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:12:40,972 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 16:12:40,990 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_40ba2f35-c414-4fc4-9afa-6118b47654b3/sv-benchmarks/c/pthread-wmm/mix033.opt.i[944,957] [2022-11-23 16:12:41,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:12:41,114 INFO L208 MainTranslator]: Completed translation [2022-11-23 16:12:41,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41 WrapperNode [2022-11-23 16:12:41,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 16:12:41,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 16:12:41,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 16:12:41,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 16:12:41,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,209 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-11-23 16:12:41,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 16:12:41,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 16:12:41,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 16:12:41,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 16:12:41,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,266 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 16:12:41,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 16:12:41,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 16:12:41,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 16:12:41,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (1/1) ... [2022-11-23 16:12:41,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:12:41,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:12:41,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 16:12:41,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 16:12:41,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 16:12:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 16:12:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 16:12:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 16:12:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 16:12:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 16:12:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 16:12:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 16:12:41,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 16:12:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 16:12:41,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 16:12:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 16:12:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 16:12:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 16:12:41,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 16:12:41,383 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 16:12:41,612 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 16:12:41,614 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 16:12:41,986 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 16:12:42,223 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 16:12:42,231 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 16:12:42,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:12:42 BoogieIcfgContainer [2022-11-23 16:12:42,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 16:12:42,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 16:12:42,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 16:12:42,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 16:12:42,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:12:40" (1/3) ... [2022-11-23 16:12:42,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d628f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:12:42, skipping insertion in model container [2022-11-23 16:12:42,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:12:41" (2/3) ... [2022-11-23 16:12:42,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d628f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:12:42, skipping insertion in model container [2022-11-23 16:12:42,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:12:42" (3/3) ... [2022-11-23 16:12:42,250 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2022-11-23 16:12:42,262 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 16:12:42,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 16:12:42,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 16:12:42,280 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 16:12:42,381 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 16:12:42,441 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 16:12:42,475 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 257 flow [2022-11-23 16:12:42,481 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 257 flow [2022-11-23 16:12:42,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-11-23 16:12:42,604 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-11-23 16:12:42,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 16:12:42,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-23 16:12:42,616 INFO L119 LiptonReduction]: Number of co-enabled transitions 2240 [2022-11-23 16:12:49,446 INFO L134 LiptonReduction]: Checked pairs total: 5371 [2022-11-23 16:12:49,446 INFO L136 LiptonReduction]: Total number of compositions: 109 [2022-11-23 16:12:49,457 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2022-11-23 16:12:49,553 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 650 states, 647 states have (on average 3.1653786707882534) internal successors, (2048), 649 states have internal predecessors, (2048), 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-23 16:12:49,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 16:12:49,585 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;@47b2d996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 16:12:49,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 16:12:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 650 states, 647 states have (on average 3.1653786707882534) internal successors, (2048), 649 states have internal predecessors, (2048), 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-23 16:12:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 16:12:49,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:49,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:49,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:49,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:49,606 INFO L85 PathProgramCache]: Analyzing trace with hash -606475651, now seen corresponding path program 1 times [2022-11-23 16:12:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:49,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945673428] [2022-11-23 16:12:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:49,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:50,206 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-23 16:12:50,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:50,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945673428] [2022-11-23 16:12:50,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945673428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:50,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:50,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:12:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455124651] [2022-11-23 16:12:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:50,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:12:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:50,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:12:50,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:12:50,251 INFO L87 Difference]: Start difference. First operand has 650 states, 647 states have (on average 3.1653786707882534) internal successors, (2048), 649 states have internal predecessors, (2048), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-23 16:12:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:50,414 INFO L93 Difference]: Finished difference Result 550 states and 1673 transitions. [2022-11-23 16:12:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:12:50,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-11-23 16:12:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:50,481 INFO L225 Difference]: With dead ends: 550 [2022-11-23 16:12:50,482 INFO L226 Difference]: Without dead ends: 530 [2022-11-23 16:12:50,483 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-23 16:12:50,490 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:50,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:12:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-23 16:12:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-11-23 16:12:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.0661625708884688) internal successors, (1622), 529 states have internal predecessors, (1622), 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-23 16:12:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2022-11-23 16:12:50,593 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2022-11-23 16:12:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:50,595 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2022-11-23 16:12:50,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-23 16:12:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2022-11-23 16:12:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 16:12:50,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:50,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:50,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 16:12:50,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:50,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1292505672, now seen corresponding path program 1 times [2022-11-23 16:12:50,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:50,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998335513] [2022-11-23 16:12:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:50,909 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-23 16:12:50,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:50,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998335513] [2022-11-23 16:12:50,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998335513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:50,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:50,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:12:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424464019] [2022-11-23 16:12:50,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:50,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:12:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:12:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:12:50,919 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. 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-23 16:12:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:51,038 INFO L93 Difference]: Finished difference Result 762 states and 2212 transitions. [2022-11-23 16:12:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:12:51,039 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-23 16:12:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:51,045 INFO L225 Difference]: With dead ends: 762 [2022-11-23 16:12:51,046 INFO L226 Difference]: Without dead ends: 726 [2022-11-23 16:12:51,046 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-23 16:12:51,048 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:51,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:12:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-11-23 16:12:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 670. [2022-11-23 16:12:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 2.977578475336323) internal successors, (1992), 669 states have internal predecessors, (1992), 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-23 16:12:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1992 transitions. [2022-11-23 16:12:51,090 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1992 transitions. Word has length 9 [2022-11-23 16:12:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:51,091 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 1992 transitions. [2022-11-23 16:12:51,091 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-23 16:12:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1992 transitions. [2022-11-23 16:12:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 16:12:51,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:51,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:51,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 16:12:51,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1450200666, now seen corresponding path program 1 times [2022-11-23 16:12:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:51,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782278560] [2022-11-23 16:12:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:51,301 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-23 16:12:51,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:51,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782278560] [2022-11-23 16:12:51,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782278560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:51,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:51,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:12:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871341560] [2022-11-23 16:12:51,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:51,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:12:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:12:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:12:51,304 INFO L87 Difference]: Start difference. First operand 670 states and 1992 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-23 16:12:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:51,444 INFO L93 Difference]: Finished difference Result 666 states and 1922 transitions. [2022-11-23 16:12:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:12:51,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-11-23 16:12:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:51,451 INFO L225 Difference]: With dead ends: 666 [2022-11-23 16:12:51,452 INFO L226 Difference]: Without dead ends: 666 [2022-11-23 16:12:51,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:12:51,454 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:51,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:12:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-23 16:12:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 566. [2022-11-23 16:12:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 2.9415929203539823) internal successors, (1662), 565 states have internal predecessors, (1662), 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-23 16:12:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1662 transitions. [2022-11-23 16:12:51,502 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1662 transitions. Word has length 10 [2022-11-23 16:12:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:51,505 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 1662 transitions. [2022-11-23 16:12:51,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-23 16:12:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1662 transitions. [2022-11-23 16:12:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 16:12:51,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:51,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:51,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 16:12:51,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:51,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2032695932, now seen corresponding path program 1 times [2022-11-23 16:12:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:51,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505205882] [2022-11-23 16:12:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:51,708 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-23 16:12:51,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:51,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505205882] [2022-11-23 16:12:51,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505205882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:51,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:51,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:12:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672414149] [2022-11-23 16:12:51,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:51,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:12:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:51,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:12:51,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:12:51,712 INFO L87 Difference]: Start difference. First operand 566 states and 1662 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:12:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:51,821 INFO L93 Difference]: Finished difference Result 614 states and 1766 transitions. [2022-11-23 16:12:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:12:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:12:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:51,826 INFO L225 Difference]: With dead ends: 614 [2022-11-23 16:12:51,826 INFO L226 Difference]: Without dead ends: 614 [2022-11-23 16:12:51,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:12:51,834 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:51,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:12:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-11-23 16:12:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 494. [2022-11-23 16:12:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.945233265720081) internal successors, (1452), 493 states have internal predecessors, (1452), 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-23 16:12:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1452 transitions. [2022-11-23 16:12:51,864 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1452 transitions. Word has length 11 [2022-11-23 16:12:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:51,866 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 1452 transitions. [2022-11-23 16:12:51,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:12:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1452 transitions. [2022-11-23 16:12:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 16:12:51,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:51,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:51,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 16:12:51,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:51,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash -789349308, now seen corresponding path program 1 times [2022-11-23 16:12:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:51,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435913253] [2022-11-23 16:12:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:52,204 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-23 16:12:52,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:52,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435913253] [2022-11-23 16:12:52,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435913253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:52,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:52,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:12:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848382584] [2022-11-23 16:12:52,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:52,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:12:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:52,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:12:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:12:52,211 INFO L87 Difference]: Start difference. First operand 494 states and 1452 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-23 16:12:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:52,368 INFO L93 Difference]: Finished difference Result 480 states and 1242 transitions. [2022-11-23 16:12:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:12:52,369 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-23 16:12:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:52,371 INFO L225 Difference]: With dead ends: 480 [2022-11-23 16:12:52,371 INFO L226 Difference]: Without dead ends: 348 [2022-11-23 16:12:52,372 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-23 16:12:52,372 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:52,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:12:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-23 16:12:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2022-11-23 16:12:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 2.5129682997118157) internal successors, (872), 347 states have internal predecessors, (872), 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-23 16:12:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 872 transitions. [2022-11-23 16:12:52,407 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 872 transitions. Word has length 13 [2022-11-23 16:12:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:52,407 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 872 transitions. [2022-11-23 16:12:52,408 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-23 16:12:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 872 transitions. [2022-11-23 16:12:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 16:12:52,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:52,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:52,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 16:12:52,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1200052878, now seen corresponding path program 1 times [2022-11-23 16:12:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:52,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306409568] [2022-11-23 16:12:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:52,826 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-23 16:12:52,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:52,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306409568] [2022-11-23 16:12:52,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306409568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:52,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:52,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:12:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422935969] [2022-11-23 16:12:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:52,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:12:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:52,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:12:52,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:12:52,831 INFO L87 Difference]: Start difference. First operand 348 states and 872 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:53,028 INFO L93 Difference]: Finished difference Result 289 states and 666 transitions. [2022-11-23 16:12:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 16:12:53,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 16:12:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:53,031 INFO L225 Difference]: With dead ends: 289 [2022-11-23 16:12:53,031 INFO L226 Difference]: Without dead ends: 221 [2022-11-23 16:12:53,031 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-23 16:12:53,032 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:53,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 20 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:12:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-23 16:12:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2022-11-23 16:12:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.256880733944954) internal successors, (492), 218 states have internal predecessors, (492), 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-23 16:12:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 492 transitions. [2022-11-23 16:12:53,042 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 492 transitions. Word has length 15 [2022-11-23 16:12:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:53,042 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 492 transitions. [2022-11-23 16:12:53,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 492 transitions. [2022-11-23 16:12:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 16:12:53,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:53,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:53,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 16:12:53,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1339084167, now seen corresponding path program 1 times [2022-11-23 16:12:53,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:53,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537490297] [2022-11-23 16:12:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:53,426 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-23 16:12:53,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:53,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537490297] [2022-11-23 16:12:53,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537490297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:53,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:53,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 16:12:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197572810] [2022-11-23 16:12:53,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:53,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 16:12:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 16:12:53,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 16:12:53,429 INFO L87 Difference]: Start difference. First operand 219 states and 492 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:53,608 INFO L93 Difference]: Finished difference Result 198 states and 449 transitions. [2022-11-23 16:12:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 16:12:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 16:12:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:53,611 INFO L225 Difference]: With dead ends: 198 [2022-11-23 16:12:53,611 INFO L226 Difference]: Without dead ends: 171 [2022-11-23 16:12:53,611 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-23 16:12:53,612 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:53,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 17 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:12:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-23 16:12:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2022-11-23 16:12:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.31875) internal successors, (371), 160 states have internal predecessors, (371), 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-23 16:12:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 371 transitions. [2022-11-23 16:12:53,619 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 371 transitions. Word has length 18 [2022-11-23 16:12:53,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:53,619 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 371 transitions. [2022-11-23 16:12:53,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 371 transitions. [2022-11-23 16:12:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 16:12:53,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:53,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:53,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 16:12:53,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:53,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1937023367, now seen corresponding path program 1 times [2022-11-23 16:12:53,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:53,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458868514] [2022-11-23 16:12:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:53,903 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-23 16:12:53,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:53,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458868514] [2022-11-23 16:12:53,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458868514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:53,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:53,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:12:53,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271092485] [2022-11-23 16:12:53,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:53,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:12:53,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:12:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:12:53,912 INFO L87 Difference]: Start difference. First operand 161 states and 371 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:54,023 INFO L93 Difference]: Finished difference Result 202 states and 453 transitions. [2022-11-23 16:12:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:12:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 16:12:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:54,025 INFO L225 Difference]: With dead ends: 202 [2022-11-23 16:12:54,025 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 16:12:54,026 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-23 16:12:54,026 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:54,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:12:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 16:12:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-23 16:12:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9275362318840579) internal successors, (133), 69 states have internal predecessors, (133), 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-23 16:12:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2022-11-23 16:12:54,030 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 21 [2022-11-23 16:12:54,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:54,031 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2022-11-23 16:12:54,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2022-11-23 16:12:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 16:12:54,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:54,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:54,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 16:12:54,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash 732131353, now seen corresponding path program 2 times [2022-11-23 16:12:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:54,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822147815] [2022-11-23 16:12:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:54,324 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-23 16:12:54,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:54,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822147815] [2022-11-23 16:12:54,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822147815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:54,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:54,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:12:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455652602] [2022-11-23 16:12:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:54,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:12:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:54,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:12:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:12:54,327 INFO L87 Difference]: Start difference. First operand 70 states and 133 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:54,388 INFO L93 Difference]: Finished difference Result 96 states and 181 transitions. [2022-11-23 16:12:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:12:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 16:12:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:54,389 INFO L225 Difference]: With dead ends: 96 [2022-11-23 16:12:54,389 INFO L226 Difference]: Without dead ends: 48 [2022-11-23 16:12:54,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:12:54,391 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:54,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:12:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-23 16:12:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-23 16:12:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 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-23 16:12:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2022-11-23 16:12:54,395 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2022-11-23 16:12:54,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:54,395 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2022-11-23 16:12:54,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2022-11-23 16:12:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 16:12:54,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:54,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:54,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 16:12:54,397 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash -716701903, now seen corresponding path program 3 times [2022-11-23 16:12:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:54,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302011286] [2022-11-23 16:12:54,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:54,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:55,065 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-23 16:12:55,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:55,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302011286] [2022-11-23 16:12:55,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302011286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:12:55,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:12:55,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:12:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617659632] [2022-11-23 16:12:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:12:55,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 16:12:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 16:12:55,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 16:12:55,072 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:55,194 INFO L93 Difference]: Finished difference Result 58 states and 95 transitions. [2022-11-23 16:12:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 16:12:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 16:12:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:55,196 INFO L225 Difference]: With dead ends: 58 [2022-11-23 16:12:55,196 INFO L226 Difference]: Without dead ends: 32 [2022-11-23 16:12:55,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-23 16:12:55,196 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:55,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:12:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-23 16:12:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-23 16:12:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 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-23 16:12:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-11-23 16:12:55,199 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2022-11-23 16:12:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:55,199 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-11-23 16:12:55,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-11-23 16:12:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 16:12:55,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:55,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:55,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 16:12:55,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 16:12:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash -302435313, now seen corresponding path program 4 times [2022-11-23 16:12:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268109797] [2022-11-23 16:12:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 16:12:55,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 16:12:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 16:12:55,351 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 16:12:55,352 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 16:12:55,353 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 16:12:55,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 16:12:55,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 16:12:55,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 16:12:55,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 16:12:55,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 16:12:55,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 16:12:55,359 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:55,366 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 16:12:55,366 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 16:12:55,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:12:55 BasicIcfg [2022-11-23 16:12:55,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 16:12:55,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 16:12:55,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 16:12:55,492 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 16:12:55,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:12:42" (3/4) ... [2022-11-23 16:12:55,495 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 16:12:55,615 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 16:12:55,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 16:12:55,621 INFO L158 Benchmark]: Toolchain (without parser) took 15207.12ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 120.7MB in the beginning and 166.6MB in the end (delta: -45.9MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2022-11-23 16:12:55,622 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 111.1MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 16:12:55,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.35ms. Allocated memory is still 146.8MB. Free memory was 120.4MB in the beginning and 97.9MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 16:12:55,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.85ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 95.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:12:55,623 INFO L158 Benchmark]: Boogie Preprocessor took 60.15ms. Allocated memory is still 146.8MB. Free memory was 95.5MB in the beginning and 93.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:12:55,623 INFO L158 Benchmark]: RCFGBuilder took 962.61ms. Allocated memory is still 146.8MB. Free memory was 93.4MB in the beginning and 112.4MB in the end (delta: -19.0MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-11-23 16:12:55,624 INFO L158 Benchmark]: TraceAbstraction took 13254.11ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 111.5MB in the beginning and 178.1MB in the end (delta: -66.6MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2022-11-23 16:12:55,625 INFO L158 Benchmark]: Witness Printer took 128.98ms. Allocated memory is still 230.7MB. Free memory was 178.1MB in the beginning and 166.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 16:12:55,628 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 111.1MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.35ms. Allocated memory is still 146.8MB. Free memory was 120.4MB in the beginning and 97.9MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.85ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 95.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.15ms. Allocated memory is still 146.8MB. Free memory was 95.5MB in the beginning and 93.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 962.61ms. Allocated memory is still 146.8MB. Free memory was 93.4MB in the beginning and 112.4MB in the end (delta: -19.0MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13254.11ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 111.5MB in the beginning and 178.1MB in the end (delta: -66.6MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. * Witness Printer took 128.98ms. Allocated memory is still 230.7MB. Free memory was 178.1MB in the beginning and 166.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 129 PlacesBefore, 36 PlacesAfterwards, 121 TransitionsBefore, 27 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 5371 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2951, independent: 2776, independent conditional: 0, independent unconditional: 2776, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1652, independent: 1597, independent conditional: 0, independent unconditional: 1597, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1652, independent: 1580, independent conditional: 0, independent unconditional: 1580, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 542, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 502, dependent conditional: 0, dependent unconditional: 502, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2951, independent: 1179, independent conditional: 0, independent unconditional: 1179, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 1652, unknown conditional: 0, unknown unconditional: 1652] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=-3, t876={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t877, ((void *)0), P1, ((void *)0))=-2, t876={5:0}, t877={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t878, ((void *)0), P2, ((void *)0))=-1, t876={5:0}, t877={6:0}, t878={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 [L812] 3 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L815] 3 __unbuffered_p2_EAX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L818] 3 __unbuffered_p2_EBX = b VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L751] 1 b = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L766] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 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 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 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 [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=0, x=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 846]: 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: 848]: 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: 844]: 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 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 636 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 43 mSDtfsCounter, 636 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=2, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 288 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 795 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-23 16:12:55,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40ba2f35-c414-4fc4-9afa-6118b47654b3/bin/utaipan-Q6hlc19bkW/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