./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro --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 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:34:39,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:34:39,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:34:39,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:34:39,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:34:39,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:34:39,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:34:39,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:34:39,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:34:39,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:34:39,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:34:39,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:34:39,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:34:39,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:34:39,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:34:39,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:34:39,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:34:39,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:34:39,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:34:39,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:34:39,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:34:39,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:34:39,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:34:39,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:34:39,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:34:39,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:34:39,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:34:39,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:34:39,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:34:39,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:34:39,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:34:39,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:34:39,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:34:39,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:34:39,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:34:39,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:34:39,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:34:39,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:34:39,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:34:39,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:34:39,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:34:39,207 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:34:39,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:34:39,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:34:39,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:34:39,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:34:39,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:34:39,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:34:39,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:34:39,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:34:39,232 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:34:39,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:34:39,233 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:34:39,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:34:39,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:34:39,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:34:39,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:34:39,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:34:39,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:34:39,235 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:34:39,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:34:39,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:34:39,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:34:39,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:34:39,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:34:39,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:34:39,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:34:39,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:34:39,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:34:39,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:34:39,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:34:39,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:34:39,240 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:34:39,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:34:39,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:34:39,241 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_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/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_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro 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 -> 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f [2022-11-18 19:34:39,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:34:39,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:34:39,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:34:39,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:34:39,551 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:34:39,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-18 19:34:39,627 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/data/e8853a7f1/befffbc0e31643ed99ffbed355ebd424/FLAG8765909f3 [2022-11-18 19:34:40,161 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:34:40,162 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-18 19:34:40,182 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/data/e8853a7f1/befffbc0e31643ed99ffbed355ebd424/FLAG8765909f3 [2022-11-18 19:34:40,457 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/data/e8853a7f1/befffbc0e31643ed99ffbed355ebd424 [2022-11-18 19:34:40,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:34:40,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:34:40,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:34:40,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:34:40,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:34:40,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:34:40" (1/1) ... [2022-11-18 19:34:40,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3416839b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:40, skipping insertion in model container [2022-11-18 19:34:40,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:34:40" (1/1) ... [2022-11-18 19:34:40,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:34:40,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:34:40,827 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-18 19:34:41,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:34:41,050 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:34:41,062 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-18 19:34:41,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:34:41,138 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:34:41,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41 WrapperNode [2022-11-18 19:34:41,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:34:41,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:34:41,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:34:41,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:34:41,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,215 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-11-18 19:34:41,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:34:41,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:34:41,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:34:41,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:34:41,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,240 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:34:41,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:34:41,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:34:41,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:34:41,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (1/1) ... [2022-11-18 19:34:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:34:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:34:41,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:34:41,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:34:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:34:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:34:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:34:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:34:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:34:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:34:41,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:34:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:34:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:34:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:34:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:34:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:34:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:34:41,339 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:34:41,466 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:34:41,468 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:34:41,848 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:34:42,023 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:34:42,023 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:34:42,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:34:42 BoogieIcfgContainer [2022-11-18 19:34:42,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:34:42,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:34:42,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:34:42,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:34:42,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:34:40" (1/3) ... [2022-11-18 19:34:42,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353a7c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:34:42, skipping insertion in model container [2022-11-18 19:34:42,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:34:41" (2/3) ... [2022-11-18 19:34:42,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353a7c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:34:42, skipping insertion in model container [2022-11-18 19:34:42,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:34:42" (3/3) ... [2022-11-18 19:34:42,043 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-18 19:34:42,052 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:34:42,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:34:42,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:34:42,063 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:34:42,143 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:34:42,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-18 19:34:42,231 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-18 19:34:42,231 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:34:42,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-11-18 19:34:42,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-11-18 19:34:42,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-11-18 19:34:42,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:34:42,256 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;@70af35eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:34:42,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-18 19:34:42,281 INFO L130 PetriNetUnfolder]: 0/57 cut-off events. [2022-11-18 19:34:42,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:34:42,285 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:34:42,287 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] [2022-11-18 19:34:42,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:34:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:42,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1524860726, now seen corresponding path program 1 times [2022-11-18 19:34:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:42,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781287389] [2022-11-18 19:34:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:43,050 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-18 19:34:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:34:43,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781287389] [2022-11-18 19:34:43,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781287389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:34:43,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:34:43,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:34:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581222075] [2022-11-18 19:34:43,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:34:43,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:34:43,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:34:43,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:34:43,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2022-11-18 19:34:43,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-18 19:34:43,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:34:43,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2022-11-18 19:34:43,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:34:43,290 INFO L130 PetriNetUnfolder]: 17/220 cut-off events. [2022-11-18 19:34:43,291 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 19:34:43,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 220 events. 17/220 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 699 event pairs, 7 based on Foata normal form. 9/218 useless extension candidates. Maximal degree in co-relation 219. Up to 27 conditions per place. [2022-11-18 19:34:43,296 INFO L137 encePairwiseOnDemand]: 93/98 looper letters, 9 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2022-11-18 19:34:43,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 95 transitions, 218 flow [2022-11-18 19:34:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:34:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:34:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2022-11-18 19:34:43,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9319727891156463 [2022-11-18 19:34:43,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2022-11-18 19:34:43,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2022-11-18 19:34:43,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:34:43,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2022-11-18 19:34:43,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-18 19:34:43,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-18 19:34:43,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-18 19:34:43,348 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 274 transitions. [2022-11-18 19:34:43,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 95 transitions, 218 flow [2022-11-18 19:34:43,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 95 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:34:43,359 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-11-18 19:34:43,361 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-11-18 19:34:43,366 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-11-18 19:34:43,367 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-11-18 19:34:43,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-18 19:34:43,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:34:43,368 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] [2022-11-18 19:34:43,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:34:43,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:34:43,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash 124428, now seen corresponding path program 1 times [2022-11-18 19:34:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:43,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748995780] [2022-11-18 19:34:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:43,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:44,584 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-18 19:34:44,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:34:44,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748995780] [2022-11-18 19:34:44,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748995780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:34:44,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:34:44,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:34:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453003742] [2022-11-18 19:34:44,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:34:44,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:34:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:44,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:34:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:34:44,593 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 98 [2022-11-18 19:34:44,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 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-18 19:34:44,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:34:44,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 98 [2022-11-18 19:34:44,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:34:45,066 INFO L130 PetriNetUnfolder]: 205/664 cut-off events. [2022-11-18 19:34:45,066 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-18 19:34:45,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 664 events. 205/664 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3701 event pairs, 47 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1016. Up to 168 conditions per place. [2022-11-18 19:34:45,074 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 25 selfloop transitions, 2 changer transitions 43/128 dead transitions. [2022-11-18 19:34:45,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 392 flow [2022-11-18 19:34:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:34:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:34:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 684 transitions. [2022-11-18 19:34:45,079 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7755102040816326 [2022-11-18 19:34:45,080 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 684 transitions. [2022-11-18 19:34:45,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 684 transitions. [2022-11-18 19:34:45,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:34:45,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 684 transitions. [2022-11-18 19:34:45,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.0) internal successors, (684), 9 states have internal predecessors, (684), 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-18 19:34:45,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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-18 19:34:45,087 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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-18 19:34:45,087 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 684 transitions. [2022-11-18 19:34:45,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 128 transitions, 392 flow [2022-11-18 19:34:45,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 128 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:34:45,093 INFO L231 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow [2022-11-18 19:34:45,093 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2022-11-18 19:34:45,094 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-11-18 19:34:45,095 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow [2022-11-18 19:34:45,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 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-18 19:34:45,095 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:34:45,096 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] [2022-11-18 19:34:45,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:34:45,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:34:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1400673199, now seen corresponding path program 1 times [2022-11-18 19:34:45,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:45,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494370298] [2022-11-18 19:34:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:46,684 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-18 19:34:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:34:46,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494370298] [2022-11-18 19:34:46,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494370298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:34:46,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:34:46,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 19:34:46,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667704049] [2022-11-18 19:34:46,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:34:46,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 19:34:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:46,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 19:34:46,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:34:46,688 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 98 [2022-11-18 19:34:46,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 13 states, 13 states have (on average 66.6923076923077) internal successors, (867), 13 states have internal predecessors, (867), 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-18 19:34:46,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:34:46,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 98 [2022-11-18 19:34:46,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:34:47,479 INFO L130 PetriNetUnfolder]: 258/618 cut-off events. [2022-11-18 19:34:47,480 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-11-18 19:34:47,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 618 events. 258/618 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2903 event pairs, 52 based on Foata normal form. 16/623 useless extension candidates. Maximal degree in co-relation 1218. Up to 248 conditions per place. [2022-11-18 19:34:47,484 INFO L137 encePairwiseOnDemand]: 85/98 looper letters, 39 selfloop transitions, 13 changer transitions 37/143 dead transitions. [2022-11-18 19:34:47,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 143 transitions, 515 flow [2022-11-18 19:34:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:34:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-18 19:34:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1001 transitions. [2022-11-18 19:34:47,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7295918367346939 [2022-11-18 19:34:47,488 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1001 transitions. [2022-11-18 19:34:47,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1001 transitions. [2022-11-18 19:34:47,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:34:47,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1001 transitions. [2022-11-18 19:34:47,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 71.5) internal successors, (1001), 14 states have internal predecessors, (1001), 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-18 19:34:47,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 98.0) internal successors, (1470), 15 states have internal predecessors, (1470), 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-18 19:34:47,496 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 98.0) internal successors, (1470), 15 states have internal predecessors, (1470), 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-18 19:34:47,496 INFO L175 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 14 states and 1001 transitions. [2022-11-18 19:34:47,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 143 transitions, 515 flow [2022-11-18 19:34:47,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 143 transitions, 481 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-18 19:34:47,503 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 254 flow [2022-11-18 19:34:47,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=254, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2022-11-18 19:34:47,504 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 9 predicate places. [2022-11-18 19:34:47,504 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 254 flow [2022-11-18 19:34:47,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 66.6923076923077) internal successors, (867), 13 states have internal predecessors, (867), 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-18 19:34:47,505 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:34:47,506 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] [2022-11-18 19:34:47,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:34:47,506 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:34:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1641895200, now seen corresponding path program 1 times [2022-11-18 19:34:47,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:47,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194244216] [2022-11-18 19:34:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:47,813 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-18 19:34:47,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:34:47,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194244216] [2022-11-18 19:34:47,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194244216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:34:47,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:34:47,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:34:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851154100] [2022-11-18 19:34:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:34:47,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:34:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:34:47,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:34:47,817 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-11-18 19:34:47,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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-18 19:34:47,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:34:47,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-11-18 19:34:47,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:34:48,097 INFO L130 PetriNetUnfolder]: 145/467 cut-off events. [2022-11-18 19:34:48,097 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2022-11-18 19:34:48,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 467 events. 145/467 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2297 event pairs, 8 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 1041. Up to 86 conditions per place. [2022-11-18 19:34:48,101 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 28 selfloop transitions, 7 changer transitions 45/146 dead transitions. [2022-11-18 19:34:48,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 146 transitions, 664 flow [2022-11-18 19:34:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:34:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:34:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 834 transitions. [2022-11-18 19:34:48,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8510204081632653 [2022-11-18 19:34:48,104 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 834 transitions. [2022-11-18 19:34:48,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 834 transitions. [2022-11-18 19:34:48,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:34:48,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 834 transitions. [2022-11-18 19:34:48,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 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-18 19:34:48,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-18 19:34:48,110 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-18 19:34:48,110 INFO L175 Difference]: Start difference. First operand has 110 places, 90 transitions, 254 flow. Second operand 10 states and 834 transitions. [2022-11-18 19:34:48,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 146 transitions, 664 flow [2022-11-18 19:34:48,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 146 transitions, 656 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-18 19:34:48,115 INFO L231 Difference]: Finished difference. Result has 115 places, 93 transitions, 302 flow [2022-11-18 19:34:48,116 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=100, 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=10, PETRI_FLOW=302, PETRI_PLACES=115, PETRI_TRANSITIONS=93} [2022-11-18 19:34:48,116 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 14 predicate places. [2022-11-18 19:34:48,117 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 93 transitions, 302 flow [2022-11-18 19:34:48,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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-18 19:34:48,117 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:34:48,118 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] [2022-11-18 19:34:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:34:48,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:34:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2098457719, now seen corresponding path program 1 times [2022-11-18 19:34:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:48,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683552884] [2022-11-18 19:34:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:48,443 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-18 19:34:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:34:48,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683552884] [2022-11-18 19:34:48,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683552884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:34:48,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:34:48,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:34:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292078392] [2022-11-18 19:34:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:34:48,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:34:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:34:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:34:48,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-11-18 19:34:48,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 93 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 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-18 19:34:48,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:34:48,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-11-18 19:34:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:34:48,675 INFO L130 PetriNetUnfolder]: 47/246 cut-off events. [2022-11-18 19:34:48,675 INFO L131 PetriNetUnfolder]: For 297/297 co-relation queries the response was YES. [2022-11-18 19:34:48,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 246 events. 47/246 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 890 event pairs, 10 based on Foata normal form. 7/251 useless extension candidates. Maximal degree in co-relation 606. Up to 36 conditions per place. [2022-11-18 19:34:48,677 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 24 selfloop transitions, 10 changer transitions 15/115 dead transitions. [2022-11-18 19:34:48,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 115 transitions, 531 flow [2022-11-18 19:34:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:34:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 19:34:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 892 transitions. [2022-11-18 19:34:48,680 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8274582560296846 [2022-11-18 19:34:48,680 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 892 transitions. [2022-11-18 19:34:48,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 892 transitions. [2022-11-18 19:34:48,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:34:48,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 892 transitions. [2022-11-18 19:34:48,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.0909090909091) internal successors, (892), 11 states have internal predecessors, (892), 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-18 19:34:48,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 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-18 19:34:48,688 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 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-18 19:34:48,688 INFO L175 Difference]: Start difference. First operand has 115 places, 93 transitions, 302 flow. Second operand 11 states and 892 transitions. [2022-11-18 19:34:48,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 115 transitions, 531 flow [2022-11-18 19:34:48,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 115 transitions, 467 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-11-18 19:34:48,697 INFO L231 Difference]: Finished difference. Result has 120 places, 96 transitions, 335 flow [2022-11-18 19:34:48,697 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=335, PETRI_PLACES=120, PETRI_TRANSITIONS=96} [2022-11-18 19:34:48,700 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 19 predicate places. [2022-11-18 19:34:48,700 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 96 transitions, 335 flow [2022-11-18 19:34:48,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 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-18 19:34:48,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:34:48,701 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, 1, 1] [2022-11-18 19:34:48,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:34:48,701 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:34:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -368697522, now seen corresponding path program 1 times [2022-11-18 19:34:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:48,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824575581] [2022-11-18 19:34:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:49,501 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-18 19:34:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:34:49,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824575581] [2022-11-18 19:34:49,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824575581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:34:49,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:34:49,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:34:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551800986] [2022-11-18 19:34:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:34:49,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:34:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:49,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:34:49,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:34:49,504 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 98 [2022-11-18 19:34:49,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 96 transitions, 335 flow. Second operand has 8 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 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-18 19:34:49,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:34:49,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 98 [2022-11-18 19:34:49,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:34:49,740 INFO L130 PetriNetUnfolder]: 24/252 cut-off events. [2022-11-18 19:34:49,740 INFO L131 PetriNetUnfolder]: For 316/318 co-relation queries the response was YES. [2022-11-18 19:34:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 252 events. 24/252 cut-off events. For 316/318 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1061 event pairs, 0 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 575. Up to 40 conditions per place. [2022-11-18 19:34:49,742 INFO L137 encePairwiseOnDemand]: 90/98 looper letters, 26 selfloop transitions, 3 changer transitions 20/111 dead transitions. [2022-11-18 19:34:49,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 111 transitions, 482 flow [2022-11-18 19:34:49,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:34:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:34:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 576 transitions. [2022-11-18 19:34:49,745 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7346938775510204 [2022-11-18 19:34:49,745 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 576 transitions. [2022-11-18 19:34:49,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 576 transitions. [2022-11-18 19:34:49,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:34:49,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 576 transitions. [2022-11-18 19:34:49,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 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-18 19:34:49,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 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-18 19:34:49,749 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 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-18 19:34:49,749 INFO L175 Difference]: Start difference. First operand has 120 places, 96 transitions, 335 flow. Second operand 8 states and 576 transitions. [2022-11-18 19:34:49,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 111 transitions, 482 flow [2022-11-18 19:34:49,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 111 transitions, 452 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-11-18 19:34:49,755 INFO L231 Difference]: Finished difference. Result has 122 places, 90 transitions, 287 flow [2022-11-18 19:34:49,755 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=122, PETRI_TRANSITIONS=90} [2022-11-18 19:34:49,756 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 21 predicate places. [2022-11-18 19:34:49,756 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 90 transitions, 287 flow [2022-11-18 19:34:49,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.25) internal successors, (562), 8 states have internal predecessors, (562), 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-18 19:34:49,757 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:34:49,757 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, 1, 1] [2022-11-18 19:34:49,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:34:49,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:34:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -307529312, now seen corresponding path program 2 times [2022-11-18 19:34:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:34:49,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752667342] [2022-11-18 19:34:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:34:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:34:49,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:34:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:34:49,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:34:49,874 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:34:49,875 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-18 19:34:49,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-18 19:34:49,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-18 19:34:49,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-18 19:34:49,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-18 19:34:49,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:34:49,879 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-11-18 19:34:49,885 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:34:49,886 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:34:50,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:34:50 BasicIcfg [2022-11-18 19:34:50,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:34:50,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:34:50,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:34:50,027 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:34:50,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:34:42" (3/4) ... [2022-11-18 19:34:50,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 19:34:50,159 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:34:50,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:34:50,161 INFO L158 Benchmark]: Toolchain (without parser) took 9699.88ms. Allocated memory was 117.4MB in the beginning and 211.8MB in the end (delta: 94.4MB). Free memory was 78.9MB in the beginning and 165.4MB in the end (delta: -86.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-11-18 19:34:50,161 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:34:50,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.36ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 80.0MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:34:50,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.10ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 77.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:34:50,162 INFO L158 Benchmark]: Boogie Preprocessor took 28.80ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:34:50,162 INFO L158 Benchmark]: RCFGBuilder took 780.16ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 91.2MB in the end (delta: -15.4MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-11-18 19:34:50,163 INFO L158 Benchmark]: TraceAbstraction took 7998.72ms. Allocated memory was 117.4MB in the beginning and 211.8MB in the end (delta: 94.4MB). Free memory was 90.6MB in the beginning and 182.1MB in the end (delta: -91.5MB). Peak memory consumption was 125.6MB. Max. memory is 16.1GB. [2022-11-18 19:34:50,163 INFO L158 Benchmark]: Witness Printer took 132.68ms. Allocated memory is still 211.8MB. Free memory was 182.1MB in the beginning and 165.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 19:34:50,165 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.36ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 80.0MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.10ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 77.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.80ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 780.16ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 91.2MB in the end (delta: -15.4MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7998.72ms. Allocated memory was 117.4MB in the beginning and 211.8MB in the end (delta: 94.4MB). Free memory was 90.6MB in the beginning and 182.1MB in the end (delta: -91.5MB). Peak memory consumption was 125.6MB. Max. memory is 16.1GB. * Witness Printer took 132.68ms. Allocated memory is still 211.8MB. Free memory was 182.1MB in the beginning and 165.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L735] 0 _Bool weak$$choice0; VAL [weak$$choice0=0] [L736] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0] [L729] 0 int y$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L731] 0 int y$w_buff1; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L723] 0 _Bool y$r_buff0_thd2; VAL [weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L720] 0 int y$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 int __unbuffered_p1_EBX = 0; 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=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, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=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, weak$$choice0=0, weak$$choice2=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$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] [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, weak$$choice0=0, weak$$choice2=0, x=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$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] [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, weak$$choice0=0, weak$$choice2=0, x=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$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] [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, 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$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] [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, 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_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 int z = 0; 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_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, z=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, 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, z=0] [L802] 0 pthread_t t1603; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1603={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, z=0] [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((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(&t1603, ((void *)0), P0, ((void *)0))=-1, t1603={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, z=0] [L804] 0 pthread_t t1604; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, t1604={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, z=0] [L805] FCALL, FORK 0 pthread_create(&t1604, ((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(&t1604, ((void *)0), P1, ((void *)0))=0, t1603={5:0}, t1604={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, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_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=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 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=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 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) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 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 [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 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=1, __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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 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) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 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 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 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=1, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 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) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=53, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: 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, 118 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: 7.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 284 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 641 IncrementalHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 83 mSDtfsCounter, 641 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=5, InterpolantAutomatonStates: 55, 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.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 1882 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-18 19:34:50,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ffaa937-6323-47b0-9b72-a338bb850e6a/bin/uautomizer-TMbwUNV5ro/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