./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:33:02,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:33:02,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:33:02,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:33:02,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:33:02,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:33:02,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:33:02,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:33:02,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:33:02,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:33:02,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:33:02,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:33:02,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:33:02,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:33:02,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:33:02,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:33:02,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:33:02,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:33:02,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:33:02,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:33:02,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:33:02,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:33:02,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:33:02,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:33:02,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:33:02,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:33:02,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:33:02,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:33:02,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:33:02,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:33:02,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:33:02,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:33:02,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:33:02,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:33:02,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:33:02,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:33:02,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:33:02,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:33:02,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:33:02,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:33:02,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:33:02,215 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:33:02,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:33:02,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:33:02,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:33:02,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:33:02,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:33:02,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:33:02,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:33:02,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:33:02,248 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:33:02,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:33:02,248 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:33:02,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:33:02,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:33:02,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:33:02,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:33:02,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:33:02,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:33:02,258 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:33:02,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:33:02,259 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:33:02,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:33:02,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:33:02,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:33:02,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:33:02,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:33:02,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:33:02,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:33:02,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:33:02,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:33:02,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:33:02,262 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:33:02,262 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:33:02,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:33:02,265 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_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2022-11-20 09:33:02,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:33:02,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:33:02,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:33:02,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:33:02,695 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:33:02,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 09:33:06,422 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:33:06,792 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:33:06,792 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 09:33:06,808 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/data/ef80cd512/db60c8eafe9b4ea4a720b32302828dd3/FLAGb2c6d893b [2022-11-20 09:33:06,827 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/data/ef80cd512/db60c8eafe9b4ea4a720b32302828dd3 [2022-11-20 09:33:06,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:33:06,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:33:06,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:33:06,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:33:06,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:33:06,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:33:06" (1/1) ... [2022-11-20 09:33:06,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abd0a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:06, skipping insertion in model container [2022-11-20 09:33:06,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:33:06" (1/1) ... [2022-11-20 09:33:06,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:33:06,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:33:07,179 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-20 09:33:07,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:33:07,529 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:33:07,551 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-20 09:33:07,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:33:07,680 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:33:07,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07 WrapperNode [2022-11-20 09:33:07,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:33:07,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:33:07,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:33:07,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:33:07,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,806 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-11-20 09:33:07,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:33:07,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:33:07,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:33:07,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:33:07,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,859 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:33:07,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:33:07,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:33:07,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:33:07,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (1/1) ... [2022-11-20 09:33:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:33:07,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:07,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:33:07,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:33:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:33:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:33:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:33:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:33:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:33:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:33:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:33:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:33:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:33:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:33:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:33:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:33:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:33:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:33:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:33:08,010 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:33:08,241 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:33:08,244 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:33:08,731 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:33:08,973 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:33:08,974 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:33:08,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:08 BoogieIcfgContainer [2022-11-20 09:33:08,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:33:08,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:33:08,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:33:08,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:33:08,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:33:06" (1/3) ... [2022-11-20 09:33:08,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba65130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:33:08, skipping insertion in model container [2022-11-20 09:33:08,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:07" (2/3) ... [2022-11-20 09:33:08,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba65130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:33:08, skipping insertion in model container [2022-11-20 09:33:08,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:08" (3/3) ... [2022-11-20 09:33:08,999 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 09:33:09,012 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 09:33:09,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:33:09,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 09:33:09,027 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:33:09,136 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:33:09,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-11-20 09:33:09,312 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-11-20 09:33:09,312 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:33:09,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-20 09:33:09,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-11-20 09:33:09,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-11-20 09:33:09,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:33:09,359 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;@f097efe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:33:09,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 09:33:09,374 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-11-20 09:33:09,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:33:09,375 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:09,376 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] [2022-11-20 09:33:09,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1190841751, now seen corresponding path program 1 times [2022-11-20 09:33:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:09,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10370484] [2022-11-20 09:33:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10370484] [2022-11-20 09:33:10,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10370484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:10,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:10,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:10,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618599656] [2022-11-20 09:33:10,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:10,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:10,332 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2022-11-20 09:33:10,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:10,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:10,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2022-11-20 09:33:10,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:10,650 INFO L130 PetriNetUnfolder]: 58/484 cut-off events. [2022-11-20 09:33:10,650 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-20 09:33:10,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 484 events. 58/484 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2490 event pairs, 44 based on Foata normal form. 15/466 useless extension candidates. Maximal degree in co-relation 563. Up to 79 conditions per place. [2022-11-20 09:33:10,664 INFO L137 encePairwiseOnDemand]: 107/112 looper letters, 14 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-11-20 09:33:10,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 269 flow [2022-11-20 09:33:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-11-20 09:33:10,692 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9375 [2022-11-20 09:33:10,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2022-11-20 09:33:10,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2022-11-20 09:33:10,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:10,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2022-11-20 09:33:10,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:10,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:10,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:10,723 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 315 transitions. [2022-11-20 09:33:10,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 269 flow [2022-11-20 09:33:10,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 09:33:10,738 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2022-11-20 09:33:10,741 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2022-11-20 09:33:10,751 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-11-20 09:33:10,752 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2022-11-20 09:33:10,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:10,753 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:10,754 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:10,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:33:10,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1559390399, now seen corresponding path program 1 times [2022-11-20 09:33:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:10,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275221153] [2022-11-20 09:33:10,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:10,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:13,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275221153] [2022-11-20 09:33:13,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275221153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:13,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:13,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:33:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857589428] [2022-11-20 09:33:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:33:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:33:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:33:13,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 112 [2022-11-20 09:33:13,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 82.71428571428571) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:13,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 112 [2022-11-20 09:33:13,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:15,213 INFO L130 PetriNetUnfolder]: 1430/3648 cut-off events. [2022-11-20 09:33:15,213 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-11-20 09:33:15,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5986 conditions, 3648 events. 1430/3648 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 28735 event pairs, 283 based on Foata normal form. 0/3535 useless extension candidates. Maximal degree in co-relation 5928. Up to 1072 conditions per place. [2022-11-20 09:33:15,236 INFO L137 encePairwiseOnDemand]: 99/112 looper letters, 38 selfloop transitions, 11 changer transitions 87/202 dead transitions. [2022-11-20 09:33:15,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 202 transitions, 686 flow [2022-11-20 09:33:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:33:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 09:33:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1168 transitions. [2022-11-20 09:33:15,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2022-11-20 09:33:15,241 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1168 transitions. [2022-11-20 09:33:15,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1168 transitions. [2022-11-20 09:33:15,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:15,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1168 transitions. [2022-11-20 09:33:15,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.84615384615384) internal successors, (1168), 13 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:15,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:15,253 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:15,253 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 13 states and 1168 transitions. [2022-11-20 09:33:15,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 202 transitions, 686 flow [2022-11-20 09:33:15,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 202 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:15,259 INFO L231 Difference]: Finished difference. Result has 135 places, 101 transitions, 301 flow [2022-11-20 09:33:15,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=301, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2022-11-20 09:33:15,260 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2022-11-20 09:33:15,261 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 301 flow [2022-11-20 09:33:15,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.71428571428571) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:15,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:15,262 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] [2022-11-20 09:33:15,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:33:15,263 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash -219638210, now seen corresponding path program 1 times [2022-11-20 09:33:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:15,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335319233] [2022-11-20 09:33:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:16,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:16,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335319233] [2022-11-20 09:33:16,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335319233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:16,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:16,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:33:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518402321] [2022-11-20 09:33:16,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:16,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:33:16,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:16,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:33:16,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:33:16,655 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 112 [2022-11-20 09:33:16,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 101 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:16,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:16,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 112 [2022-11-20 09:33:16,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:18,009 INFO L130 PetriNetUnfolder]: 943/1737 cut-off events. [2022-11-20 09:33:18,010 INFO L131 PetriNetUnfolder]: For 4324/6376 co-relation queries the response was YES. [2022-11-20 09:33:18,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 1737 events. 943/1737 cut-off events. For 4324/6376 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9360 event pairs, 154 based on Foata normal form. 50/1721 useless extension candidates. Maximal degree in co-relation 6334. Up to 733 conditions per place. [2022-11-20 09:33:18,028 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 42 selfloop transitions, 10 changer transitions 70/188 dead transitions. [2022-11-20 09:33:18,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 188 transitions, 1047 flow [2022-11-20 09:33:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:33:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 09:33:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1147 transitions. [2022-11-20 09:33:18,035 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7877747252747253 [2022-11-20 09:33:18,035 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1147 transitions. [2022-11-20 09:33:18,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1147 transitions. [2022-11-20 09:33:18,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:18,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1147 transitions. [2022-11-20 09:33:18,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.23076923076923) internal successors, (1147), 13 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:18,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:18,049 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:18,050 INFO L175 Difference]: Start difference. First operand has 135 places, 101 transitions, 301 flow. Second operand 13 states and 1147 transitions. [2022-11-20 09:33:18,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 188 transitions, 1047 flow [2022-11-20 09:33:18,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 188 transitions, 999 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-20 09:33:18,083 INFO L231 Difference]: Finished difference. Result has 132 places, 107 transitions, 410 flow [2022-11-20 09:33:18,083 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=410, PETRI_PLACES=132, PETRI_TRANSITIONS=107} [2022-11-20 09:33:18,086 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2022-11-20 09:33:18,087 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 107 transitions, 410 flow [2022-11-20 09:33:18,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:18,088 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:18,088 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-20 09:33:18,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:33:18,090 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:18,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 369055775, now seen corresponding path program 1 times [2022-11-20 09:33:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:18,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472882842] [2022-11-20 09:33:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:18,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:20,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472882842] [2022-11-20 09:33:20,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472882842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:20,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:20,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 09:33:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231053455] [2022-11-20 09:33:20,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:20,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 09:33:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:33:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:33:20,180 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112 [2022-11-20 09:33:20,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 107 transitions, 410 flow. Second operand has 10 states, 10 states have (on average 84.8) internal successors, (848), 10 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:20,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:20,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112 [2022-11-20 09:33:20,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:21,343 INFO L130 PetriNetUnfolder]: 819/1618 cut-off events. [2022-11-20 09:33:21,343 INFO L131 PetriNetUnfolder]: For 5778/8160 co-relation queries the response was YES. [2022-11-20 09:33:21,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 1618 events. 819/1618 cut-off events. For 5778/8160 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8666 event pairs, 175 based on Foata normal form. 31/1573 useless extension candidates. Maximal degree in co-relation 6436. Up to 849 conditions per place. [2022-11-20 09:33:21,362 INFO L137 encePairwiseOnDemand]: 97/112 looper letters, 52 selfloop transitions, 22 changer transitions 74/217 dead transitions. [2022-11-20 09:33:21,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 217 transitions, 1511 flow [2022-11-20 09:33:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 09:33:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 09:33:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1690 transitions. [2022-11-20 09:33:21,369 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7941729323308271 [2022-11-20 09:33:21,370 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1690 transitions. [2022-11-20 09:33:21,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1690 transitions. [2022-11-20 09:33:21,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:21,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1690 transitions. [2022-11-20 09:33:21,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 88.94736842105263) internal successors, (1690), 19 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:21,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 112.0) internal successors, (2240), 20 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:21,391 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 112.0) internal successors, (2240), 20 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:21,391 INFO L175 Difference]: Start difference. First operand has 132 places, 107 transitions, 410 flow. Second operand 19 states and 1690 transitions. [2022-11-20 09:33:21,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 217 transitions, 1511 flow [2022-11-20 09:33:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 217 transitions, 1439 flow, removed 33 selfloop flow, removed 4 redundant places. [2022-11-20 09:33:21,427 INFO L231 Difference]: Finished difference. Result has 152 places, 125 transitions, 675 flow [2022-11-20 09:33:21,428 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=675, PETRI_PLACES=152, PETRI_TRANSITIONS=125} [2022-11-20 09:33:21,429 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 35 predicate places. [2022-11-20 09:33:21,432 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 125 transitions, 675 flow [2022-11-20 09:33:21,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 84.8) internal successors, (848), 10 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:21,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:21,433 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:21,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:33:21,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash 187813404, now seen corresponding path program 1 times [2022-11-20 09:33:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:21,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159156119] [2022-11-20 09:33:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:23,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159156119] [2022-11-20 09:33:23,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159156119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:23,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:23,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 09:33:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215106170] [2022-11-20 09:33:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:23,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 09:33:23,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:23,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:33:23,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:33:23,444 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112 [2022-11-20 09:33:23,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 125 transitions, 675 flow. Second operand has 10 states, 10 states have (on average 84.9) internal successors, (849), 10 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:23,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:23,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112 [2022-11-20 09:33:23,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:24,786 INFO L130 PetriNetUnfolder]: 876/1709 cut-off events. [2022-11-20 09:33:24,787 INFO L131 PetriNetUnfolder]: For 18098/29269 co-relation queries the response was YES. [2022-11-20 09:33:24,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10041 conditions, 1709 events. 876/1709 cut-off events. For 18098/29269 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9485 event pairs, 139 based on Foata normal form. 58/1696 useless extension candidates. Maximal degree in co-relation 9948. Up to 756 conditions per place. [2022-11-20 09:33:24,813 INFO L137 encePairwiseOnDemand]: 98/112 looper letters, 78 selfloop transitions, 39 changer transitions 118/304 dead transitions. [2022-11-20 09:33:24,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 304 transitions, 3277 flow [2022-11-20 09:33:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 09:33:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 09:33:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1885 transitions. [2022-11-20 09:33:24,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8014455782312925 [2022-11-20 09:33:24,821 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1885 transitions. [2022-11-20 09:33:24,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1885 transitions. [2022-11-20 09:33:24,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:24,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1885 transitions. [2022-11-20 09:33:24,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 89.76190476190476) internal successors, (1885), 21 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:24,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 112.0) internal successors, (2464), 22 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:24,838 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 112.0) internal successors, (2464), 22 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:24,838 INFO L175 Difference]: Start difference. First operand has 152 places, 125 transitions, 675 flow. Second operand 21 states and 1885 transitions. [2022-11-20 09:33:24,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 304 transitions, 3277 flow [2022-11-20 09:33:24,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 304 transitions, 2957 flow, removed 158 selfloop flow, removed 17 redundant places. [2022-11-20 09:33:24,885 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 1141 flow [2022-11-20 09:33:24,886 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1141, PETRI_PLACES=159, PETRI_TRANSITIONS=154} [2022-11-20 09:33:24,889 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 42 predicate places. [2022-11-20 09:33:24,889 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 1141 flow [2022-11-20 09:33:24,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 84.9) internal successors, (849), 10 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:24,890 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:24,891 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:24,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:33:24,891 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1952884516, now seen corresponding path program 1 times [2022-11-20 09:33:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:24,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176441694] [2022-11-20 09:33:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:26,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176441694] [2022-11-20 09:33:26,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176441694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:26,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:26,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:33:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779921934] [2022-11-20 09:33:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:26,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:33:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:33:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:33:26,215 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 112 [2022-11-20 09:33:26,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 1141 flow. Second operand has 8 states, 8 states have (on average 82.75) internal successors, (662), 8 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:26,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:26,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 112 [2022-11-20 09:33:26,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:27,079 INFO L130 PetriNetUnfolder]: 850/1708 cut-off events. [2022-11-20 09:33:27,080 INFO L131 PetriNetUnfolder]: For 17742/43822 co-relation queries the response was YES. [2022-11-20 09:33:27,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10677 conditions, 1708 events. 850/1708 cut-off events. For 17742/43822 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9763 event pairs, 68 based on Foata normal form. 42/1647 useless extension candidates. Maximal degree in co-relation 10577. Up to 740 conditions per place. [2022-11-20 09:33:27,105 INFO L137 encePairwiseOnDemand]: 99/112 looper letters, 84 selfloop transitions, 23 changer transitions 87/260 dead transitions. [2022-11-20 09:33:27,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 260 transitions, 2859 flow [2022-11-20 09:33:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:33:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:33:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 719 transitions. [2022-11-20 09:33:27,109 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8024553571428571 [2022-11-20 09:33:27,109 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 719 transitions. [2022-11-20 09:33:27,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 719 transitions. [2022-11-20 09:33:27,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:27,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 719 transitions. [2022-11-20 09:33:27,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:27,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:27,115 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:27,116 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 1141 flow. Second operand 8 states and 719 transitions. [2022-11-20 09:33:27,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 260 transitions, 2859 flow [2022-11-20 09:33:27,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 260 transitions, 2617 flow, removed 118 selfloop flow, removed 9 redundant places. [2022-11-20 09:33:27,170 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 1028 flow [2022-11-20 09:33:27,171 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1028, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2022-11-20 09:33:27,174 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2022-11-20 09:33:27,174 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 1028 flow [2022-11-20 09:33:27,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.75) internal successors, (662), 8 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:27,175 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:27,176 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] [2022-11-20 09:33:27,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:33:27,176 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1591349189, now seen corresponding path program 1 times [2022-11-20 09:33:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:27,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723945403] [2022-11-20 09:33:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:28,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723945403] [2022-11-20 09:33:28,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723945403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:28,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:28,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:33:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921174676] [2022-11-20 09:33:28,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:28,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:33:28,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:28,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:33:28,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:33:28,617 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 112 [2022-11-20 09:33:28,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 1028 flow. Second operand has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:28,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:28,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 112 [2022-11-20 09:33:28,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:29,559 INFO L130 PetriNetUnfolder]: 570/1330 cut-off events. [2022-11-20 09:33:29,559 INFO L131 PetriNetUnfolder]: For 12660/21201 co-relation queries the response was YES. [2022-11-20 09:33:29,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7773 conditions, 1330 events. 570/1330 cut-off events. For 12660/21201 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7775 event pairs, 127 based on Foata normal form. 27/1284 useless extension candidates. Maximal degree in co-relation 7674. Up to 542 conditions per place. [2022-11-20 09:33:29,578 INFO L137 encePairwiseOnDemand]: 104/112 looper letters, 74 selfloop transitions, 6 changer transitions 62/208 dead transitions. [2022-11-20 09:33:29,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 208 transitions, 2085 flow [2022-11-20 09:33:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:33:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 09:33:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 876 transitions. [2022-11-20 09:33:29,582 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7821428571428571 [2022-11-20 09:33:29,582 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 876 transitions. [2022-11-20 09:33:29,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 876 transitions. [2022-11-20 09:33:29,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:29,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 876 transitions. [2022-11-20 09:33:29,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.6) internal successors, (876), 10 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:29,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:29,589 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:29,589 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 1028 flow. Second operand 10 states and 876 transitions. [2022-11-20 09:33:29,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 208 transitions, 2085 flow [2022-11-20 09:33:29,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 208 transitions, 1986 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-11-20 09:33:29,620 INFO L231 Difference]: Finished difference. Result has 154 places, 127 transitions, 728 flow [2022-11-20 09:33:29,621 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=154, PETRI_TRANSITIONS=127} [2022-11-20 09:33:29,621 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-11-20 09:33:29,622 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 127 transitions, 728 flow [2022-11-20 09:33:29,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:29,623 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:29,623 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] [2022-11-20 09:33:29,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:33:29,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1829773791, now seen corresponding path program 1 times [2022-11-20 09:33:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:29,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816924506] [2022-11-20 09:33:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:30,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816924506] [2022-11-20 09:33:30,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816924506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:30,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:30,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 09:33:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63949534] [2022-11-20 09:33:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:30,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 09:33:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:30,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 09:33:30,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:33:30,971 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2022-11-20 09:33:30,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 127 transitions, 728 flow. Second operand has 13 states, 13 states have (on average 87.38461538461539) internal successors, (1136), 13 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:30,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2022-11-20 09:33:30,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:31,840 INFO L130 PetriNetUnfolder]: 336/883 cut-off events. [2022-11-20 09:33:31,840 INFO L131 PetriNetUnfolder]: For 9287/11914 co-relation queries the response was YES. [2022-11-20 09:33:31,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 883 events. 336/883 cut-off events. For 9287/11914 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4926 event pairs, 105 based on Foata normal form. 82/923 useless extension candidates. Maximal degree in co-relation 4889. Up to 427 conditions per place. [2022-11-20 09:33:31,863 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 48 selfloop transitions, 11 changer transitions 34/169 dead transitions. [2022-11-20 09:33:31,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 169 transitions, 1491 flow [2022-11-20 09:33:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:33:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 09:33:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1261 transitions. [2022-11-20 09:33:31,870 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8042091836734694 [2022-11-20 09:33:31,870 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1261 transitions. [2022-11-20 09:33:31,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1261 transitions. [2022-11-20 09:33:31,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:31,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1261 transitions. [2022-11-20 09:33:31,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.07142857142857) internal successors, (1261), 14 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,882 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,882 INFO L175 Difference]: Start difference. First operand has 154 places, 127 transitions, 728 flow. Second operand 14 states and 1261 transitions. [2022-11-20 09:33:31,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 169 transitions, 1491 flow [2022-11-20 09:33:31,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 169 transitions, 1419 flow, removed 24 selfloop flow, removed 12 redundant places. [2022-11-20 09:33:31,907 INFO L231 Difference]: Finished difference. Result has 156 places, 127 transitions, 729 flow [2022-11-20 09:33:31,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=729, PETRI_PLACES=156, PETRI_TRANSITIONS=127} [2022-11-20 09:33:31,911 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2022-11-20 09:33:31,912 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 127 transitions, 729 flow [2022-11-20 09:33:31,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.38461538461539) internal successors, (1136), 13 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,913 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:31,913 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] [2022-11-20 09:33:31,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:33:31,914 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash -862248232, now seen corresponding path program 1 times [2022-11-20 09:33:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:31,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437278971] [2022-11-20 09:33:31,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:33,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:33,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437278971] [2022-11-20 09:33:33,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437278971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:33,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:33,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 09:33:33,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749937934] [2022-11-20 09:33:33,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:33,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 09:33:33,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:33,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 09:33:33,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:33:33,222 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2022-11-20 09:33:33,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 127 transitions, 729 flow. Second operand has 13 states, 13 states have (on average 86.46153846153847) internal successors, (1124), 13 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:33,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:33,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2022-11-20 09:33:33,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:33,948 INFO L130 PetriNetUnfolder]: 330/924 cut-off events. [2022-11-20 09:33:33,948 INFO L131 PetriNetUnfolder]: For 8313/10140 co-relation queries the response was YES. [2022-11-20 09:33:33,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4959 conditions, 924 events. 330/924 cut-off events. For 8313/10140 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5298 event pairs, 114 based on Foata normal form. 64/939 useless extension candidates. Maximal degree in co-relation 4860. Up to 414 conditions per place. [2022-11-20 09:33:33,981 INFO L137 encePairwiseOnDemand]: 99/112 looper letters, 45 selfloop transitions, 16 changer transitions 32/168 dead transitions. [2022-11-20 09:33:33,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 168 transitions, 1408 flow [2022-11-20 09:33:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:33:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 09:33:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1248 transitions. [2022-11-20 09:33:33,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2022-11-20 09:33:33,987 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1248 transitions. [2022-11-20 09:33:33,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1248 transitions. [2022-11-20 09:33:33,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:33,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1248 transitions. [2022-11-20 09:33:33,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.14285714285714) internal successors, (1248), 14 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:34,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:34,001 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:34,001 INFO L175 Difference]: Start difference. First operand has 156 places, 127 transitions, 729 flow. Second operand 14 states and 1248 transitions. [2022-11-20 09:33:34,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 168 transitions, 1408 flow [2022-11-20 09:33:34,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 168 transitions, 1362 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-11-20 09:33:34,021 INFO L231 Difference]: Finished difference. Result has 158 places, 129 transitions, 804 flow [2022-11-20 09:33:34,022 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=804, PETRI_PLACES=158, PETRI_TRANSITIONS=129} [2022-11-20 09:33:34,023 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2022-11-20 09:33:34,023 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 129 transitions, 804 flow [2022-11-20 09:33:34,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.46153846153847) internal successors, (1124), 13 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:34,025 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:34,025 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] [2022-11-20 09:33:34,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:33:34,025 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash 820470522, now seen corresponding path program 2 times [2022-11-20 09:33:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:34,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444966346] [2022-11-20 09:33:34,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:36,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:36,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444966346] [2022-11-20 09:33:36,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444966346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:36,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:36,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 09:33:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892090012] [2022-11-20 09:33:36,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:36,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:33:36,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:36,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:33:36,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:33:36,746 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112 [2022-11-20 09:33:36,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 129 transitions, 804 flow. Second operand has 14 states, 14 states have (on average 80.71428571428571) internal successors, (1130), 14 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:36,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:36,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112 [2022-11-20 09:33:36,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:38,181 INFO L130 PetriNetUnfolder]: 383/1028 cut-off events. [2022-11-20 09:33:38,181 INFO L131 PetriNetUnfolder]: For 11094/14155 co-relation queries the response was YES. [2022-11-20 09:33:38,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5908 conditions, 1028 events. 383/1028 cut-off events. For 11094/14155 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5937 event pairs, 75 based on Foata normal form. 25/1002 useless extension candidates. Maximal degree in co-relation 5805. Up to 458 conditions per place. [2022-11-20 09:33:38,201 INFO L137 encePairwiseOnDemand]: 91/112 looper letters, 47 selfloop transitions, 45 changer transitions 40/197 dead transitions. [2022-11-20 09:33:38,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 197 transitions, 1905 flow [2022-11-20 09:33:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:33:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 09:33:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1365 transitions. [2022-11-20 09:33:38,208 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.76171875 [2022-11-20 09:33:38,208 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1365 transitions. [2022-11-20 09:33:38,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1365 transitions. [2022-11-20 09:33:38,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:38,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1365 transitions. [2022-11-20 09:33:38,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.3125) internal successors, (1365), 16 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:38,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:38,223 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:38,224 INFO L175 Difference]: Start difference. First operand has 158 places, 129 transitions, 804 flow. Second operand 16 states and 1365 transitions. [2022-11-20 09:33:38,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 197 transitions, 1905 flow [2022-11-20 09:33:38,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 197 transitions, 1847 flow, removed 16 selfloop flow, removed 9 redundant places. [2022-11-20 09:33:38,254 INFO L231 Difference]: Finished difference. Result has 167 places, 142 transitions, 1086 flow [2022-11-20 09:33:38,255 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1086, PETRI_PLACES=167, PETRI_TRANSITIONS=142} [2022-11-20 09:33:38,256 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 50 predicate places. [2022-11-20 09:33:38,258 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 142 transitions, 1086 flow [2022-11-20 09:33:38,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 80.71428571428571) internal successors, (1130), 14 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:38,259 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:38,259 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] [2022-11-20 09:33:38,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:33:38,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash -353357614, now seen corresponding path program 3 times [2022-11-20 09:33:38,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:38,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825639974] [2022-11-20 09:33:38,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:38,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825639974] [2022-11-20 09:33:39,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825639974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:39,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:39,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 09:33:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651734346] [2022-11-20 09:33:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:39,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 09:33:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 09:33:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:33:39,390 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2022-11-20 09:33:39,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 142 transitions, 1086 flow. Second operand has 13 states, 13 states have (on average 86.46153846153847) internal successors, (1124), 13 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:39,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:39,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2022-11-20 09:33:39,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:40,032 INFO L130 PetriNetUnfolder]: 308/878 cut-off events. [2022-11-20 09:33:40,033 INFO L131 PetriNetUnfolder]: For 13444/17029 co-relation queries the response was YES. [2022-11-20 09:33:40,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5656 conditions, 878 events. 308/878 cut-off events. For 13444/17029 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4942 event pairs, 98 based on Foata normal form. 58/882 useless extension candidates. Maximal degree in co-relation 5545. Up to 406 conditions per place. [2022-11-20 09:33:40,049 INFO L137 encePairwiseOnDemand]: 98/112 looper letters, 44 selfloop transitions, 23 changer transitions 30/177 dead transitions. [2022-11-20 09:33:40,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 177 transitions, 1916 flow [2022-11-20 09:33:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 09:33:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 09:33:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1333 transitions. [2022-11-20 09:33:40,053 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7934523809523809 [2022-11-20 09:33:40,053 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1333 transitions. [2022-11-20 09:33:40,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1333 transitions. [2022-11-20 09:33:40,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:40,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1333 transitions. [2022-11-20 09:33:40,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.86666666666666) internal successors, (1333), 15 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:40,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:40,063 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:40,063 INFO L175 Difference]: Start difference. First operand has 167 places, 142 transitions, 1086 flow. Second operand 15 states and 1333 transitions. [2022-11-20 09:33:40,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 177 transitions, 1916 flow [2022-11-20 09:33:40,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 177 transitions, 1729 flow, removed 79 selfloop flow, removed 15 redundant places. [2022-11-20 09:33:40,103 INFO L231 Difference]: Finished difference. Result has 167 places, 142 transitions, 1087 flow [2022-11-20 09:33:40,104 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1087, PETRI_PLACES=167, PETRI_TRANSITIONS=142} [2022-11-20 09:33:40,105 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 50 predicate places. [2022-11-20 09:33:40,105 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 142 transitions, 1087 flow [2022-11-20 09:33:40,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.46153846153847) internal successors, (1124), 13 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:40,106 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:40,107 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-20 09:33:40,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:33:40,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash -99209526, now seen corresponding path program 1 times [2022-11-20 09:33:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:40,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90980780] [2022-11-20 09:33:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:40,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:41,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:41,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90980780] [2022-11-20 09:33:41,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90980780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:41,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:41,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:33:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650992077] [2022-11-20 09:33:41,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:41,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:33:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:41,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:33:41,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:33:41,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 112 [2022-11-20 09:33:41,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 142 transitions, 1087 flow. Second operand has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:41,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 112 [2022-11-20 09:33:41,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:41,935 INFO L130 PetriNetUnfolder]: 380/1018 cut-off events. [2022-11-20 09:33:41,935 INFO L131 PetriNetUnfolder]: For 13392/20524 co-relation queries the response was YES. [2022-11-20 09:33:41,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6584 conditions, 1018 events. 380/1018 cut-off events. For 13392/20524 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5942 event pairs, 99 based on Foata normal form. 22/982 useless extension candidates. Maximal degree in co-relation 6472. Up to 417 conditions per place. [2022-11-20 09:33:41,949 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 77 selfloop transitions, 8 changer transitions 51/202 dead transitions. [2022-11-20 09:33:41,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 202 transitions, 2296 flow [2022-11-20 09:33:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:33:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:33:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 787 transitions. [2022-11-20 09:33:41,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7807539682539683 [2022-11-20 09:33:41,952 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 787 transitions. [2022-11-20 09:33:41,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 787 transitions. [2022-11-20 09:33:41,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:41,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 787 transitions. [2022-11-20 09:33:41,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.44444444444444) internal successors, (787), 9 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,959 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,959 INFO L175 Difference]: Start difference. First operand has 167 places, 142 transitions, 1087 flow. Second operand 9 states and 787 transitions. [2022-11-20 09:33:41,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 202 transitions, 2296 flow [2022-11-20 09:33:42,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 202 transitions, 2166 flow, removed 43 selfloop flow, removed 13 redundant places. [2022-11-20 09:33:42,005 INFO L231 Difference]: Finished difference. Result has 161 places, 140 transitions, 1035 flow [2022-11-20 09:33:42,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1035, PETRI_PLACES=161, PETRI_TRANSITIONS=140} [2022-11-20 09:33:42,006 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 44 predicate places. [2022-11-20 09:33:42,006 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 140 transitions, 1035 flow [2022-11-20 09:33:42,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:42,008 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:42,008 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-20 09:33:42,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:33:42,008 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 410349158, now seen corresponding path program 2 times [2022-11-20 09:33:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:42,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581136507] [2022-11-20 09:33:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:42,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:42,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581136507] [2022-11-20 09:33:42,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581136507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:42,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:42,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:33:42,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135162398] [2022-11-20 09:33:42,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:42,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:33:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:42,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:33:42,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:33:42,283 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-11-20 09:33:42,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 140 transitions, 1035 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:42,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:42,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-11-20 09:33:42,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:43,297 INFO L130 PetriNetUnfolder]: 1931/3784 cut-off events. [2022-11-20 09:33:43,297 INFO L131 PetriNetUnfolder]: For 52721/53860 co-relation queries the response was YES. [2022-11-20 09:33:43,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19349 conditions, 3784 events. 1931/3784 cut-off events. For 52721/53860 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 26864 event pairs, 135 based on Foata normal form. 234/3852 useless extension candidates. Maximal degree in co-relation 19250. Up to 1193 conditions per place. [2022-11-20 09:33:43,333 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 72 selfloop transitions, 7 changer transitions 114/279 dead transitions. [2022-11-20 09:33:43,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 279 transitions, 3178 flow [2022-11-20 09:33:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:33:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 09:33:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-11-20 09:33:43,336 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-11-20 09:33:43,337 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-11-20 09:33:43,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-11-20 09:33:43,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:43,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-11-20 09:33:43,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,343 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,344 INFO L175 Difference]: Start difference. First operand has 161 places, 140 transitions, 1035 flow. Second operand 10 states and 962 transitions. [2022-11-20 09:33:43,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 279 transitions, 3178 flow [2022-11-20 09:33:43,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 279 transitions, 3062 flow, removed 31 selfloop flow, removed 9 redundant places. [2022-11-20 09:33:43,447 INFO L231 Difference]: Finished difference. Result has 162 places, 137 transitions, 934 flow [2022-11-20 09:33:43,447 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=934, PETRI_PLACES=162, PETRI_TRANSITIONS=137} [2022-11-20 09:33:43,448 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 45 predicate places. [2022-11-20 09:33:43,448 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 137 transitions, 934 flow [2022-11-20 09:33:43,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:43,449 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] [2022-11-20 09:33:43,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:33:43,450 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash 745203180, now seen corresponding path program 1 times [2022-11-20 09:33:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:43,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088045364] [2022-11-20 09:33:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:43,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:43,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088045364] [2022-11-20 09:33:43,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088045364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:43,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:43,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:33:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326262136] [2022-11-20 09:33:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:43,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:33:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:33:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:33:43,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-11-20 09:33:43,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 137 transitions, 934 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:43,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-11-20 09:33:43,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:44,471 INFO L130 PetriNetUnfolder]: 838/2019 cut-off events. [2022-11-20 09:33:44,471 INFO L131 PetriNetUnfolder]: For 25497/25845 co-relation queries the response was YES. [2022-11-20 09:33:44,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10668 conditions, 2019 events. 838/2019 cut-off events. For 25497/25845 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14327 event pairs, 59 based on Foata normal form. 134/2117 useless extension candidates. Maximal degree in co-relation 10569. Up to 549 conditions per place. [2022-11-20 09:33:44,489 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 66 selfloop transitions, 11 changer transitions 64/226 dead transitions. [2022-11-20 09:33:44,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 226 transitions, 2446 flow [2022-11-20 09:33:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:33:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:33:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1059 transitions. [2022-11-20 09:33:44,494 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.859577922077922 [2022-11-20 09:33:44,494 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1059 transitions. [2022-11-20 09:33:44,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1059 transitions. [2022-11-20 09:33:44,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:44,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1059 transitions. [2022-11-20 09:33:44,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.27272727272727) internal successors, (1059), 11 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:44,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:44,501 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:44,502 INFO L175 Difference]: Start difference. First operand has 162 places, 137 transitions, 934 flow. Second operand 11 states and 1059 transitions. [2022-11-20 09:33:44,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 226 transitions, 2446 flow [2022-11-20 09:33:44,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 226 transitions, 2357 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-11-20 09:33:44,556 INFO L231 Difference]: Finished difference. Result has 169 places, 136 transitions, 926 flow [2022-11-20 09:33:44,557 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=926, PETRI_PLACES=169, PETRI_TRANSITIONS=136} [2022-11-20 09:33:44,558 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 52 predicate places. [2022-11-20 09:33:44,558 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 136 transitions, 926 flow [2022-11-20 09:33:44,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:44,559 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:44,559 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-20 09:33:44,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:33:44,559 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1925894389, now seen corresponding path program 1 times [2022-11-20 09:33:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:44,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686115569] [2022-11-20 09:33:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:44,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:44,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:44,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686115569] [2022-11-20 09:33:44,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686115569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:44,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:44,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:33:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041316673] [2022-11-20 09:33:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:44,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:33:44,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:33:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:33:44,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-11-20 09:33:44,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 136 transitions, 926 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:44,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:44,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-11-20 09:33:44,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:45,493 INFO L130 PetriNetUnfolder]: 520/1380 cut-off events. [2022-11-20 09:33:45,493 INFO L131 PetriNetUnfolder]: For 18581/18931 co-relation queries the response was YES. [2022-11-20 09:33:45,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7899 conditions, 1380 events. 520/1380 cut-off events. For 18581/18931 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9940 event pairs, 66 based on Foata normal form. 89/1423 useless extension candidates. Maximal degree in co-relation 7807. Up to 397 conditions per place. [2022-11-20 09:33:45,506 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 33 selfloop transitions, 14 changer transitions 74/198 dead transitions. [2022-11-20 09:33:45,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 198 transitions, 2039 flow [2022-11-20 09:33:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:33:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 09:33:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1217 transitions. [2022-11-20 09:33:45,510 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358516483516484 [2022-11-20 09:33:45,510 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1217 transitions. [2022-11-20 09:33:45,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1217 transitions. [2022-11-20 09:33:45,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:45,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1217 transitions. [2022-11-20 09:33:45,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.61538461538461) internal successors, (1217), 13 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,519 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,519 INFO L175 Difference]: Start difference. First operand has 169 places, 136 transitions, 926 flow. Second operand 13 states and 1217 transitions. [2022-11-20 09:33:45,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 198 transitions, 2039 flow [2022-11-20 09:33:45,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 198 transitions, 1784 flow, removed 115 selfloop flow, removed 10 redundant places. [2022-11-20 09:33:45,593 INFO L231 Difference]: Finished difference. Result has 174 places, 113 transitions, 635 flow [2022-11-20 09:33:45,593 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=635, PETRI_PLACES=174, PETRI_TRANSITIONS=113} [2022-11-20 09:33:45,594 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 57 predicate places. [2022-11-20 09:33:45,594 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 113 transitions, 635 flow [2022-11-20 09:33:45,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,595 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:45,595 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] [2022-11-20 09:33:45,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:33:45,595 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:45,596 INFO L85 PathProgramCache]: Analyzing trace with hash -468204113, now seen corresponding path program 1 times [2022-11-20 09:33:45,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:45,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188603985] [2022-11-20 09:33:45,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:45,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:48,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188603985] [2022-11-20 09:33:48,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188603985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:48,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:48,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 09:33:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590152256] [2022-11-20 09:33:48,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:48,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:33:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:48,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:33:48,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:33:48,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 112 [2022-11-20 09:33:48,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 113 transitions, 635 flow. Second operand has 14 states, 14 states have (on average 77.28571428571429) internal successors, (1082), 14 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:48,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 112 [2022-11-20 09:33:48,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:48,858 INFO L130 PetriNetUnfolder]: 64/439 cut-off events. [2022-11-20 09:33:48,858 INFO L131 PetriNetUnfolder]: For 2064/2095 co-relation queries the response was YES. [2022-11-20 09:33:48,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 439 events. 64/439 cut-off events. For 2064/2095 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2461 event pairs, 6 based on Foata normal form. 7/433 useless extension candidates. Maximal degree in co-relation 1567. Up to 73 conditions per place. [2022-11-20 09:33:48,860 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 33 selfloop transitions, 10 changer transitions 16/129 dead transitions. [2022-11-20 09:33:48,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 129 transitions, 881 flow [2022-11-20 09:33:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:33:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 09:33:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1030 transitions. [2022-11-20 09:33:48,869 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7074175824175825 [2022-11-20 09:33:48,869 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1030 transitions. [2022-11-20 09:33:48,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1030 transitions. [2022-11-20 09:33:48,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:48,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1030 transitions. [2022-11-20 09:33:48,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 79.23076923076923) internal successors, (1030), 13 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,877 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,879 INFO L175 Difference]: Start difference. First operand has 174 places, 113 transitions, 635 flow. Second operand 13 states and 1030 transitions. [2022-11-20 09:33:48,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 129 transitions, 881 flow [2022-11-20 09:33:48,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 129 transitions, 625 flow, removed 96 selfloop flow, removed 30 redundant places. [2022-11-20 09:33:48,894 INFO L231 Difference]: Finished difference. Result has 148 places, 107 transitions, 414 flow [2022-11-20 09:33:48,894 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=414, PETRI_PLACES=148, PETRI_TRANSITIONS=107} [2022-11-20 09:33:48,895 INFO L288 CegarLoopForPetriNet]: 117 programPoint places, 31 predicate places. [2022-11-20 09:33:48,895 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 107 transitions, 414 flow [2022-11-20 09:33:48,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.28571428571429) internal successors, (1082), 14 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:48,896 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] [2022-11-20 09:33:48,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:33:48,897 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:33:48,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -705973525, now seen corresponding path program 2 times [2022-11-20 09:33:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:48,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318958502] [2022-11-20 09:33:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:33:48,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:33:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:33:49,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:33:49,071 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:33:49,073 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 09:33:49,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 09:33:49,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 09:33:49,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 09:33:49,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 09:33:49,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 09:33:49,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:33:49,078 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:49,087 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:33:49,087 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:33:49,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:33:49 BasicIcfg [2022-11-20 09:33:49,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:33:49,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:33:49,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:33:49,255 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:33:49,256 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:08" (3/4) ... [2022-11-20 09:33:49,258 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 09:33:49,404 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:33:49,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:33:49,405 INFO L158 Benchmark]: Toolchain (without parser) took 42572.39ms. Allocated memory was 169.9MB in the beginning and 625.0MB in the end (delta: 455.1MB). Free memory was 133.7MB in the beginning and 254.9MB in the end (delta: -121.2MB). Peak memory consumption was 333.5MB. Max. memory is 16.1GB. [2022-11-20 09:33:49,405 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 121.6MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:33:49,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 847.38ms. Allocated memory is still 169.9MB. Free memory was 133.7MB in the beginning and 128.5MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 09:33:49,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.15ms. Allocated memory is still 169.9MB. Free memory was 128.5MB in the beginning and 125.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:33:49,410 INFO L158 Benchmark]: Boogie Preprocessor took 69.58ms. Allocated memory is still 169.9MB. Free memory was 125.1MB in the beginning and 123.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:33:49,410 INFO L158 Benchmark]: RCFGBuilder took 1100.14ms. Allocated memory is still 169.9MB. Free memory was 123.8MB in the beginning and 89.5MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-20 09:33:49,411 INFO L158 Benchmark]: TraceAbstraction took 40273.30ms. Allocated memory was 169.9MB in the beginning and 625.0MB in the end (delta: 455.1MB). Free memory was 88.7MB in the beginning and 275.9MB in the end (delta: -187.2MB). Peak memory consumption was 269.5MB. Max. memory is 16.1GB. [2022-11-20 09:33:49,411 INFO L158 Benchmark]: Witness Printer took 149.75ms. Allocated memory is still 625.0MB. Free memory was 275.9MB in the beginning and 254.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 09:33:49,413 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.37ms. Allocated memory is still 121.6MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 847.38ms. Allocated memory is still 169.9MB. Free memory was 133.7MB in the beginning and 128.5MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.15ms. Allocated memory is still 169.9MB. Free memory was 128.5MB in the beginning and 125.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.58ms. Allocated memory is still 169.9MB. Free memory was 125.1MB in the beginning and 123.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1100.14ms. Allocated memory is still 169.9MB. Free memory was 123.8MB in the beginning and 89.5MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 40273.30ms. Allocated memory was 169.9MB in the beginning and 625.0MB in the end (delta: 455.1MB). Free memory was 88.7MB in the beginning and 275.9MB in the end (delta: -187.2MB). Peak memory consumption was 269.5MB. Max. memory is 16.1GB. * Witness Printer took 149.75ms. Allocated memory is still 625.0MB. Free memory was 275.9MB in the beginning and 254.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-2, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=-1, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 818]: 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: 814]: 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: 816]: 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, 138 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: 39.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1174 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1174 mSDsluCounter, 1437 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1150 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2566 IncrementalHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 287 mSDtfsCounter, 2566 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1141occurred in iteration=5, InterpolantAutomatonStates: 202, 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.8s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 1308 NumberOfCodeBlocks, 1308 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1206 ConstructedInterpolants, 0 QuantifiedInterpolants, 8704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 09:33:49,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621d686e-ec47-43e4-86d8-2806219637ee/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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