./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/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_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/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_8ea58dde-f931-4df9-a641-aec4f323bb77/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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --- 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 21:07:26,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:07:26,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:07:27,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:07:27,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:07:27,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:07:27,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:07:27,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:07:27,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:07:27,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:07:27,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:07:27,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:07:27,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:07:27,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:07:27,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:07:27,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:07:27,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:07:27,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:07:27,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:07:27,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:07:27,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:07:27,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:07:27,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:07:27,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:07:27,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:07:27,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:07:27,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:07:27,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:07:27,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:07:27,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:07:27,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:07:27,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:07:27,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:07:27,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:07:27,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:07:27,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:07:27,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:07:27,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:07:27,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:07:27,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:07:27,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:07:27,065 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 21:07:27,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:07:27,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:07:27,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:07:27,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:07:27,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:07:27,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:07:27,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:07:27,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:07:27,095 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:07:27,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:07:27,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:07:27,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:07:27,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:07:27,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:07:27,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:07:27,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:07:27,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:07:27,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:07:27,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:07:27,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:07:27,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:07:27,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:07:27,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:07:27,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:07:27,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:07:27,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:07:27,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:07:27,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:07:27,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:07:27,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:07:27,101 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:07:27,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:07:27,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:07:27,102 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_8ea58dde-f931-4df9-a641-aec4f323bb77/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_8ea58dde-f931-4df9-a641-aec4f323bb77/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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e [2022-11-18 21:07:27,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:07:27,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:07:27,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:07:27,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:07:27,442 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:07:27,444 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-18 21:07:27,518 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/data/c1b9f5cc5/afcb466b5a854e3c962fbdc94609ebdd/FLAG05ed2aa1a [2022-11-18 21:07:28,250 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:07:28,266 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-18 21:07:28,286 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/data/c1b9f5cc5/afcb466b5a854e3c962fbdc94609ebdd/FLAG05ed2aa1a [2022-11-18 21:07:28,525 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/data/c1b9f5cc5/afcb466b5a854e3c962fbdc94609ebdd [2022-11-18 21:07:28,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:07:28,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:07:28,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:07:28,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:07:28,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:07:28,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:07:28" (1/1) ... [2022-11-18 21:07:28,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece0a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:28, skipping insertion in model container [2022-11-18 21:07:28,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:07:28" (1/1) ... [2022-11-18 21:07:28,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:07:28,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:07:28,854 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_8ea58dde-f931-4df9-a641-aec4f323bb77/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-18 21:07:29,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:07:29,237 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:07:29,256 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_8ea58dde-f931-4df9-a641-aec4f323bb77/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-18 21:07:29,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:07:29,390 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:07:29,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29 WrapperNode [2022-11-18 21:07:29,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:07:29,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:07:29,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:07:29,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:07:29,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,493 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-18 21:07:29,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:07:29,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:07:29,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:07:29,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:07:29,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,564 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:07:29,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:07:29,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:07:29,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:07:29,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (1/1) ... [2022-11-18 21:07:29,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:07:29,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:07:29,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:07:29,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 21:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 21:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 21:07:29,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 21:07:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 21:07:29,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 21:07:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 21:07:29,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 21:07:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:07:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 21:07:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:07:29,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:07:29,692 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 21:07:29,928 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:07:29,938 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:07:30,418 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:07:30,645 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:07:30,646 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 21:07:30,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:07:30 BoogieIcfgContainer [2022-11-18 21:07:30,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:07:30,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:07:30,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:07:30,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:07:30,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:07:28" (1/3) ... [2022-11-18 21:07:30,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed0598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:07:30, skipping insertion in model container [2022-11-18 21:07:30,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:29" (2/3) ... [2022-11-18 21:07:30,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed0598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:07:30, skipping insertion in model container [2022-11-18 21:07:30,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:07:30" (3/3) ... [2022-11-18 21:07:30,663 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-11-18 21:07:30,675 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 21:07:30,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:07:30,688 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 21:07:30,689 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 21:07:30,777 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 21:07:30,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-11-18 21:07:30,942 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-18 21:07:30,943 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:07:30,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-18 21:07:30,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-11-18 21:07:30,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-11-18 21:07:30,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:07:30,987 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;@41487fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:07:30,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 21:07:31,018 INFO L130 PetriNetUnfolder]: 0/61 cut-off events. [2022-11-18 21:07:31,019 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:07:31,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:31,020 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] [2022-11-18 21:07:31,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -652557723, now seen corresponding path program 1 times [2022-11-18 21:07:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:31,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105171938] [2022-11-18 21:07:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:31,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:07:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:31,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105171938] [2022-11-18 21:07:31,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105171938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:31,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:31,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:07:31,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208477947] [2022-11-18 21:07:31,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:31,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:07:31,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:31,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:07:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:07:31,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2022-11-18 21:07:31,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 21:07:31,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:31,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2022-11-18 21:07:31,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:32,210 INFO L130 PetriNetUnfolder]: 57/490 cut-off events. [2022-11-18 21:07:32,210 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-18 21:07:32,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 490 events. 57/490 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2563 event pairs, 31 based on Foata normal form. 16/476 useless extension candidates. Maximal degree in co-relation 561. Up to 75 conditions per place. [2022-11-18 21:07:32,223 INFO L137 encePairwiseOnDemand]: 114/119 looper letters, 13 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-11-18 21:07:32,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 276 flow [2022-11-18 21:07:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:07:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 21:07:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2022-11-18 21:07:32,248 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2022-11-18 21:07:32,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2022-11-18 21:07:32,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2022-11-18 21:07:32,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:32,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2022-11-18 21:07:32,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 21:07:32,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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 21:07:32,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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 21:07:32,276 INFO L175 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 335 transitions. [2022-11-18 21:07:32,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 276 flow [2022-11-18 21:07:32,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 117 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 21:07:32,285 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2022-11-18 21:07:32,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2022-11-18 21:07:32,292 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2022-11-18 21:07:32,292 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2022-11-18 21:07:32,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 21:07:32,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:32,293 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] [2022-11-18 21:07:32,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:07:32,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:32,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:32,295 INFO L85 PathProgramCache]: Analyzing trace with hash 346546837, now seen corresponding path program 1 times [2022-11-18 21:07:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:32,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130368409] [2022-11-18 21:07:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:33,500 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 21:07:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:33,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130368409] [2022-11-18 21:07:33,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130368409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:33,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:33,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:07:33,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172849585] [2022-11-18 21:07:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:33,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:07:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:33,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:07:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:07:33,517 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2022-11-18 21:07:33,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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 21:07:33,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:33,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2022-11-18 21:07:33,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:34,680 INFO L130 PetriNetUnfolder]: 1114/2911 cut-off events. [2022-11-18 21:07:34,680 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-11-18 21:07:34,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 2911 events. 1114/2911 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 22639 event pairs, 186 based on Foata normal form. 0/2834 useless extension candidates. Maximal degree in co-relation 4717. Up to 880 conditions per place. [2022-11-18 21:07:34,704 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 32 selfloop transitions, 2 changer transitions 60/166 dead transitions. [2022-11-18 21:07:34,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 166 transitions, 522 flow [2022-11-18 21:07:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:07:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:07:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 859 transitions. [2022-11-18 21:07:34,710 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020541549953315 [2022-11-18 21:07:34,710 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 859 transitions. [2022-11-18 21:07:34,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 859 transitions. [2022-11-18 21:07:34,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:34,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 859 transitions. [2022-11-18 21:07:34,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 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 21:07:34,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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 21:07:34,721 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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 21:07:34,721 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 9 states and 859 transitions. [2022-11-18 21:07:34,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 166 transitions, 522 flow [2022-11-18 21:07:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 166 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 21:07:34,728 INFO L231 Difference]: Finished difference. Result has 134 places, 100 transitions, 226 flow [2022-11-18 21:07:34,729 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=134, PETRI_TRANSITIONS=100} [2022-11-18 21:07:34,730 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places. [2022-11-18 21:07:34,730 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 100 transitions, 226 flow [2022-11-18 21:07:34,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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 21:07:34,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:34,732 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, 1, 1, 1] [2022-11-18 21:07:34,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:07:34,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:34,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:34,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1731033901, now seen corresponding path program 1 times [2022-11-18 21:07:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:34,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855701449] [2022-11-18 21:07:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:34,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:36,198 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 21:07:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:36,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855701449] [2022-11-18 21:07:36,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855701449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:36,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:36,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 21:07:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422463702] [2022-11-18 21:07:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:36,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 21:07:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:36,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 21:07:36,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-18 21:07:36,205 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2022-11-18 21:07:36,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 100 transitions, 226 flow. Second operand has 12 states, 12 states have (on average 87.75) internal successors, (1053), 12 states have internal predecessors, (1053), 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 21:07:36,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:36,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2022-11-18 21:07:36,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:37,669 INFO L130 PetriNetUnfolder]: 836/1645 cut-off events. [2022-11-18 21:07:37,669 INFO L131 PetriNetUnfolder]: For 422/422 co-relation queries the response was YES. [2022-11-18 21:07:37,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3431 conditions, 1645 events. 836/1645 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9302 event pairs, 229 based on Foata normal form. 40/1620 useless extension candidates. Maximal degree in co-relation 3361. Up to 686 conditions per place. [2022-11-18 21:07:37,682 INFO L137 encePairwiseOnDemand]: 104/119 looper letters, 39 selfloop transitions, 13 changer transitions 65/189 dead transitions. [2022-11-18 21:07:37,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 189 transitions, 700 flow [2022-11-18 21:07:37,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 21:07:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 21:07:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1927 transitions. [2022-11-18 21:07:37,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.771108443377351 [2022-11-18 21:07:37,689 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1927 transitions. [2022-11-18 21:07:37,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1927 transitions. [2022-11-18 21:07:37,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:37,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1927 transitions. [2022-11-18 21:07:37,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 91.76190476190476) internal successors, (1927), 21 states have internal predecessors, (1927), 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 21:07:37,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 119.0) internal successors, (2618), 22 states have internal predecessors, (2618), 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 21:07:37,704 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 119.0) internal successors, (2618), 22 states have internal predecessors, (2618), 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 21:07:37,704 INFO L175 Difference]: Start difference. First operand has 134 places, 100 transitions, 226 flow. Second operand 21 states and 1927 transitions. [2022-11-18 21:07:37,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 189 transitions, 700 flow [2022-11-18 21:07:37,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 189 transitions, 636 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-11-18 21:07:37,724 INFO L231 Difference]: Finished difference. Result has 142 places, 105 transitions, 300 flow [2022-11-18 21:07:37,725 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=300, PETRI_PLACES=142, PETRI_TRANSITIONS=105} [2022-11-18 21:07:37,725 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 18 predicate places. [2022-11-18 21:07:37,726 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 105 transitions, 300 flow [2022-11-18 21:07:37,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.75) internal successors, (1053), 12 states have internal predecessors, (1053), 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 21:07:37,727 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:37,727 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, 1, 1, 1, 1, 1] [2022-11-18 21:07:37,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:07:37,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:37,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1371112013, now seen corresponding path program 1 times [2022-11-18 21:07:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:37,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813598237] [2022-11-18 21:07:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:07:38,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:38,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813598237] [2022-11-18 21:07:38,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813598237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:38,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:38,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 21:07:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399230892] [2022-11-18 21:07:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:38,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 21:07:38,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:38,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 21:07:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:07:38,723 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-11-18 21:07:38,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 105 transitions, 300 flow. Second operand has 9 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 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 21:07:38,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:38,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-11-18 21:07:38,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:39,368 INFO L130 PetriNetUnfolder]: 368/919 cut-off events. [2022-11-18 21:07:39,368 INFO L131 PetriNetUnfolder]: For 1720/1726 co-relation queries the response was YES. [2022-11-18 21:07:39,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2511 conditions, 919 events. 368/919 cut-off events. For 1720/1726 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5373 event pairs, 186 based on Foata normal form. 20/877 useless extension candidates. Maximal degree in co-relation 2434. Up to 424 conditions per place. [2022-11-18 21:07:39,380 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 22 selfloop transitions, 7 changer transitions 28/141 dead transitions. [2022-11-18 21:07:39,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 591 flow [2022-11-18 21:07:39,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 21:07:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 21:07:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1111 transitions. [2022-11-18 21:07:39,385 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8487394957983193 [2022-11-18 21:07:39,386 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1111 transitions. [2022-11-18 21:07:39,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1111 transitions. [2022-11-18 21:07:39,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:39,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1111 transitions. [2022-11-18 21:07:39,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.0) internal successors, (1111), 11 states have internal predecessors, (1111), 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 21:07:39,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 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 21:07:39,402 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 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 21:07:39,402 INFO L175 Difference]: Start difference. First operand has 142 places, 105 transitions, 300 flow. Second operand 11 states and 1111 transitions. [2022-11-18 21:07:39,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 591 flow [2022-11-18 21:07:39,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 141 transitions, 548 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-11-18 21:07:39,413 INFO L231 Difference]: Finished difference. Result has 136 places, 109 transitions, 353 flow [2022-11-18 21:07:39,414 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=353, PETRI_PLACES=136, PETRI_TRANSITIONS=109} [2022-11-18 21:07:39,417 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 12 predicate places. [2022-11-18 21:07:39,418 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 109 transitions, 353 flow [2022-11-18 21:07:39,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 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 21:07:39,419 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:39,419 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, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:39,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 21:07:39,420 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:39,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash 7799443, now seen corresponding path program 1 times [2022-11-18 21:07:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:39,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734233061] [2022-11-18 21:07:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:40,630 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 21:07:40,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:40,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734233061] [2022-11-18 21:07:40,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734233061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:40,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:40,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 21:07:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354996022] [2022-11-18 21:07:40,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:40,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 21:07:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:40,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 21:07:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 21:07:40,635 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2022-11-18 21:07:40,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 109 transitions, 353 flow. Second operand has 10 states, 10 states have (on average 88.2) internal successors, (882), 10 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 21:07:40,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:40,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2022-11-18 21:07:40,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:41,686 INFO L130 PetriNetUnfolder]: 647/1398 cut-off events. [2022-11-18 21:07:41,686 INFO L131 PetriNetUnfolder]: For 4403/4407 co-relation queries the response was YES. [2022-11-18 21:07:41,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 1398 events. 647/1398 cut-off events. For 4403/4407 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8195 event pairs, 188 based on Foata normal form. 31/1384 useless extension candidates. Maximal degree in co-relation 4762. Up to 569 conditions per place. [2022-11-18 21:07:41,701 INFO L137 encePairwiseOnDemand]: 107/119 looper letters, 43 selfloop transitions, 11 changer transitions 43/169 dead transitions. [2022-11-18 21:07:41,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 169 transitions, 922 flow [2022-11-18 21:07:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 21:07:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 21:07:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1119 transitions. [2022-11-18 21:07:41,706 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7836134453781513 [2022-11-18 21:07:41,706 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1119 transitions. [2022-11-18 21:07:41,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1119 transitions. [2022-11-18 21:07:41,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:41,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1119 transitions. [2022-11-18 21:07:41,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.25) internal successors, (1119), 12 states have internal predecessors, (1119), 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 21:07:41,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 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 21:07:41,716 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 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 21:07:41,716 INFO L175 Difference]: Start difference. First operand has 136 places, 109 transitions, 353 flow. Second operand 12 states and 1119 transitions. [2022-11-18 21:07:41,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 169 transitions, 922 flow [2022-11-18 21:07:41,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 169 transitions, 887 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-11-18 21:07:41,726 INFO L231 Difference]: Finished difference. Result has 142 places, 112 transitions, 421 flow [2022-11-18 21:07:41,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=421, PETRI_PLACES=142, PETRI_TRANSITIONS=112} [2022-11-18 21:07:41,730 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 18 predicate places. [2022-11-18 21:07:41,731 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 112 transitions, 421 flow [2022-11-18 21:07:41,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.2) internal successors, (882), 10 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 21:07:41,732 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:41,732 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:41,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 21:07:41,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1822836053, now seen corresponding path program 1 times [2022-11-18 21:07:41,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:41,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69576786] [2022-11-18 21:07:41,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:43,282 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 21:07:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:43,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69576786] [2022-11-18 21:07:43,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69576786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:43,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:43,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 21:07:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108166063] [2022-11-18 21:07:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:43,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 21:07:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 21:07:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:07:43,287 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-11-18 21:07:43,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 112 transitions, 421 flow. Second operand has 13 states, 13 states have (on average 86.84615384615384) internal successors, (1129), 13 states have internal predecessors, (1129), 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 21:07:43,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:43,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-11-18 21:07:43,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:45,136 INFO L130 PetriNetUnfolder]: 628/1516 cut-off events. [2022-11-18 21:07:45,136 INFO L131 PetriNetUnfolder]: For 9551/9554 co-relation queries the response was YES. [2022-11-18 21:07:45,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6472 conditions, 1516 events. 628/1516 cut-off events. For 9551/9554 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9459 event pairs, 124 based on Foata normal form. 27/1475 useless extension candidates. Maximal degree in co-relation 6382. Up to 545 conditions per place. [2022-11-18 21:07:45,161 INFO L137 encePairwiseOnDemand]: 101/119 looper letters, 49 selfloop transitions, 24 changer transitions 53/197 dead transitions. [2022-11-18 21:07:45,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 197 transitions, 1501 flow [2022-11-18 21:07:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 21:07:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 21:07:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1900 transitions. [2022-11-18 21:07:45,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7603041216486595 [2022-11-18 21:07:45,168 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1900 transitions. [2022-11-18 21:07:45,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1900 transitions. [2022-11-18 21:07:45,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:45,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1900 transitions. [2022-11-18 21:07:45,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 90.47619047619048) internal successors, (1900), 21 states have internal predecessors, (1900), 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 21:07:45,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 119.0) internal successors, (2618), 22 states have internal predecessors, (2618), 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 21:07:45,182 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 119.0) internal successors, (2618), 22 states have internal predecessors, (2618), 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 21:07:45,183 INFO L175 Difference]: Start difference. First operand has 142 places, 112 transitions, 421 flow. Second operand 21 states and 1900 transitions. [2022-11-18 21:07:45,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 197 transitions, 1501 flow [2022-11-18 21:07:45,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 197 transitions, 1415 flow, removed 32 selfloop flow, removed 10 redundant places. [2022-11-18 21:07:45,205 INFO L231 Difference]: Finished difference. Result has 158 places, 123 transitions, 623 flow [2022-11-18 21:07:45,206 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=623, PETRI_PLACES=158, PETRI_TRANSITIONS=123} [2022-11-18 21:07:45,207 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 34 predicate places. [2022-11-18 21:07:45,207 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 123 transitions, 623 flow [2022-11-18 21:07:45,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.84615384615384) internal successors, (1129), 13 states have internal predecessors, (1129), 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 21:07:45,208 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:45,208 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:45,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 21:07:45,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1689958824, now seen corresponding path program 1 times [2022-11-18 21:07:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:45,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096384292] [2022-11-18 21:07:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:45,527 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 21:07:45,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:45,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096384292] [2022-11-18 21:07:45,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096384292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:45,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:45,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:07:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821032972] [2022-11-18 21:07:45,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:45,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:07:45,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:45,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:07:45,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:07:45,532 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-18 21:07:45,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 123 transitions, 623 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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 21:07:45,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:45,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-18 21:07:45,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:47,146 INFO L130 PetriNetUnfolder]: 2615/5139 cut-off events. [2022-11-18 21:07:47,146 INFO L131 PetriNetUnfolder]: For 59332/61053 co-relation queries the response was YES. [2022-11-18 21:07:47,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21927 conditions, 5139 events. 2615/5139 cut-off events. For 59332/61053 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 39579 event pairs, 146 based on Foata normal form. 312/5176 useless extension candidates. Maximal degree in co-relation 21837. Up to 1425 conditions per place. [2022-11-18 21:07:47,227 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 90 selfloop transitions, 13 changer transitions 58/252 dead transitions. [2022-11-18 21:07:47,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 252 transitions, 2331 flow [2022-11-18 21:07:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:07:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 21:07:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1032 transitions. [2022-11-18 21:07:47,232 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8672268907563025 [2022-11-18 21:07:47,232 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1032 transitions. [2022-11-18 21:07:47,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1032 transitions. [2022-11-18 21:07:47,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:47,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1032 transitions. [2022-11-18 21:07:47,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.2) internal successors, (1032), 10 states have internal predecessors, (1032), 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 21:07:47,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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 21:07:47,240 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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 21:07:47,240 INFO L175 Difference]: Start difference. First operand has 158 places, 123 transitions, 623 flow. Second operand 10 states and 1032 transitions. [2022-11-18 21:07:47,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 252 transitions, 2331 flow [2022-11-18 21:07:47,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 252 transitions, 2287 flow, removed 9 selfloop flow, removed 13 redundant places. [2022-11-18 21:07:47,290 INFO L231 Difference]: Finished difference. Result has 151 places, 134 transitions, 686 flow [2022-11-18 21:07:47,291 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=686, PETRI_PLACES=151, PETRI_TRANSITIONS=134} [2022-11-18 21:07:47,291 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 27 predicate places. [2022-11-18 21:07:47,292 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 134 transitions, 686 flow [2022-11-18 21:07:47,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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 21:07:47,292 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:47,293 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:47,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 21:07:47,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1294381143, now seen corresponding path program 1 times [2022-11-18 21:07:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:47,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120898636] [2022-11-18 21:07:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:47,615 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 21:07:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:47,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120898636] [2022-11-18 21:07:47,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120898636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:47,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:47,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:07:47,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018207651] [2022-11-18 21:07:47,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:47,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:07:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:07:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:07:47,619 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-18 21:07:47,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 134 transitions, 686 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 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 21:07:47,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:47,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-18 21:07:47,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:49,377 INFO L130 PetriNetUnfolder]: 2079/4275 cut-off events. [2022-11-18 21:07:49,377 INFO L131 PetriNetUnfolder]: For 49450/50449 co-relation queries the response was YES. [2022-11-18 21:07:49,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20709 conditions, 4275 events. 2079/4275 cut-off events. For 49450/50449 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 33657 event pairs, 114 based on Foata normal form. 348/4460 useless extension candidates. Maximal degree in co-relation 20623. Up to 1133 conditions per place. [2022-11-18 21:07:49,439 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 95 selfloop transitions, 24 changer transitions 73/283 dead transitions. [2022-11-18 21:07:49,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 283 transitions, 2874 flow [2022-11-18 21:07:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 21:07:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 21:07:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1340 transitions. [2022-11-18 21:07:49,450 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8661926308985133 [2022-11-18 21:07:49,450 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1340 transitions. [2022-11-18 21:07:49,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1340 transitions. [2022-11-18 21:07:49,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:49,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1340 transitions. [2022-11-18 21:07:49,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 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 21:07:49,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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 21:07:49,465 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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 21:07:49,465 INFO L175 Difference]: Start difference. First operand has 151 places, 134 transitions, 686 flow. Second operand 13 states and 1340 transitions. [2022-11-18 21:07:49,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 283 transitions, 2874 flow [2022-11-18 21:07:49,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 283 transitions, 2872 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 21:07:49,610 INFO L231 Difference]: Finished difference. Result has 168 places, 149 transitions, 888 flow [2022-11-18 21:07:49,610 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=888, PETRI_PLACES=168, PETRI_TRANSITIONS=149} [2022-11-18 21:07:49,613 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 44 predicate places. [2022-11-18 21:07:49,613 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 149 transitions, 888 flow [2022-11-18 21:07:49,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 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 21:07:49,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:49,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:49,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 21:07:49,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -8482688, now seen corresponding path program 1 times [2022-11-18 21:07:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:49,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088602996] [2022-11-18 21:07:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:50,047 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 21:07:50,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:50,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088602996] [2022-11-18 21:07:50,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088602996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:50,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:50,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 21:07:50,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016870827] [2022-11-18 21:07:50,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:50,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:07:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:50,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:07:50,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:07:50,052 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-18 21:07:50,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 149 transitions, 888 flow. Second operand has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 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 21:07:50,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:50,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-18 21:07:50,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:51,461 INFO L130 PetriNetUnfolder]: 1843/3921 cut-off events. [2022-11-18 21:07:51,462 INFO L131 PetriNetUnfolder]: For 51025/52027 co-relation queries the response was YES. [2022-11-18 21:07:51,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20884 conditions, 3921 events. 1843/3921 cut-off events. For 51025/52027 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 32036 event pairs, 107 based on Foata normal form. 303/4061 useless extension candidates. Maximal degree in co-relation 20790. Up to 1093 conditions per place. [2022-11-18 21:07:51,507 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 85 selfloop transitions, 28 changer transitions 67/271 dead transitions. [2022-11-18 21:07:51,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 271 transitions, 2744 flow [2022-11-18 21:07:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 21:07:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 21:07:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1614 transitions. [2022-11-18 21:07:51,513 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8476890756302521 [2022-11-18 21:07:51,514 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1614 transitions. [2022-11-18 21:07:51,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1614 transitions. [2022-11-18 21:07:51,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:51,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1614 transitions. [2022-11-18 21:07:51,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 100.875) internal successors, (1614), 16 states have internal predecessors, (1614), 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 21:07:51,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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 21:07:51,526 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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 21:07:51,526 INFO L175 Difference]: Start difference. First operand has 168 places, 149 transitions, 888 flow. Second operand 16 states and 1614 transitions. [2022-11-18 21:07:51,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 271 transitions, 2744 flow [2022-11-18 21:07:51,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 271 transitions, 2352 flow, removed 177 selfloop flow, removed 9 redundant places. [2022-11-18 21:07:51,679 INFO L231 Difference]: Finished difference. Result has 181 places, 150 transitions, 830 flow [2022-11-18 21:07:51,680 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=830, PETRI_PLACES=181, PETRI_TRANSITIONS=150} [2022-11-18 21:07:51,681 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 57 predicate places. [2022-11-18 21:07:51,681 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 150 transitions, 830 flow [2022-11-18 21:07:51,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 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 21:07:51,682 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:51,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 21:07:51,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1049692059, now seen corresponding path program 1 times [2022-11-18 21:07:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747974147] [2022-11-18 21:07:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:52,676 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 21:07:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:52,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747974147] [2022-11-18 21:07:52,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747974147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:52,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:52,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 21:07:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076602273] [2022-11-18 21:07:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:52,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 21:07:52,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 21:07:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:07:52,688 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 119 [2022-11-18 21:07:52,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 150 transitions, 830 flow. Second operand has 9 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 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 21:07:52,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:52,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 119 [2022-11-18 21:07:52,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:53,729 INFO L130 PetriNetUnfolder]: 471/2555 cut-off events. [2022-11-18 21:07:53,729 INFO L131 PetriNetUnfolder]: For 9292/9553 co-relation queries the response was YES. [2022-11-18 21:07:53,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8811 conditions, 2555 events. 471/2555 cut-off events. For 9292/9553 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 28823 event pairs, 3 based on Foata normal form. 5/2438 useless extension candidates. Maximal degree in co-relation 8712. Up to 321 conditions per place. [2022-11-18 21:07:53,760 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 32 selfloop transitions, 14 changer transitions 53/213 dead transitions. [2022-11-18 21:07:53,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 213 transitions, 1631 flow [2022-11-18 21:07:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:07:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 21:07:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 987 transitions. [2022-11-18 21:07:53,764 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294117647058824 [2022-11-18 21:07:53,764 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 987 transitions. [2022-11-18 21:07:53,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 987 transitions. [2022-11-18 21:07:53,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:53,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 987 transitions. [2022-11-18 21:07:53,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.7) internal successors, (987), 10 states have internal predecessors, (987), 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 21:07:53,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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 21:07:53,771 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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 21:07:53,771 INFO L175 Difference]: Start difference. First operand has 181 places, 150 transitions, 830 flow. Second operand 10 states and 987 transitions. [2022-11-18 21:07:53,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 213 transitions, 1631 flow [2022-11-18 21:07:53,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 213 transitions, 1231 flow, removed 170 selfloop flow, removed 24 redundant places. [2022-11-18 21:07:53,848 INFO L231 Difference]: Finished difference. Result has 171 places, 157 transitions, 842 flow [2022-11-18 21:07:53,849 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=842, PETRI_PLACES=171, PETRI_TRANSITIONS=157} [2022-11-18 21:07:53,850 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 47 predicate places. [2022-11-18 21:07:53,850 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 157 transitions, 842 flow [2022-11-18 21:07:53,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 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 21:07:53,851 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:53,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:53,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 21:07:53,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:53,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 587750523, now seen corresponding path program 2 times [2022-11-18 21:07:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:53,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440078435] [2022-11-18 21:07:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:55,880 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 21:07:55,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:55,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440078435] [2022-11-18 21:07:55,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440078435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:55,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:55,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 21:07:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686737116] [2022-11-18 21:07:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:55,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 21:07:55,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:55,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 21:07:55,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-18 21:07:55,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 119 [2022-11-18 21:07:55,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 157 transitions, 842 flow. Second operand has 14 states, 14 states have (on average 91.71428571428571) internal successors, (1284), 14 states have internal predecessors, (1284), 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 21:07:55,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:55,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 119 [2022-11-18 21:07:55,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:56,571 INFO L130 PetriNetUnfolder]: 263/1706 cut-off events. [2022-11-18 21:07:56,572 INFO L131 PetriNetUnfolder]: For 2704/2732 co-relation queries the response was YES. [2022-11-18 21:07:56,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 1706 events. 263/1706 cut-off events. For 2704/2732 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 18179 event pairs, 1 based on Foata normal form. 8/1650 useless extension candidates. Maximal degree in co-relation 4742. Up to 187 conditions per place. [2022-11-18 21:07:56,593 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 42 selfloop transitions, 14 changer transitions 15/177 dead transitions. [2022-11-18 21:07:56,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 177 transitions, 1146 flow [2022-11-18 21:07:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 21:07:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 21:07:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1031 transitions. [2022-11-18 21:07:56,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.787624140565317 [2022-11-18 21:07:56,599 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1031 transitions. [2022-11-18 21:07:56,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1031 transitions. [2022-11-18 21:07:56,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:56,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1031 transitions. [2022-11-18 21:07:56,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.72727272727273) internal successors, (1031), 11 states have internal predecessors, (1031), 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 21:07:56,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 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 21:07:56,610 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 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 21:07:56,610 INFO L175 Difference]: Start difference. First operand has 171 places, 157 transitions, 842 flow. Second operand 11 states and 1031 transitions. [2022-11-18 21:07:56,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 177 transitions, 1146 flow [2022-11-18 21:07:56,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 177 transitions, 1046 flow, removed 47 selfloop flow, removed 9 redundant places. [2022-11-18 21:07:56,648 INFO L231 Difference]: Finished difference. Result has 171 places, 154 transitions, 805 flow [2022-11-18 21:07:56,648 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=805, PETRI_PLACES=171, PETRI_TRANSITIONS=154} [2022-11-18 21:07:56,649 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 47 predicate places. [2022-11-18 21:07:56,649 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 154 transitions, 805 flow [2022-11-18 21:07:56,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 91.71428571428571) internal successors, (1284), 14 states have internal predecessors, (1284), 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 21:07:56,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:56,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:56,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 21:07:56,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 21:07:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash -464686957, now seen corresponding path program 3 times [2022-11-18 21:07:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:56,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548918297] [2022-11-18 21:07:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:07:56,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:07:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:07:56,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:07:56,931 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:07:56,932 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 21:07:56,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 21:07:56,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 21:07:56,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 21:07:56,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 21:07:56,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 21:07:56,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 21:07:56,937 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:56,945 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 21:07:56,945 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:07:57,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:07:57 BasicIcfg [2022-11-18 21:07:57,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:07:57,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:07:57,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:07:57,126 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:07:57,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:07:30" (3/4) ... [2022-11-18 21:07:57,129 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 21:07:57,295 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 21:07:57,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:07:57,297 INFO L158 Benchmark]: Toolchain (without parser) took 28767.12ms. Allocated memory was 107.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 71.3MB in the beginning and 546.6MB in the end (delta: -475.3MB). Peak memory consumption was 620.0MB. Max. memory is 16.1GB. [2022-11-18 21:07:57,297 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory was 77.5MB in the beginning and 77.5MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:07:57,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 861.29ms. Allocated memory is still 107.0MB. Free memory was 71.0MB in the beginning and 69.5MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 21:07:57,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.08ms. Allocated memory is still 107.0MB. Free memory was 69.5MB in the beginning and 67.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:07:57,299 INFO L158 Benchmark]: Boogie Preprocessor took 74.58ms. Allocated memory is still 107.0MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:07:57,299 INFO L158 Benchmark]: RCFGBuilder took 1079.51ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 64.9MB in the beginning and 91.1MB in the end (delta: -26.2MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2022-11-18 21:07:57,300 INFO L158 Benchmark]: TraceAbstraction took 26473.14ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 90.4MB in the beginning and 570.8MB in the end (delta: -480.3MB). Peak memory consumption was 593.7MB. Max. memory is 16.1GB. [2022-11-18 21:07:57,300 INFO L158 Benchmark]: Witness Printer took 169.62ms. Allocated memory is still 1.2GB. Free memory was 570.8MB in the beginning and 546.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-18 21:07:57,304 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.31ms. Allocated memory is still 107.0MB. Free memory was 77.5MB in the beginning and 77.5MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 861.29ms. Allocated memory is still 107.0MB. Free memory was 71.0MB in the beginning and 69.5MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.08ms. Allocated memory is still 107.0MB. Free memory was 69.5MB in the beginning and 67.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.58ms. Allocated memory is still 107.0MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1079.51ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 64.9MB in the beginning and 91.1MB in the end (delta: -26.2MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26473.14ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 90.4MB in the beginning and 570.8MB in the end (delta: -480.3MB). Peak memory consumption was 593.7MB. Max. memory is 16.1GB. * Witness Printer took 169.62ms. Allocated memory is still 1.2GB. Free memory was 570.8MB in the beginning and 546.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. 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: [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L722] 0 _Bool x$flush_delayed; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0] [L733] 0 int *x$read_delayed_var; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L727] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L725] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L726] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L724] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L717] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L732] 0 _Bool x$read_delayed; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L735] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L734] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L736] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L729] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L739] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L731] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L730] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] 0 pthread_t t1019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-2, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 833]: 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: 835]: 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: 831]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 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: 26.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 892 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 834 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 680 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1664 IncrementalHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 154 mSDtfsCounter, 1664 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=888occurred in iteration=8, InterpolantAutomatonStates: 137, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 995 NumberOfCodeBlocks, 995 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 5595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 21:07:57,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ea58dde-f931-4df9-a641-aec4f323bb77/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