./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca --- 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-6b4ec56 [2022-11-20 11:24:37,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:24:37,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:24:37,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:24:37,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:24:37,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:24:37,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:24:37,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:24:37,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:24:37,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:24:37,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:24:37,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:24:37,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:24:37,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:24:37,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:24:37,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:24:37,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:24:37,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:24:37,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:24:37,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:24:37,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:24:37,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:24:37,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:24:37,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:24:37,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:24:37,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:24:37,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:24:37,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:24:37,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:24:37,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:24:37,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:24:37,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:24:37,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:24:37,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:24:37,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:24:37,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:24:37,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:24:37,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:24:37,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:24:37,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:24:37,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:24:37,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:24:37,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:24:37,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:24:37,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:24:37,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:24:37,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:24:37,279 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:24:37,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:24:37,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:24:37,280 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:24:37,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:24:37,280 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:24:37,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:24:37,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:24:37,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:24:37,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:24:37,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:24:37,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:24:37,282 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:24:37,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:24:37,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:24:37,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:24:37,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:24:37,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:24:37,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:24:37,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:24:37,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:24:37,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:24:37,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:24:37,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:24:37,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:24:37,284 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:24:37,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:24:37,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:24:37,285 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_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/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_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN 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 -> Automizer 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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca [2022-11-20 11:24:37,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:24:37,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:24:37,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:24:37,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:24:37,595 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:24:37,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 11:24:40,847 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:24:41,139 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:24:41,139 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 11:24:41,154 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/data/3bdd7b127/d967d5d491524250b3b60780e80540f2/FLAGe61a6e1fb [2022-11-20 11:24:41,170 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/data/3bdd7b127/d967d5d491524250b3b60780e80540f2 [2022-11-20 11:24:41,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:24:41,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:24:41,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:24:41,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:24:41,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:24:41,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2838a131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41, skipping insertion in model container [2022-11-20 11:24:41,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:24:41,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:24:41,436 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_4a59b968-9df0-4046-a431-6949c4d0b6cc/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-11-20 11:24:41,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:24:41,683 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:24:41,696 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_4a59b968-9df0-4046-a431-6949c4d0b6cc/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-11-20 11:24:41,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:24:41,774 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:24:41,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41 WrapperNode [2022-11-20 11:24:41,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:24:41,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:24:41,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:24:41,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:24:41,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,823 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-11-20 11:24:41,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:24:41,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:24:41,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:24:41,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:24:41,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,853 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:24:41,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:24:41,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:24:41,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:24:41,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (1/1) ... [2022-11-20 11:24:41,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:24:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:24:41,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:24:41,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:24:41,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:24:41,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:24:41,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:24:41,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:24:41,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:24:41,955 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 11:24:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 11:24:41,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 11:24:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 11:24:41,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:24:41,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:24:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:24:41,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:24:41,959 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:24:42,094 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:24:42,096 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:24:42,574 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:24:42,742 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:24:42,743 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:24:42,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:24:42 BoogieIcfgContainer [2022-11-20 11:24:42,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:24:42,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:24:42,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:24:42,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:24:42,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:24:41" (1/3) ... [2022-11-20 11:24:42,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369be1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:24:42, skipping insertion in model container [2022-11-20 11:24:42,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:41" (2/3) ... [2022-11-20 11:24:42,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369be1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:24:42, skipping insertion in model container [2022-11-20 11:24:42,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:24:42" (3/3) ... [2022-11-20 11:24:42,756 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 11:24:42,768 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 11:24:42,784 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:24:42,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 11:24:42,785 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:24:42,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 11:24:42,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-11-20 11:24:42,989 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-11-20 11:24:42,990 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:24:42,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-20 11:24:42,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-11-20 11:24:43,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-11-20 11:24:43,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:24:43,023 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=PETRI_NET, 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;@66bf6ceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:24:43,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-20 11:24:43,043 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-11-20 11:24:43,043 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:24:43,043 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:24:43,044 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:43,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:24:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash 292112710, now seen corresponding path program 1 times [2022-11-20 11:24:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:43,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875243746] [2022-11-20 11:24:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:43,667 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-20 11:24:43,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:43,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875243746] [2022-11-20 11:24:43,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875243746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:43,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:43,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:24:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332184537] [2022-11-20 11:24:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:43,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:24:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:43,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:24:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:24:43,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2022-11-20 11:24:43,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-20 11:24:43,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:24:43,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2022-11-20 11:24:43,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:24:43,864 INFO L130 PetriNetUnfolder]: 18/149 cut-off events. [2022-11-20 11:24:43,866 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 11:24:43,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 149 events. 18/149 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 360 event pairs, 2 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 153. Up to 31 conditions per place. [2022-11-20 11:24:43,871 INFO L137 encePairwiseOnDemand]: 91/96 looper letters, 10 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-11-20 11:24:43,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 221 flow [2022-11-20 11:24:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:24:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:24:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2022-11-20 11:24:43,894 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9340277777777778 [2022-11-20 11:24:43,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2022-11-20 11:24:43,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2022-11-20 11:24:43,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:24:43,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2022-11-20 11:24:43,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-20 11:24:43,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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-20 11:24:43,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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-20 11:24:43,919 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 194 flow. Second operand 3 states and 269 transitions. [2022-11-20 11:24:43,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 221 flow [2022-11-20 11:24:43,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:24:43,926 INFO L231 Difference]: Finished difference. Result has 97 places, 90 transitions, 188 flow [2022-11-20 11:24:43,929 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2022-11-20 11:24:43,932 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, -2 predicate places. [2022-11-20 11:24:43,933 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 188 flow [2022-11-20 11:24:43,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-20 11:24:43,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:24:43,934 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:43,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:24:43,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:24:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1232796649, now seen corresponding path program 1 times [2022-11-20 11:24:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592932420] [2022-11-20 11:24:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:44,421 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-20 11:24:44,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:44,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592932420] [2022-11-20 11:24:44,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592932420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:44,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:44,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:24:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264703189] [2022-11-20 11:24:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:44,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:24:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:44,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:24:44,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:24:44,433 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2022-11-20 11:24:44,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 90 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 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-20 11:24:44,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:24:44,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2022-11-20 11:24:44,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:24:45,178 INFO L130 PetriNetUnfolder]: 443/1425 cut-off events. [2022-11-20 11:24:45,179 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-11-20 11:24:45,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2290 conditions, 1425 events. 443/1425 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10269 event pairs, 86 based on Foata normal form. 0/1371 useless extension candidates. Maximal degree in co-relation 2239. Up to 315 conditions per place. [2022-11-20 11:24:45,193 INFO L137 encePairwiseOnDemand]: 85/96 looper letters, 23 selfloop transitions, 7 changer transitions 59/150 dead transitions. [2022-11-20 11:24:45,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 150 transitions, 482 flow [2022-11-20 11:24:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:24:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 11:24:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2022-11-20 11:24:45,199 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2022-11-20 11:24:45,199 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 730 transitions. [2022-11-20 11:24:45,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 730 transitions. [2022-11-20 11:24:45,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:24:45,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 730 transitions. [2022-11-20 11:24:45,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.11111111111111) internal successors, (730), 9 states have internal predecessors, (730), 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-20 11:24:45,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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-20 11:24:45,208 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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-20 11:24:45,209 INFO L175 Difference]: Start difference. First operand has 97 places, 90 transitions, 188 flow. Second operand 9 states and 730 transitions. [2022-11-20 11:24:45,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 150 transitions, 482 flow [2022-11-20 11:24:45,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 150 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:24:45,216 INFO L231 Difference]: Finished difference. Result has 111 places, 83 transitions, 236 flow [2022-11-20 11:24:45,217 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=111, PETRI_TRANSITIONS=83} [2022-11-20 11:24:45,218 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 12 predicate places. [2022-11-20 11:24:45,218 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 83 transitions, 236 flow [2022-11-20 11:24:45,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 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-20 11:24:45,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:24:45,219 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:45,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:24:45,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:24:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 775754408, now seen corresponding path program 1 times [2022-11-20 11:24:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:45,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86275999] [2022-11-20 11:24:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:45,568 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-20 11:24:45,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:45,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86275999] [2022-11-20 11:24:45,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86275999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:45,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:45,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:24:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44704136] [2022-11-20 11:24:45,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:45,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:24:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:45,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:24:45,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:24:45,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 96 [2022-11-20 11:24:45,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 83 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-20 11:24:45,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:24:45,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 96 [2022-11-20 11:24:45,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:24:45,953 INFO L130 PetriNetUnfolder]: 239/631 cut-off events. [2022-11-20 11:24:45,953 INFO L131 PetriNetUnfolder]: For 723/750 co-relation queries the response was YES. [2022-11-20 11:24:45,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 631 events. 239/631 cut-off events. For 723/750 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3370 event pairs, 65 based on Foata normal form. 39/646 useless extension candidates. Maximal degree in co-relation 1599. Up to 240 conditions per place. [2022-11-20 11:24:45,959 INFO L137 encePairwiseOnDemand]: 90/96 looper letters, 17 selfloop transitions, 3 changer transitions 34/120 dead transitions. [2022-11-20 11:24:45,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 508 flow [2022-11-20 11:24:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:24:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 11:24:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 732 transitions. [2022-11-20 11:24:45,963 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2022-11-20 11:24:45,963 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 732 transitions. [2022-11-20 11:24:45,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 732 transitions. [2022-11-20 11:24:45,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:24:45,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 732 transitions. [2022-11-20 11:24:45,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 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-20 11:24:45,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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-20 11:24:45,971 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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-20 11:24:45,972 INFO L175 Difference]: Start difference. First operand has 111 places, 83 transitions, 236 flow. Second operand 9 states and 732 transitions. [2022-11-20 11:24:45,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 508 flow [2022-11-20 11:24:45,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 460 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-11-20 11:24:45,985 INFO L231 Difference]: Finished difference. Result has 108 places, 83 transitions, 237 flow [2022-11-20 11:24:45,985 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=108, PETRI_TRANSITIONS=83} [2022-11-20 11:24:45,988 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 9 predicate places. [2022-11-20 11:24:45,988 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 237 flow [2022-11-20 11:24:45,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-20 11:24:45,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:24:45,989 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:45,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:24:45,990 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:24:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash -286464425, now seen corresponding path program 1 times [2022-11-20 11:24:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:45,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521323978] [2022-11-20 11:24:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:46,257 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-20 11:24:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521323978] [2022-11-20 11:24:46,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521323978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:46,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:46,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:24:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391746652] [2022-11-20 11:24:46,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:46,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:24:46,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:46,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:24:46,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:24:46,266 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2022-11-20 11:24:46,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 83 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 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-20 11:24:46,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:24:46,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2022-11-20 11:24:46,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:24:46,691 INFO L130 PetriNetUnfolder]: 308/838 cut-off events. [2022-11-20 11:24:46,692 INFO L131 PetriNetUnfolder]: For 475/641 co-relation queries the response was YES. [2022-11-20 11:24:46,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 838 events. 308/838 cut-off events. For 475/641 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5032 event pairs, 26 based on Foata normal form. 22/828 useless extension candidates. Maximal degree in co-relation 1711. Up to 157 conditions per place. [2022-11-20 11:24:46,698 INFO L137 encePairwiseOnDemand]: 87/96 looper letters, 28 selfloop transitions, 6 changer transitions 43/142 dead transitions. [2022-11-20 11:24:46,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 142 transitions, 581 flow [2022-11-20 11:24:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:24:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 11:24:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 821 transitions. [2022-11-20 11:24:46,702 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8552083333333333 [2022-11-20 11:24:46,702 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 821 transitions. [2022-11-20 11:24:46,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 821 transitions. [2022-11-20 11:24:46,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:24:46,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 821 transitions. [2022-11-20 11:24:46,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.1) internal successors, (821), 10 states have internal predecessors, (821), 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-20 11:24:46,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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-20 11:24:46,715 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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-20 11:24:46,715 INFO L175 Difference]: Start difference. First operand has 108 places, 83 transitions, 237 flow. Second operand 10 states and 821 transitions. [2022-11-20 11:24:46,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 142 transitions, 581 flow [2022-11-20 11:24:46,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 142 transitions, 553 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-11-20 11:24:46,724 INFO L231 Difference]: Finished difference. Result has 106 places, 86 transitions, 259 flow [2022-11-20 11:24:46,724 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=259, PETRI_PLACES=106, PETRI_TRANSITIONS=86} [2022-11-20 11:24:46,726 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 7 predicate places. [2022-11-20 11:24:46,726 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 259 flow [2022-11-20 11:24:46,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 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-20 11:24:46,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:24:46,729 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:46,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:24:46,730 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:24:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash -803898522, now seen corresponding path program 1 times [2022-11-20 11:24:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:46,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956597051] [2022-11-20 11:24:46,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:47,105 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-20 11:24:47,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:47,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956597051] [2022-11-20 11:24:47,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956597051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:47,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:47,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:24:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093970612] [2022-11-20 11:24:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:47,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:24:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:47,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:24:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:24:47,111 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2022-11-20 11:24:47,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 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-20 11:24:47,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:24:47,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2022-11-20 11:24:47,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:24:47,417 INFO L130 PetriNetUnfolder]: 104/416 cut-off events. [2022-11-20 11:24:47,418 INFO L131 PetriNetUnfolder]: For 391/407 co-relation queries the response was YES. [2022-11-20 11:24:47,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 416 events. 104/416 cut-off events. For 391/407 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2176 event pairs, 28 based on Foata normal form. 23/432 useless extension candidates. Maximal degree in co-relation 1016. Up to 70 conditions per place. [2022-11-20 11:24:47,420 INFO L137 encePairwiseOnDemand]: 87/96 looper letters, 21 selfloop transitions, 9 changer transitions 20/115 dead transitions. [2022-11-20 11:24:47,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 115 transitions, 496 flow [2022-11-20 11:24:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:24:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 11:24:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 873 transitions. [2022-11-20 11:24:47,429 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8267045454545454 [2022-11-20 11:24:47,429 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 873 transitions. [2022-11-20 11:24:47,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 873 transitions. [2022-11-20 11:24:47,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:24:47,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 873 transitions. [2022-11-20 11:24:47,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 79.36363636363636) internal successors, (873), 11 states have internal predecessors, (873), 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-20 11:24:47,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 96.0) internal successors, (1152), 12 states have internal predecessors, (1152), 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-20 11:24:47,436 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 96.0) internal successors, (1152), 12 states have internal predecessors, (1152), 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-20 11:24:47,436 INFO L175 Difference]: Start difference. First operand has 106 places, 86 transitions, 259 flow. Second operand 11 states and 873 transitions. [2022-11-20 11:24:47,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 115 transitions, 496 flow [2022-11-20 11:24:47,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 115 transitions, 433 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-11-20 11:24:47,444 INFO L231 Difference]: Finished difference. Result has 111 places, 89 transitions, 290 flow [2022-11-20 11:24:47,444 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=290, PETRI_PLACES=111, PETRI_TRANSITIONS=89} [2022-11-20 11:24:47,447 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 12 predicate places. [2022-11-20 11:24:47,447 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 89 transitions, 290 flow [2022-11-20 11:24:47,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 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-20 11:24:47,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:24:47,450 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:47,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:24:47,450 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:24:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1543325171, now seen corresponding path program 1 times [2022-11-20 11:24:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:47,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8018332] [2022-11-20 11:24:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:47,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:24:48,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:48,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8018332] [2022-11-20 11:24:48,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8018332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:48,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:48,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:24:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424066518] [2022-11-20 11:24:48,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:48,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:24:48,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:48,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:24:48,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:24:48,200 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 96 [2022-11-20 11:24:48,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 89 transitions, 290 flow. Second operand has 8 states, 8 states have (on average 75.25) internal successors, (602), 8 states have internal predecessors, (602), 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-20 11:24:48,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:24:48,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 96 [2022-11-20 11:24:48,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:24:48,448 INFO L130 PetriNetUnfolder]: 22/350 cut-off events. [2022-11-20 11:24:48,448 INFO L131 PetriNetUnfolder]: For 432/439 co-relation queries the response was YES. [2022-11-20 11:24:48,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 350 events. 22/350 cut-off events. For 432/439 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2175 event pairs, 1 based on Foata normal form. 3/339 useless extension candidates. Maximal degree in co-relation 758. Up to 68 conditions per place. [2022-11-20 11:24:48,451 INFO L137 encePairwiseOnDemand]: 87/96 looper letters, 17 selfloop transitions, 4 changer transitions 13/104 dead transitions. [2022-11-20 11:24:48,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 400 flow [2022-11-20 11:24:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:24:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 11:24:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 690 transitions. [2022-11-20 11:24:48,453 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2022-11-20 11:24:48,454 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 690 transitions. [2022-11-20 11:24:48,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 690 transitions. [2022-11-20 11:24:48,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:24:48,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 690 transitions. [2022-11-20 11:24:48,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.66666666666667) internal successors, (690), 9 states have internal predecessors, (690), 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-20 11:24:48,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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-20 11:24:48,459 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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-20 11:24:48,459 INFO L175 Difference]: Start difference. First operand has 111 places, 89 transitions, 290 flow. Second operand 9 states and 690 transitions. [2022-11-20 11:24:48,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 400 flow [2022-11-20 11:24:48,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 373 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-11-20 11:24:48,465 INFO L231 Difference]: Finished difference. Result has 116 places, 90 transitions, 296 flow [2022-11-20 11:24:48,465 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=116, PETRI_TRANSITIONS=90} [2022-11-20 11:24:48,466 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 17 predicate places. [2022-11-20 11:24:48,466 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 90 transitions, 296 flow [2022-11-20 11:24:48,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.25) internal successors, (602), 8 states have internal predecessors, (602), 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-20 11:24:48,467 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:24:48,467 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:48,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:24:48,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:24:48,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash 147468953, now seen corresponding path program 2 times [2022-11-20 11:24:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:48,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892584881] [2022-11-20 11:24:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:48,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:24:48,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:24:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:24:48,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:24:48,583 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:24:48,584 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-20 11:24:48,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-20 11:24:48,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-20 11:24:48,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-20 11:24:48,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-20 11:24:48,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:24:48,588 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-11-20 11:24:48,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 11:24:48,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:24:48,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:24:48 BasicIcfg [2022-11-20 11:24:48,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:24:48,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:24:48,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:24:48,710 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:24:48,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:24:42" (3/4) ... [2022-11-20 11:24:48,713 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 11:24:48,822 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:24:48,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:24:48,823 INFO L158 Benchmark]: Toolchain (without parser) took 7648.89ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 109.4MB in the beginning and 93.8MB in the end (delta: 15.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2022-11-20 11:24:48,823 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:24:48,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.65ms. Allocated memory is still 157.3MB. Free memory was 108.9MB in the beginning and 86.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 11:24:48,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.86ms. Allocated memory is still 157.3MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:24:48,824 INFO L158 Benchmark]: Boogie Preprocessor took 34.07ms. Allocated memory is still 157.3MB. Free memory was 84.3MB in the beginning and 82.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:24:48,825 INFO L158 Benchmark]: RCFGBuilder took 886.90ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 82.2MB in the beginning and 148.9MB in the end (delta: -66.7MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-11-20 11:24:48,825 INFO L158 Benchmark]: TraceAbstraction took 5960.09ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 148.9MB in the beginning and 109.5MB in the end (delta: 39.3MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2022-11-20 11:24:48,825 INFO L158 Benchmark]: Witness Printer took 112.61ms. Allocated memory is still 234.9MB. Free memory was 109.5MB in the beginning and 93.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 11:24:48,827 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.27ms. Allocated memory is still 104.9MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.65ms. Allocated memory is still 157.3MB. Free memory was 108.9MB in the beginning and 86.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.86ms. Allocated memory is still 157.3MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.07ms. Allocated memory is still 157.3MB. Free memory was 84.3MB in the beginning and 82.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 886.90ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 82.2MB in the beginning and 148.9MB in the end (delta: -66.7MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5960.09ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 148.9MB in the beginning and 109.5MB in the end (delta: 39.3MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Witness Printer took 112.61ms. Allocated memory is still 234.9MB. Free memory was 109.5MB in the beginning and 93.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L723] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 pthread_t t585; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t585, ((void *)0), P0, ((void *)0))=-1, t585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t586; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t586, ((void *)0), P1, ((void *)0))=0, t585={5:0}, t586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$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: 813]: 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: 811]: 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 5 procedures, 115 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 555 IncrementalHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 44 mSDtfsCounter, 555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 1490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-20 11:24:48,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a59b968-9df0-4046-a431-6949c4d0b6cc/bin/uautomizer-ug76WZFUDN/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