./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/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_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/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_4cce607d-0fa4-4959-868b-06713f481d07/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 7850c8f92b7e0b0b866687e8f3ea719169cacbc5985a977f15b280bf9bb53b5b --- 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 12:08:25,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:08:25,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:08:25,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:08:25,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:08:25,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:08:25,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:08:25,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:08:25,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:08:25,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:08:25,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:08:25,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:08:25,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:08:25,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:08:25,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:08:25,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:08:25,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:08:25,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:08:25,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:08:25,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:08:25,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:08:25,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:08:25,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:08:25,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:08:25,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:08:25,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:08:25,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:08:25,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:08:25,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:08:25,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:08:25,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:08:25,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:08:25,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:08:25,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:08:25,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:08:25,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:08:25,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:08:25,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:08:25,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:08:25,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:08:25,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:08:25,323 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:08:25,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:08:25,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:08:25,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:08:25,377 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:08:25,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:08:25,378 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:08:25,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:08:25,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:08:25,379 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:08:25,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:08:25,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:08:25,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:08:25,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:08:25,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:08:25,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:08:25,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:08:25,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:08:25,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:08:25,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:08:25,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:08:25,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:08:25,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:08:25,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:08:25,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:08:25,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:08:25,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:08:25,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:08:25,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:08:25,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:08:25,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:08:25,384 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:08:25,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:08:25,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:08:25,384 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_4cce607d-0fa4-4959-868b-06713f481d07/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_4cce607d-0fa4-4959-868b-06713f481d07/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 -> 7850c8f92b7e0b0b866687e8f3ea719169cacbc5985a977f15b280bf9bb53b5b [2022-11-20 12:08:25,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:08:25,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:08:25,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:08:25,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:08:25,730 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:08:25,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2022-11-20 12:08:28,727 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:08:28,968 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:08:28,969 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2022-11-20 12:08:28,976 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/data/39a6ffd55/20247605479148c1906545260b14f569/FLAG16f555ad4 [2022-11-20 12:08:28,992 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/data/39a6ffd55/20247605479148c1906545260b14f569 [2022-11-20 12:08:28,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:08:28,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:08:29,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:08:29,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:08:29,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:08:29,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:08:28" (1/1) ... [2022-11-20 12:08:29,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31915a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29, skipping insertion in model container [2022-11-20 12:08:29,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:08:28" (1/1) ... [2022-11-20 12:08:29,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:08:29,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:08:29,247 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_4cce607d-0fa4-4959-868b-06713f481d07/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-11-20 12:08:29,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:08:29,276 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:08:29,303 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_4cce607d-0fa4-4959-868b-06713f481d07/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-11-20 12:08:29,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:08:29,325 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:08:29,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29 WrapperNode [2022-11-20 12:08:29,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:08:29,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:08:29,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:08:29,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:08:29,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,373 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 193 [2022-11-20 12:08:29,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:08:29,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:08:29,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:08:29,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:08:29,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,404 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:08:29,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:08:29,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:08:29,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:08:29,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (1/1) ... [2022-11-20 12:08:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:08:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:08:29,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:08:29,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cce607d-0fa4-4959-868b-06713f481d07/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:08:29,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:08:29,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 12:08:29,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 12:08:29,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 12:08:29,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 12:08:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 12:08:29,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 12:08:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:08:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:08:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:08:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:08:29,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:08:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:08:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:08:29,513 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 12:08:29,716 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:08:29,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:08:30,353 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:08:30,363 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:08:30,364 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:08:30,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:08:30 BoogieIcfgContainer [2022-11-20 12:08:30,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:08:30,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:08:30,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:08:30,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:08:30,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:08:28" (1/3) ... [2022-11-20 12:08:30,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd7faf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:08:30, skipping insertion in model container [2022-11-20 12:08:30,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:29" (2/3) ... [2022-11-20 12:08:30,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd7faf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:08:30, skipping insertion in model container [2022-11-20 12:08:30,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:08:30" (3/3) ... [2022-11-20 12:08:30,376 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2022-11-20 12:08:30,385 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:08:30,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:08:30,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:08:30,397 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:08:30,500 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 12:08:30,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 248 transitions, 520 flow [2022-11-20 12:08:30,670 INFO L130 PetriNetUnfolder]: 19/245 cut-off events. [2022-11-20 12:08:30,670 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 12:08:30,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 245 events. 19/245 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 560 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 169. Up to 2 conditions per place. [2022-11-20 12:08:30,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 248 transitions, 520 flow [2022-11-20 12:08:30,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 234 transitions, 486 flow [2022-11-20 12:08:30,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:08:30,718 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;@364fe71f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:08:30,719 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 12:08:30,798 INFO L130 PetriNetUnfolder]: 19/233 cut-off events. [2022-11-20 12:08:30,798 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 12:08:30,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:30,799 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:08:30,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1241919562, now seen corresponding path program 1 times [2022-11-20 12:08:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:30,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541689768] [2022-11-20 12:08:30,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:31,748 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 12:08:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:31,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541689768] [2022-11-20 12:08:31,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541689768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:31,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:31,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:08:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040442437] [2022-11-20 12:08:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:31,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:08:31,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:08:31,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:08:31,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 248 [2022-11-20 12:08:31,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 234 transitions, 486 flow. Second operand has 7 states, 7 states have (on average 220.42857142857142) internal successors, (1543), 7 states have internal predecessors, (1543), 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 12:08:31,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:31,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 248 [2022-11-20 12:08:31,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:32,564 INFO L130 PetriNetUnfolder]: 176/1783 cut-off events. [2022-11-20 12:08:32,564 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-11-20 12:08:32,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 1783 events. 176/1783 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16125 event pairs, 21 based on Foata normal form. 85/1668 useless extension candidates. Maximal degree in co-relation 1881. Up to 43 conditions per place. [2022-11-20 12:08:32,592 INFO L137 encePairwiseOnDemand]: 227/248 looper letters, 49 selfloop transitions, 18 changer transitions 11/283 dead transitions. [2022-11-20 12:08:32,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 283 transitions, 803 flow [2022-11-20 12:08:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:08:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:08:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2943 transitions. [2022-11-20 12:08:32,621 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9128411910669976 [2022-11-20 12:08:32,622 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2943 transitions. [2022-11-20 12:08:32,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2943 transitions. [2022-11-20 12:08:32,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:32,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2943 transitions. [2022-11-20 12:08:32,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 226.3846153846154) internal successors, (2943), 13 states have internal predecessors, (2943), 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 12:08:32,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 248.0) internal successors, (3472), 14 states have internal predecessors, (3472), 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 12:08:32,660 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 248.0) internal successors, (3472), 14 states have internal predecessors, (3472), 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 12:08:32,662 INFO L175 Difference]: Start difference. First operand has 225 places, 234 transitions, 486 flow. Second operand 13 states and 2943 transitions. [2022-11-20 12:08:32,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 283 transitions, 803 flow [2022-11-20 12:08:32,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 283 transitions, 749 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 12:08:32,679 INFO L231 Difference]: Finished difference. Result has 238 places, 241 transitions, 577 flow [2022-11-20 12:08:32,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=577, PETRI_PLACES=238, PETRI_TRANSITIONS=241} [2022-11-20 12:08:32,685 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 13 predicate places. [2022-11-20 12:08:32,686 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 241 transitions, 577 flow [2022-11-20 12:08:32,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 220.42857142857142) internal successors, (1543), 7 states have internal predecessors, (1543), 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 12:08:32,687 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:32,688 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:08:32,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:08:32,688 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:32,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1221345892, now seen corresponding path program 2 times [2022-11-20 12:08:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:32,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982161923] [2022-11-20 12:08:32,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:32,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:33,066 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 12:08:33,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:33,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982161923] [2022-11-20 12:08:33,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982161923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:33,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:33,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:08:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857259322] [2022-11-20 12:08:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:33,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:08:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:33,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:08:33,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:08:33,074 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 248 [2022-11-20 12:08:33,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 241 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 220.42857142857142) internal successors, (1543), 7 states have internal predecessors, (1543), 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 12:08:33,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:33,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 248 [2022-11-20 12:08:33,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:33,582 INFO L130 PetriNetUnfolder]: 149/1458 cut-off events. [2022-11-20 12:08:33,583 INFO L131 PetriNetUnfolder]: For 179/185 co-relation queries the response was YES. [2022-11-20 12:08:33,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 1458 events. 149/1458 cut-off events. For 179/185 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12448 event pairs, 31 based on Foata normal form. 1/1322 useless extension candidates. Maximal degree in co-relation 1913. Up to 92 conditions per place. [2022-11-20 12:08:33,602 INFO L137 encePairwiseOnDemand]: 240/248 looper letters, 40 selfloop transitions, 12 changer transitions 4/261 dead transitions. [2022-11-20 12:08:33,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 261 transitions, 767 flow [2022-11-20 12:08:33,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:08:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:08:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2008 transitions. [2022-11-20 12:08:33,609 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.899641577060932 [2022-11-20 12:08:33,609 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2008 transitions. [2022-11-20 12:08:33,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2008 transitions. [2022-11-20 12:08:33,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:33,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2008 transitions. [2022-11-20 12:08:33,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 223.11111111111111) internal successors, (2008), 9 states have internal predecessors, (2008), 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 12:08:33,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 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 12:08:33,623 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 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 12:08:33,624 INFO L175 Difference]: Start difference. First operand has 238 places, 241 transitions, 577 flow. Second operand 9 states and 2008 transitions. [2022-11-20 12:08:33,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 261 transitions, 767 flow [2022-11-20 12:08:33,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 261 transitions, 761 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-20 12:08:33,640 INFO L231 Difference]: Finished difference. Result has 242 places, 246 transitions, 650 flow [2022-11-20 12:08:33,641 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=650, PETRI_PLACES=242, PETRI_TRANSITIONS=246} [2022-11-20 12:08:33,642 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 17 predicate places. [2022-11-20 12:08:33,642 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 246 transitions, 650 flow [2022-11-20 12:08:33,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 220.42857142857142) internal successors, (1543), 7 states have internal predecessors, (1543), 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 12:08:33,644 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:33,645 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:08:33,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:08:33,646 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2114370742, now seen corresponding path program 3 times [2022-11-20 12:08:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:33,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978151167] [2022-11-20 12:08:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:33,946 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 12:08:33,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:33,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978151167] [2022-11-20 12:08:33,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978151167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:33,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:33,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:08:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479765626] [2022-11-20 12:08:33,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:33,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:08:33,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:33,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:08:33,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:08:33,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 248 [2022-11-20 12:08:33,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 246 transitions, 650 flow. Second operand has 8 states, 8 states have (on average 216.625) internal successors, (1733), 8 states have internal predecessors, (1733), 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 12:08:33,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:33,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 248 [2022-11-20 12:08:33,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:34,826 INFO L130 PetriNetUnfolder]: 436/2980 cut-off events. [2022-11-20 12:08:34,826 INFO L131 PetriNetUnfolder]: For 764/771 co-relation queries the response was YES. [2022-11-20 12:08:34,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4340 conditions, 2980 events. 436/2980 cut-off events. For 764/771 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 30152 event pairs, 124 based on Foata normal form. 21/2733 useless extension candidates. Maximal degree in co-relation 4307. Up to 177 conditions per place. [2022-11-20 12:08:34,858 INFO L137 encePairwiseOnDemand]: 237/248 looper letters, 61 selfloop transitions, 15 changer transitions 7/284 dead transitions. [2022-11-20 12:08:34,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 284 transitions, 970 flow [2022-11-20 12:08:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:08:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:08:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1780 transitions. [2022-11-20 12:08:34,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8971774193548387 [2022-11-20 12:08:34,864 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1780 transitions. [2022-11-20 12:08:34,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1780 transitions. [2022-11-20 12:08:34,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:34,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1780 transitions. [2022-11-20 12:08:34,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 222.5) internal successors, (1780), 8 states have internal predecessors, (1780), 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 12:08:34,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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 12:08:34,878 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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 12:08:34,878 INFO L175 Difference]: Start difference. First operand has 242 places, 246 transitions, 650 flow. Second operand 8 states and 1780 transitions. [2022-11-20 12:08:34,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 284 transitions, 970 flow [2022-11-20 12:08:34,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 284 transitions, 956 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-20 12:08:34,891 INFO L231 Difference]: Finished difference. Result has 252 places, 251 transitions, 761 flow [2022-11-20 12:08:34,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=761, PETRI_PLACES=252, PETRI_TRANSITIONS=251} [2022-11-20 12:08:34,894 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 27 predicate places. [2022-11-20 12:08:34,894 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 251 transitions, 761 flow [2022-11-20 12:08:34,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 216.625) internal successors, (1733), 8 states have internal predecessors, (1733), 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 12:08:34,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:34,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, 1, 1, 1, 1, 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 12:08:34,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:08:34,896 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1819342714, now seen corresponding path program 1 times [2022-11-20 12:08:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:34,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976751222] [2022-11-20 12:08:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:35,141 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 12:08:35,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:35,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976751222] [2022-11-20 12:08:35,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976751222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:35,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:35,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:08:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90037146] [2022-11-20 12:08:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:35,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:08:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:08:35,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:08:35,153 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 248 [2022-11-20 12:08:35,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 251 transitions, 761 flow. Second operand has 7 states, 7 states have (on average 219.85714285714286) internal successors, (1539), 7 states have internal predecessors, (1539), 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 12:08:35,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:35,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 248 [2022-11-20 12:08:35,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:35,997 INFO L130 PetriNetUnfolder]: 694/2973 cut-off events. [2022-11-20 12:08:35,998 INFO L131 PetriNetUnfolder]: For 3204/3657 co-relation queries the response was YES. [2022-11-20 12:08:36,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5855 conditions, 2973 events. 694/2973 cut-off events. For 3204/3657 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 29573 event pairs, 293 based on Foata normal form. 111/2927 useless extension candidates. Maximal degree in co-relation 5817. Up to 800 conditions per place. [2022-11-20 12:08:36,048 INFO L137 encePairwiseOnDemand]: 236/248 looper letters, 46 selfloop transitions, 24 changer transitions 4/297 dead transitions. [2022-11-20 12:08:36,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 297 transitions, 1231 flow [2022-11-20 12:08:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:08:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:08:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2007 transitions. [2022-11-20 12:08:36,105 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8991935483870968 [2022-11-20 12:08:36,105 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2007 transitions. [2022-11-20 12:08:36,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2007 transitions. [2022-11-20 12:08:36,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:36,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2007 transitions. [2022-11-20 12:08:36,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 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 12:08:36,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 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 12:08:36,141 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 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 12:08:36,141 INFO L175 Difference]: Start difference. First operand has 252 places, 251 transitions, 761 flow. Second operand 9 states and 2007 transitions. [2022-11-20 12:08:36,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 297 transitions, 1231 flow [2022-11-20 12:08:36,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 297 transitions, 1192 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-20 12:08:36,157 INFO L231 Difference]: Finished difference. Result has 262 places, 272 transitions, 1031 flow [2022-11-20 12:08:36,158 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1031, PETRI_PLACES=262, PETRI_TRANSITIONS=272} [2022-11-20 12:08:36,159 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 37 predicate places. [2022-11-20 12:08:36,160 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 272 transitions, 1031 flow [2022-11-20 12:08:36,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 219.85714285714286) internal successors, (1539), 7 states have internal predecessors, (1539), 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 12:08:36,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:36,166 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:08:36,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:08:36,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:36,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1270242412, now seen corresponding path program 2 times [2022-11-20 12:08:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:36,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714987999] [2022-11-20 12:08:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:36,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:36,467 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 12:08:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714987999] [2022-11-20 12:08:36,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714987999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:36,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:36,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:08:36,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136147959] [2022-11-20 12:08:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:36,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:08:36,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:08:36,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:08:36,471 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 248 [2022-11-20 12:08:36,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 272 transitions, 1031 flow. Second operand has 7 states, 7 states have (on average 223.28571428571428) internal successors, (1563), 7 states have internal predecessors, (1563), 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 12:08:36,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:36,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 248 [2022-11-20 12:08:36,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:37,151 INFO L130 PetriNetUnfolder]: 348/2337 cut-off events. [2022-11-20 12:08:37,151 INFO L131 PetriNetUnfolder]: For 1887/2258 co-relation queries the response was YES. [2022-11-20 12:08:37,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4541 conditions, 2337 events. 348/2337 cut-off events. For 1887/2258 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 23898 event pairs, 123 based on Foata normal form. 64/2260 useless extension candidates. Maximal degree in co-relation 4498. Up to 365 conditions per place. [2022-11-20 12:08:37,184 INFO L137 encePairwiseOnDemand]: 240/248 looper letters, 28 selfloop transitions, 7 changer transitions 4/287 dead transitions. [2022-11-20 12:08:37,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 1159 flow [2022-11-20 12:08:37,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:08:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:08:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2027 transitions. [2022-11-20 12:08:37,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9081541218637993 [2022-11-20 12:08:37,191 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2027 transitions. [2022-11-20 12:08:37,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2027 transitions. [2022-11-20 12:08:37,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:37,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2027 transitions. [2022-11-20 12:08:37,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 225.22222222222223) internal successors, (2027), 9 states have internal predecessors, (2027), 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 12:08:37,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 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 12:08:37,204 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 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 12:08:37,204 INFO L175 Difference]: Start difference. First operand has 262 places, 272 transitions, 1031 flow. Second operand 9 states and 2027 transitions. [2022-11-20 12:08:37,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 1159 flow [2022-11-20 12:08:37,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 1153 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-20 12:08:37,221 INFO L231 Difference]: Finished difference. Result has 269 places, 272 transitions, 1049 flow [2022-11-20 12:08:37,221 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1049, PETRI_PLACES=269, PETRI_TRANSITIONS=272} [2022-11-20 12:08:37,222 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 44 predicate places. [2022-11-20 12:08:37,222 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 272 transitions, 1049 flow [2022-11-20 12:08:37,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 223.28571428571428) internal successors, (1563), 7 states have internal predecessors, (1563), 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 12:08:37,224 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:37,224 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:08:37,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:08:37,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash -937480358, now seen corresponding path program 1 times [2022-11-20 12:08:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:37,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566284454] [2022-11-20 12:08:37,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:37,309 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 12:08:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:37,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566284454] [2022-11-20 12:08:37,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566284454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:37,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:37,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:08:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966642594] [2022-11-20 12:08:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:37,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:08:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:08:37,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:08:37,314 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 248 [2022-11-20 12:08:37,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 272 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 12:08:37,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:37,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 248 [2022-11-20 12:08:37,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:38,210 INFO L130 PetriNetUnfolder]: 391/4475 cut-off events. [2022-11-20 12:08:38,211 INFO L131 PetriNetUnfolder]: For 3109/3448 co-relation queries the response was YES. [2022-11-20 12:08:38,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7167 conditions, 4475 events. 391/4475 cut-off events. For 3109/3448 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 50183 event pairs, 60 based on Foata normal form. 54/4176 useless extension candidates. Maximal degree in co-relation 7110. Up to 201 conditions per place. [2022-11-20 12:08:38,265 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 17 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2022-11-20 12:08:38,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 279 transitions, 1106 flow [2022-11-20 12:08:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:08:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:08:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-20 12:08:38,268 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9475806451612904 [2022-11-20 12:08:38,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-20 12:08:38,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-20 12:08:38,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:38,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-20 12:08:38,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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 12:08:38,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:08:38,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:08:38,274 INFO L175 Difference]: Start difference. First operand has 269 places, 272 transitions, 1049 flow. Second operand 3 states and 705 transitions. [2022-11-20 12:08:38,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 279 transitions, 1106 flow [2022-11-20 12:08:38,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 279 transitions, 1101 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-20 12:08:38,301 INFO L231 Difference]: Finished difference. Result has 268 places, 274 transitions, 1064 flow [2022-11-20 12:08:38,301 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=268, PETRI_TRANSITIONS=274} [2022-11-20 12:08:38,304 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 43 predicate places. [2022-11-20 12:08:38,305 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 274 transitions, 1064 flow [2022-11-20 12:08:38,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 12:08:38,305 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:38,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:08:38,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:08:38,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 903541722, now seen corresponding path program 2 times [2022-11-20 12:08:38,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:38,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425684383] [2022-11-20 12:08:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:38,372 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 12:08:38,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425684383] [2022-11-20 12:08:38,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425684383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:38,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:38,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:08:38,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334141703] [2022-11-20 12:08:38,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:38,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:08:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:08:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:08:38,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 248 [2022-11-20 12:08:38,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 274 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 12:08:38,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:38,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 248 [2022-11-20 12:08:38,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:39,068 INFO L130 PetriNetUnfolder]: 289/3524 cut-off events. [2022-11-20 12:08:39,068 INFO L131 PetriNetUnfolder]: For 2028/2414 co-relation queries the response was YES. [2022-11-20 12:08:39,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5339 conditions, 3524 events. 289/3524 cut-off events. For 2028/2414 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 37185 event pairs, 63 based on Foata normal form. 57/3298 useless extension candidates. Maximal degree in co-relation 4483. Up to 135 conditions per place. [2022-11-20 12:08:39,100 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 17 selfloop transitions, 4 changer transitions 0/281 dead transitions. [2022-11-20 12:08:39,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 281 transitions, 1129 flow [2022-11-20 12:08:39,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:08:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:08:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-20 12:08:39,103 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9475806451612904 [2022-11-20 12:08:39,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-20 12:08:39,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-20 12:08:39,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:39,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-20 12:08:39,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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 12:08:39,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:08:39,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:08:39,109 INFO L175 Difference]: Start difference. First operand has 268 places, 274 transitions, 1064 flow. Second operand 3 states and 705 transitions. [2022-11-20 12:08:39,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 281 transitions, 1129 flow [2022-11-20 12:08:39,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 281 transitions, 1127 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:08:39,125 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 1094 flow [2022-11-20 12:08:39,126 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1094, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2022-11-20 12:08:39,127 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 46 predicate places. [2022-11-20 12:08:39,127 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 1094 flow [2022-11-20 12:08:39,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 12:08:39,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:39,128 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:39,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:08:39,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216282, now seen corresponding path program 1 times [2022-11-20 12:08:39,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:39,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569297457] [2022-11-20 12:08:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:39,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:39,346 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 12:08:39,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:39,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569297457] [2022-11-20 12:08:39,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569297457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:39,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:39,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:08:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347048415] [2022-11-20 12:08:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:39,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:08:39,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:39,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:08:39,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:08:39,351 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 248 [2022-11-20 12:08:39,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 1094 flow. Second operand has 8 states, 8 states have (on average 219.5) internal successors, (1756), 8 states have internal predecessors, (1756), 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 12:08:39,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:39,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 248 [2022-11-20 12:08:39,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:40,334 INFO L130 PetriNetUnfolder]: 750/4967 cut-off events. [2022-11-20 12:08:40,335 INFO L131 PetriNetUnfolder]: For 4679/4892 co-relation queries the response was YES. [2022-11-20 12:08:40,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9573 conditions, 4967 events. 750/4967 cut-off events. For 4679/4892 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 58483 event pairs, 376 based on Foata normal form. 27/4688 useless extension candidates. Maximal degree in co-relation 8010. Up to 961 conditions per place. [2022-11-20 12:08:40,398 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 64 selfloop transitions, 10 changer transitions 26/326 dead transitions. [2022-11-20 12:08:40,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 326 transitions, 1563 flow [2022-11-20 12:08:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:08:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:08:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2223 transitions. [2022-11-20 12:08:40,405 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8963709677419355 [2022-11-20 12:08:40,405 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2223 transitions. [2022-11-20 12:08:40,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2223 transitions. [2022-11-20 12:08:40,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:40,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2223 transitions. [2022-11-20 12:08:40,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 222.3) internal successors, (2223), 10 states have internal predecessors, (2223), 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 12:08:40,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 248.0) internal successors, (2728), 11 states have internal predecessors, (2728), 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 12:08:40,419 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 248.0) internal successors, (2728), 11 states have internal predecessors, (2728), 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 12:08:40,420 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 1094 flow. Second operand 10 states and 2223 transitions. [2022-11-20 12:08:40,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 326 transitions, 1563 flow [2022-11-20 12:08:40,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 326 transitions, 1551 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-20 12:08:40,451 INFO L231 Difference]: Finished difference. Result has 285 places, 272 transitions, 1063 flow [2022-11-20 12:08:40,452 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1063, PETRI_PLACES=285, PETRI_TRANSITIONS=272} [2022-11-20 12:08:40,455 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 60 predicate places. [2022-11-20 12:08:40,455 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 272 transitions, 1063 flow [2022-11-20 12:08:40,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 219.5) internal successors, (1756), 8 states have internal predecessors, (1756), 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 12:08:40,456 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:40,457 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:40,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:08:40,457 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:40,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1187466394, now seen corresponding path program 1 times [2022-11-20 12:08:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:40,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665877017] [2022-11-20 12:08:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:40,763 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 12:08:40,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:40,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665877017] [2022-11-20 12:08:40,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665877017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:40,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:40,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:08:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932394484] [2022-11-20 12:08:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:40,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:08:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:40,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:08:40,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:08:40,767 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 248 [2022-11-20 12:08:40,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 272 transitions, 1063 flow. Second operand has 8 states, 8 states have (on average 215.625) internal successors, (1725), 8 states have internal predecessors, (1725), 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 12:08:40,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:40,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 248 [2022-11-20 12:08:40,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:42,639 INFO L130 PetriNetUnfolder]: 1306/8423 cut-off events. [2022-11-20 12:08:42,639 INFO L131 PetriNetUnfolder]: For 10537/11131 co-relation queries the response was YES. [2022-11-20 12:08:42,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15230 conditions, 8423 events. 1306/8423 cut-off events. For 10537/11131 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 107539 event pairs, 709 based on Foata normal form. 238/7853 useless extension candidates. Maximal degree in co-relation 15168. Up to 1605 conditions per place. [2022-11-20 12:08:42,715 INFO L137 encePairwiseOnDemand]: 239/248 looper letters, 71 selfloop transitions, 11 changer transitions 13/322 dead transitions. [2022-11-20 12:08:42,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 322 transitions, 1549 flow [2022-11-20 12:08:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:08:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:08:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2198 transitions. [2022-11-20 12:08:42,721 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8862903225806451 [2022-11-20 12:08:42,721 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2198 transitions. [2022-11-20 12:08:42,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2198 transitions. [2022-11-20 12:08:42,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:42,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2198 transitions. [2022-11-20 12:08:42,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 219.8) internal successors, (2198), 10 states have internal predecessors, (2198), 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 12:08:42,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 248.0) internal successors, (2728), 11 states have internal predecessors, (2728), 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 12:08:42,734 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 248.0) internal successors, (2728), 11 states have internal predecessors, (2728), 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 12:08:42,734 INFO L175 Difference]: Start difference. First operand has 285 places, 272 transitions, 1063 flow. Second operand 10 states and 2198 transitions. [2022-11-20 12:08:42,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 322 transitions, 1549 flow [2022-11-20 12:08:42,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 322 transitions, 1508 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-20 12:08:42,787 INFO L231 Difference]: Finished difference. Result has 291 places, 279 transitions, 1113 flow [2022-11-20 12:08:42,788 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1113, PETRI_PLACES=291, PETRI_TRANSITIONS=279} [2022-11-20 12:08:42,789 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 66 predicate places. [2022-11-20 12:08:42,789 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 279 transitions, 1113 flow [2022-11-20 12:08:42,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 215.625) internal successors, (1725), 8 states have internal predecessors, (1725), 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 12:08:42,790 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:42,790 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:42,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:08:42,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1400596488, now seen corresponding path program 2 times [2022-11-20 12:08:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:42,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373835504] [2022-11-20 12:08:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:43,109 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 12:08:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373835504] [2022-11-20 12:08:43,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373835504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:43,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:43,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:08:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428661367] [2022-11-20 12:08:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:43,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:08:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:43,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:08:43,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:08:43,114 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 248 [2022-11-20 12:08:43,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 279 transitions, 1113 flow. Second operand has 7 states, 7 states have (on average 219.42857142857142) internal successors, (1536), 7 states have internal predecessors, (1536), 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 12:08:43,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:43,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 248 [2022-11-20 12:08:43,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:44,563 INFO L130 PetriNetUnfolder]: 907/7650 cut-off events. [2022-11-20 12:08:44,563 INFO L131 PetriNetUnfolder]: For 5522/6003 co-relation queries the response was YES. [2022-11-20 12:08:44,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13304 conditions, 7650 events. 907/7650 cut-off events. For 5522/6003 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 101237 event pairs, 390 based on Foata normal form. 135/7160 useless extension candidates. Maximal degree in co-relation 13235. Up to 712 conditions per place. [2022-11-20 12:08:44,640 INFO L137 encePairwiseOnDemand]: 236/248 looper letters, 46 selfloop transitions, 9 changer transitions 11/311 dead transitions. [2022-11-20 12:08:44,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 311 transitions, 1406 flow [2022-11-20 12:08:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:08:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:08:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1788 transitions. [2022-11-20 12:08:44,646 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9012096774193549 [2022-11-20 12:08:44,647 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1788 transitions. [2022-11-20 12:08:44,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1788 transitions. [2022-11-20 12:08:44,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:44,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1788 transitions. [2022-11-20 12:08:44,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 223.5) internal successors, (1788), 8 states have internal predecessors, (1788), 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 12:08:44,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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 12:08:44,658 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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 12:08:44,659 INFO L175 Difference]: Start difference. First operand has 291 places, 279 transitions, 1113 flow. Second operand 8 states and 1788 transitions. [2022-11-20 12:08:44,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 311 transitions, 1406 flow [2022-11-20 12:08:44,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 311 transitions, 1394 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-20 12:08:44,707 INFO L231 Difference]: Finished difference. Result has 299 places, 283 transitions, 1183 flow [2022-11-20 12:08:44,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1183, PETRI_PLACES=299, PETRI_TRANSITIONS=283} [2022-11-20 12:08:44,708 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 74 predicate places. [2022-11-20 12:08:44,709 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 283 transitions, 1183 flow [2022-11-20 12:08:44,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 219.42857142857142) internal successors, (1536), 7 states have internal predecessors, (1536), 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 12:08:44,710 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:44,710 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:44,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:08:44,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash -200296540, now seen corresponding path program 3 times [2022-11-20 12:08:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:44,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987585029] [2022-11-20 12:08:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:45,035 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 12:08:45,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987585029] [2022-11-20 12:08:45,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987585029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:45,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:45,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:08:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937495848] [2022-11-20 12:08:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:45,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:08:45,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:45,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:08:45,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:08:45,041 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 248 [2022-11-20 12:08:45,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 283 transitions, 1183 flow. Second operand has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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 12:08:45,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:45,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 248 [2022-11-20 12:08:45,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:47,366 INFO L130 PetriNetUnfolder]: 1723/11825 cut-off events. [2022-11-20 12:08:47,366 INFO L131 PetriNetUnfolder]: For 16569/17455 co-relation queries the response was YES. [2022-11-20 12:08:47,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22454 conditions, 11825 events. 1723/11825 cut-off events. For 16569/17455 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 161197 event pairs, 899 based on Foata normal form. 367/11225 useless extension candidates. Maximal degree in co-relation 22380. Up to 2359 conditions per place. [2022-11-20 12:08:47,467 INFO L137 encePairwiseOnDemand]: 237/248 looper letters, 59 selfloop transitions, 16 changer transitions 10/311 dead transitions. [2022-11-20 12:08:47,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 311 transitions, 1558 flow [2022-11-20 12:08:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:08:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:08:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1759 transitions. [2022-11-20 12:08:47,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8865927419354839 [2022-11-20 12:08:47,475 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1759 transitions. [2022-11-20 12:08:47,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1759 transitions. [2022-11-20 12:08:47,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:47,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1759 transitions. [2022-11-20 12:08:47,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 219.875) internal successors, (1759), 8 states have internal predecessors, (1759), 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 12:08:47,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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 12:08:47,489 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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 12:08:47,490 INFO L175 Difference]: Start difference. First operand has 299 places, 283 transitions, 1183 flow. Second operand 8 states and 1759 transitions. [2022-11-20 12:08:47,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 311 transitions, 1558 flow [2022-11-20 12:08:47,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 311 transitions, 1533 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-20 12:08:47,585 INFO L231 Difference]: Finished difference. Result has 306 places, 288 transitions, 1276 flow [2022-11-20 12:08:47,586 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1276, PETRI_PLACES=306, PETRI_TRANSITIONS=288} [2022-11-20 12:08:47,587 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 81 predicate places. [2022-11-20 12:08:47,587 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 288 transitions, 1276 flow [2022-11-20 12:08:47,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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 12:08:47,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:47,589 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:47,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:08:47,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2137586416, now seen corresponding path program 4 times [2022-11-20 12:08:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:47,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878535942] [2022-11-20 12:08:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:47,875 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 12:08:47,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:47,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878535942] [2022-11-20 12:08:47,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878535942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:47,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:47,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:08:47,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134698888] [2022-11-20 12:08:47,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:47,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:08:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:47,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:08:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:08:47,882 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 248 [2022-11-20 12:08:47,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 288 transitions, 1276 flow. Second operand has 7 states, 7 states have (on average 219.42857142857142) internal successors, (1536), 7 states have internal predecessors, (1536), 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 12:08:47,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:47,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 248 [2022-11-20 12:08:47,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:49,862 INFO L130 PetriNetUnfolder]: 1127/9841 cut-off events. [2022-11-20 12:08:49,862 INFO L131 PetriNetUnfolder]: For 9111/9834 co-relation queries the response was YES. [2022-11-20 12:08:49,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17777 conditions, 9841 events. 1127/9841 cut-off events. For 9111/9834 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 133846 event pairs, 336 based on Foata normal form. 140/9206 useless extension candidates. Maximal degree in co-relation 17709. Up to 1114 conditions per place. [2022-11-20 12:08:49,936 INFO L137 encePairwiseOnDemand]: 236/248 looper letters, 42 selfloop transitions, 18 changer transitions 19/315 dead transitions. [2022-11-20 12:08:49,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 315 transitions, 1548 flow [2022-11-20 12:08:49,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:08:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:08:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1786 transitions. [2022-11-20 12:08:49,942 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9002016129032258 [2022-11-20 12:08:49,942 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1786 transitions. [2022-11-20 12:08:49,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1786 transitions. [2022-11-20 12:08:49,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:49,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1786 transitions. [2022-11-20 12:08:49,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 223.25) internal successors, (1786), 8 states have internal predecessors, (1786), 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 12:08:49,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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 12:08:49,953 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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 12:08:49,953 INFO L175 Difference]: Start difference. First operand has 306 places, 288 transitions, 1276 flow. Second operand 8 states and 1786 transitions. [2022-11-20 12:08:49,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 315 transitions, 1548 flow [2022-11-20 12:08:50,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 315 transitions, 1509 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-11-20 12:08:50,036 INFO L231 Difference]: Finished difference. Result has 313 places, 287 transitions, 1263 flow [2022-11-20 12:08:50,037 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1263, PETRI_PLACES=313, PETRI_TRANSITIONS=287} [2022-11-20 12:08:50,037 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 88 predicate places. [2022-11-20 12:08:50,038 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 287 transitions, 1263 flow [2022-11-20 12:08:50,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 219.42857142857142) internal successors, (1536), 7 states have internal predecessors, (1536), 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 12:08:50,038 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:50,039 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:50,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:08:50,039 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash -827399782, now seen corresponding path program 1 times [2022-11-20 12:08:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:50,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056918404] [2022-11-20 12:08:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:50,091 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 12:08:50,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:50,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056918404] [2022-11-20 12:08:50,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056918404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:50,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:50,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:08:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205104890] [2022-11-20 12:08:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:50,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:08:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:08:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:08:50,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 248 [2022-11-20 12:08:50,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 287 transitions, 1263 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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 12:08:50,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:50,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 248 [2022-11-20 12:08:50,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:50,946 INFO L130 PetriNetUnfolder]: 353/4864 cut-off events. [2022-11-20 12:08:50,946 INFO L131 PetriNetUnfolder]: For 3965/4283 co-relation queries the response was YES. [2022-11-20 12:08:50,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8346 conditions, 4864 events. 353/4864 cut-off events. For 3965/4283 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 60045 event pairs, 40 based on Foata normal form. 37/4573 useless extension candidates. Maximal degree in co-relation 8301. Up to 209 conditions per place. [2022-11-20 12:08:50,989 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 18 selfloop transitions, 4 changer transitions 3/280 dead transitions. [2022-11-20 12:08:50,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 280 transitions, 1194 flow [2022-11-20 12:08:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:08:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:08:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2022-11-20 12:08:50,992 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9408602150537635 [2022-11-20 12:08:50,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 700 transitions. [2022-11-20 12:08:50,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 700 transitions. [2022-11-20 12:08:50,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:50,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 700 transitions. [2022-11-20 12:08:50,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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 12:08:50,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:08:50,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:08:50,998 INFO L175 Difference]: Start difference. First operand has 313 places, 287 transitions, 1263 flow. Second operand 3 states and 700 transitions. [2022-11-20 12:08:50,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 280 transitions, 1194 flow [2022-11-20 12:08:51,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 280 transitions, 1125 flow, removed 21 selfloop flow, removed 13 redundant places. [2022-11-20 12:08:51,043 INFO L231 Difference]: Finished difference. Result has 294 places, 275 transitions, 1060 flow [2022-11-20 12:08:51,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=294, PETRI_TRANSITIONS=275} [2022-11-20 12:08:51,045 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 69 predicate places. [2022-11-20 12:08:51,045 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 275 transitions, 1060 flow [2022-11-20 12:08:51,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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 12:08:51,045 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:51,046 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:51,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:08:51,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash -414630884, now seen corresponding path program 1 times [2022-11-20 12:08:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:51,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183225409] [2022-11-20 12:08:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:51,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:51,128 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 12:08:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183225409] [2022-11-20 12:08:51,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183225409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:51,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:51,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:08:51,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320263053] [2022-11-20 12:08:51,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:51,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:08:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:08:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:08:51,131 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 248 [2022-11-20 12:08:51,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 275 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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 12:08:51,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:51,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 248 [2022-11-20 12:08:51,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:51,648 INFO L130 PetriNetUnfolder]: 306/3508 cut-off events. [2022-11-20 12:08:51,648 INFO L131 PetriNetUnfolder]: For 3356/3596 co-relation queries the response was YES. [2022-11-20 12:08:51,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6425 conditions, 3508 events. 306/3508 cut-off events. For 3356/3596 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 38580 event pairs, 56 based on Foata normal form. 60/3333 useless extension candidates. Maximal degree in co-relation 6391. Up to 186 conditions per place. [2022-11-20 12:08:51,673 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 27 selfloop transitions, 3 changer transitions 2/280 dead transitions. [2022-11-20 12:08:51,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 280 transitions, 1141 flow [2022-11-20 12:08:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:08:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:08:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-11-20 12:08:51,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9435483870967742 [2022-11-20 12:08:51,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-11-20 12:08:51,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-11-20 12:08:51,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:51,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-11-20 12:08:51,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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 12:08:51,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:08:51,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:08:51,682 INFO L175 Difference]: Start difference. First operand has 294 places, 275 transitions, 1060 flow. Second operand 3 states and 702 transitions. [2022-11-20 12:08:51,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 280 transitions, 1141 flow [2022-11-20 12:08:51,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 280 transitions, 1124 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:08:51,716 INFO L231 Difference]: Finished difference. Result has 294 places, 275 transitions, 1059 flow [2022-11-20 12:08:51,717 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=294, PETRI_TRANSITIONS=275} [2022-11-20 12:08:51,717 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 69 predicate places. [2022-11-20 12:08:51,718 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 275 transitions, 1059 flow [2022-11-20 12:08:51,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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 12:08:51,718 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:51,719 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:51,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:08:51,719 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -5953956, now seen corresponding path program 1 times [2022-11-20 12:08:51,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:51,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18225561] [2022-11-20 12:08:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:51,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:52,069 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 12:08:52,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:52,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18225561] [2022-11-20 12:08:52,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18225561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:52,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:52,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:08:52,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495368001] [2022-11-20 12:08:52,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:52,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:08:52,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:52,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:08:52,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:08:52,075 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 248 [2022-11-20 12:08:52,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 275 transitions, 1059 flow. Second operand has 9 states, 9 states have (on average 210.77777777777777) internal successors, (1897), 9 states have internal predecessors, (1897), 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 12:08:52,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:52,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 248 [2022-11-20 12:08:52,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:53,908 INFO L130 PetriNetUnfolder]: 1801/10020 cut-off events. [2022-11-20 12:08:53,909 INFO L131 PetriNetUnfolder]: For 13953/15226 co-relation queries the response was YES. [2022-11-20 12:08:54,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21816 conditions, 10020 events. 1801/10020 cut-off events. For 13953/15226 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 133967 event pairs, 783 based on Foata normal form. 221/9448 useless extension candidates. Maximal degree in co-relation 21783. Up to 1494 conditions per place. [2022-11-20 12:08:54,154 INFO L137 encePairwiseOnDemand]: 229/248 looper letters, 82 selfloop transitions, 23 changer transitions 17/351 dead transitions. [2022-11-20 12:08:54,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 351 transitions, 1759 flow [2022-11-20 12:08:54,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:08:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 12:08:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3008 transitions. [2022-11-20 12:08:54,160 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8663594470046083 [2022-11-20 12:08:54,160 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3008 transitions. [2022-11-20 12:08:54,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3008 transitions. [2022-11-20 12:08:54,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:54,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3008 transitions. [2022-11-20 12:08:54,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 214.85714285714286) internal successors, (3008), 14 states have internal predecessors, (3008), 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 12:08:54,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 248.0) internal successors, (3720), 15 states have internal predecessors, (3720), 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 12:08:54,176 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 248.0) internal successors, (3720), 15 states have internal predecessors, (3720), 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 12:08:54,177 INFO L175 Difference]: Start difference. First operand has 294 places, 275 transitions, 1059 flow. Second operand 14 states and 3008 transitions. [2022-11-20 12:08:54,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 351 transitions, 1759 flow [2022-11-20 12:08:54,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 351 transitions, 1756 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:08:54,269 INFO L231 Difference]: Finished difference. Result has 317 places, 292 transitions, 1274 flow [2022-11-20 12:08:54,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1274, PETRI_PLACES=317, PETRI_TRANSITIONS=292} [2022-11-20 12:08:54,271 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 92 predicate places. [2022-11-20 12:08:54,272 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 292 transitions, 1274 flow [2022-11-20 12:08:54,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.77777777777777) internal successors, (1897), 9 states have internal predecessors, (1897), 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 12:08:54,272 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:54,273 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:54,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:08:54,273 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash -75124966, now seen corresponding path program 2 times [2022-11-20 12:08:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:54,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861632991] [2022-11-20 12:08:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:54,617 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 12:08:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:54,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861632991] [2022-11-20 12:08:54,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861632991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:54,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:54,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:08:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448826076] [2022-11-20 12:08:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:54,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:08:54,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:54,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:08:54,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:08:54,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 248 [2022-11-20 12:08:54,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 292 transitions, 1274 flow. Second operand has 10 states, 10 states have (on average 210.5) internal successors, (2105), 10 states have internal predecessors, (2105), 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 12:08:54,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:54,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 248 [2022-11-20 12:08:54,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:57,948 INFO L130 PetriNetUnfolder]: 2772/15364 cut-off events. [2022-11-20 12:08:57,948 INFO L131 PetriNetUnfolder]: For 46262/50003 co-relation queries the response was YES. [2022-11-20 12:08:58,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39236 conditions, 15364 events. 2772/15364 cut-off events. For 46262/50003 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 212244 event pairs, 671 based on Foata normal form. 347/14739 useless extension candidates. Maximal degree in co-relation 39193. Up to 1666 conditions per place. [2022-11-20 12:08:58,080 INFO L137 encePairwiseOnDemand]: 230/248 looper letters, 161 selfloop transitions, 55 changer transitions 65/510 dead transitions. [2022-11-20 12:08:58,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 510 transitions, 3523 flow [2022-11-20 12:08:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:08:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 12:08:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4544 transitions. [2022-11-20 12:08:58,088 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8725038402457758 [2022-11-20 12:08:58,088 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4544 transitions. [2022-11-20 12:08:58,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4544 transitions. [2022-11-20 12:08:58,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:58,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4544 transitions. [2022-11-20 12:08:58,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 216.38095238095238) internal successors, (4544), 21 states have internal predecessors, (4544), 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 12:08:58,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 248.0) internal successors, (5456), 22 states have internal predecessors, (5456), 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 12:08:58,108 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 248.0) internal successors, (5456), 22 states have internal predecessors, (5456), 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 12:08:58,108 INFO L175 Difference]: Start difference. First operand has 317 places, 292 transitions, 1274 flow. Second operand 21 states and 4544 transitions. [2022-11-20 12:08:58,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 510 transitions, 3523 flow [2022-11-20 12:08:58,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 510 transitions, 3439 flow, removed 41 selfloop flow, removed 3 redundant places. [2022-11-20 12:08:58,295 INFO L231 Difference]: Finished difference. Result has 345 places, 332 transitions, 1707 flow [2022-11-20 12:08:58,295 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1707, PETRI_PLACES=345, PETRI_TRANSITIONS=332} [2022-11-20 12:08:58,295 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 120 predicate places. [2022-11-20 12:08:58,296 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 332 transitions, 1707 flow [2022-11-20 12:08:58,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 210.5) internal successors, (2105), 10 states have internal predecessors, (2105), 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 12:08:58,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:58,297 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:58,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:08:58,297 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:08:58,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:58,297 INFO L85 PathProgramCache]: Analyzing trace with hash -828897142, now seen corresponding path program 3 times [2022-11-20 12:08:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:58,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456817108] [2022-11-20 12:08:58,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:58,795 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 12:08:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:58,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456817108] [2022-11-20 12:08:58,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456817108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:58,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:08:58,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:08:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859581673] [2022-11-20 12:08:58,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:58,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:08:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:58,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:08:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:08:58,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 248 [2022-11-20 12:08:58,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 332 transitions, 1707 flow. Second operand has 9 states, 9 states have (on average 214.33333333333334) internal successors, (1929), 9 states have internal predecessors, (1929), 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 12:08:58,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:58,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 248 [2022-11-20 12:08:58,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:01,456 INFO L130 PetriNetUnfolder]: 1467/12152 cut-off events. [2022-11-20 12:09:01,456 INFO L131 PetriNetUnfolder]: For 30805/33847 co-relation queries the response was YES. [2022-11-20 12:09:01,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29084 conditions, 12152 events. 1467/12152 cut-off events. For 30805/33847 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 167961 event pairs, 571 based on Foata normal form. 319/11686 useless extension candidates. Maximal degree in co-relation 29029. Up to 1241 conditions per place. [2022-11-20 12:09:01,599 INFO L137 encePairwiseOnDemand]: 235/248 looper letters, 81 selfloop transitions, 40 changer transitions 12/383 dead transitions. [2022-11-20 12:09:01,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 383 transitions, 2394 flow [2022-11-20 12:09:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:09:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:09:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2829 transitions. [2022-11-20 12:09:01,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8774813895781638 [2022-11-20 12:09:01,606 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2829 transitions. [2022-11-20 12:09:01,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2829 transitions. [2022-11-20 12:09:01,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:01,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2829 transitions. [2022-11-20 12:09:01,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 217.6153846153846) internal successors, (2829), 13 states have internal predecessors, (2829), 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 12:09:01,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 248.0) internal successors, (3472), 14 states have internal predecessors, (3472), 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 12:09:01,623 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 248.0) internal successors, (3472), 14 states have internal predecessors, (3472), 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 12:09:01,623 INFO L175 Difference]: Start difference. First operand has 345 places, 332 transitions, 1707 flow. Second operand 13 states and 2829 transitions. [2022-11-20 12:09:01,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 383 transitions, 2394 flow [2022-11-20 12:09:01,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 383 transitions, 2352 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-11-20 12:09:01,797 INFO L231 Difference]: Finished difference. Result has 362 places, 349 transitions, 2047 flow [2022-11-20 12:09:01,797 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2047, PETRI_PLACES=362, PETRI_TRANSITIONS=349} [2022-11-20 12:09:01,798 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 137 predicate places. [2022-11-20 12:09:01,798 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 349 transitions, 2047 flow [2022-11-20 12:09:01,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 214.33333333333334) internal successors, (1929), 9 states have internal predecessors, (1929), 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 12:09:01,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:01,799 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:01,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:09:01,800 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:09:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1229019474, now seen corresponding path program 4 times [2022-11-20 12:09:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517548560] [2022-11-20 12:09:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:02,147 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 12:09:02,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:02,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517548560] [2022-11-20 12:09:02,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517548560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:02,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:02,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:09:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490754822] [2022-11-20 12:09:02,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:02,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:09:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:02,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:09:02,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:09:02,154 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 248 [2022-11-20 12:09:02,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 349 transitions, 2047 flow. Second operand has 9 states, 9 states have (on average 214.33333333333334) internal successors, (1929), 9 states have internal predecessors, (1929), 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 12:09:02,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:02,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 248 [2022-11-20 12:09:02,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:05,151 INFO L130 PetriNetUnfolder]: 1459/11784 cut-off events. [2022-11-20 12:09:05,151 INFO L131 PetriNetUnfolder]: For 38117/44060 co-relation queries the response was YES. [2022-11-20 12:09:05,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29149 conditions, 11784 events. 1459/11784 cut-off events. For 38117/44060 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 161919 event pairs, 583 based on Foata normal form. 441/11499 useless extension candidates. Maximal degree in co-relation 29086. Up to 1249 conditions per place. [2022-11-20 12:09:05,333 INFO L137 encePairwiseOnDemand]: 235/248 looper letters, 91 selfloop transitions, 37 changer transitions 7/385 dead transitions. [2022-11-20 12:09:05,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 385 transitions, 2609 flow [2022-11-20 12:09:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:09:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:09:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2613 transitions. [2022-11-20 12:09:05,337 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8780241935483871 [2022-11-20 12:09:05,338 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2613 transitions. [2022-11-20 12:09:05,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2613 transitions. [2022-11-20 12:09:05,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:05,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2613 transitions. [2022-11-20 12:09:05,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 217.75) internal successors, (2613), 12 states have internal predecessors, (2613), 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 12:09:05,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 248.0) internal successors, (3224), 13 states have internal predecessors, (3224), 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 12:09:05,349 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 248.0) internal successors, (3224), 13 states have internal predecessors, (3224), 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 12:09:05,349 INFO L175 Difference]: Start difference. First operand has 362 places, 349 transitions, 2047 flow. Second operand 12 states and 2613 transitions. [2022-11-20 12:09:05,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 385 transitions, 2609 flow [2022-11-20 12:09:05,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 385 transitions, 2573 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-11-20 12:09:05,505 INFO L231 Difference]: Finished difference. Result has 376 places, 357 transitions, 2257 flow [2022-11-20 12:09:05,505 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2013, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2257, PETRI_PLACES=376, PETRI_TRANSITIONS=357} [2022-11-20 12:09:05,505 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 151 predicate places. [2022-11-20 12:09:05,506 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 357 transitions, 2257 flow [2022-11-20 12:09:05,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 214.33333333333334) internal successors, (1929), 9 states have internal predecessors, (1929), 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 12:09:05,506 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:05,506 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:05,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:09:05,507 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:09:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1996020904, now seen corresponding path program 5 times [2022-11-20 12:09:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781231739] [2022-11-20 12:09:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:05,789 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 12:09:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:05,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781231739] [2022-11-20 12:09:05,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781231739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:05,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:05,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:09:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418523916] [2022-11-20 12:09:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:05,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:09:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:05,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:09:05,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:09:05,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 248 [2022-11-20 12:09:05,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 357 transitions, 2257 flow. Second operand has 9 states, 9 states have (on average 214.33333333333334) internal successors, (1929), 9 states have internal predecessors, (1929), 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 12:09:05,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:05,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 248 [2022-11-20 12:09:05,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:09,145 INFO L130 PetriNetUnfolder]: 1449/11644 cut-off events. [2022-11-20 12:09:09,145 INFO L131 PetriNetUnfolder]: For 43366/48986 co-relation queries the response was YES. [2022-11-20 12:09:09,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29598 conditions, 11644 events. 1449/11644 cut-off events. For 43366/48986 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 159797 event pairs, 536 based on Foata normal form. 759/11707 useless extension candidates. Maximal degree in co-relation 29529. Up to 926 conditions per place. [2022-11-20 12:09:09,278 INFO L137 encePairwiseOnDemand]: 229/248 looper letters, 88 selfloop transitions, 81 changer transitions 13/432 dead transitions. [2022-11-20 12:09:09,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 432 transitions, 3078 flow [2022-11-20 12:09:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 12:09:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-20 12:09:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4363 transitions. [2022-11-20 12:09:09,290 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8796370967741935 [2022-11-20 12:09:09,290 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4363 transitions. [2022-11-20 12:09:09,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4363 transitions. [2022-11-20 12:09:09,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:09,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4363 transitions. [2022-11-20 12:09:09,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 218.15) internal successors, (4363), 20 states have internal predecessors, (4363), 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 12:09:09,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 248.0) internal successors, (5208), 21 states have internal predecessors, (5208), 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 12:09:09,309 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 248.0) internal successors, (5208), 21 states have internal predecessors, (5208), 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 12:09:09,309 INFO L175 Difference]: Start difference. First operand has 376 places, 357 transitions, 2257 flow. Second operand 20 states and 4363 transitions. [2022-11-20 12:09:09,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 432 transitions, 3078 flow [2022-11-20 12:09:09,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 432 transitions, 3019 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-11-20 12:09:09,513 INFO L231 Difference]: Finished difference. Result has 394 places, 368 transitions, 2567 flow [2022-11-20 12:09:09,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2567, PETRI_PLACES=394, PETRI_TRANSITIONS=368} [2022-11-20 12:09:09,514 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 169 predicate places. [2022-11-20 12:09:09,514 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 368 transitions, 2567 flow [2022-11-20 12:09:09,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 214.33333333333334) internal successors, (1929), 9 states have internal predecessors, (1929), 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 12:09:09,515 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:09,515 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:09,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:09:09,516 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:09:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 730009104, now seen corresponding path program 6 times [2022-11-20 12:09:09,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:09,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719083414] [2022-11-20 12:09:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:09,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:09,743 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 12:09:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:09,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719083414] [2022-11-20 12:09:09,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719083414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:09,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:09,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:09:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245211519] [2022-11-20 12:09:09,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:09,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:09:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:09,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:09:09,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:09:09,748 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 248 [2022-11-20 12:09:09,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 368 transitions, 2567 flow. Second operand has 9 states, 9 states have (on average 214.33333333333334) internal successors, (1929), 9 states have internal predecessors, (1929), 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 12:09:09,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:09,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 248 [2022-11-20 12:09:09,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:12,458 INFO L130 PetriNetUnfolder]: 1506/12399 cut-off events. [2022-11-20 12:09:12,459 INFO L131 PetriNetUnfolder]: For 45106/47886 co-relation queries the response was YES. [2022-11-20 12:09:12,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31173 conditions, 12399 events. 1506/12399 cut-off events. For 45106/47886 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 172077 event pairs, 600 based on Foata normal form. 303/11864 useless extension candidates. Maximal degree in co-relation 31102. Up to 940 conditions per place. [2022-11-20 12:09:12,884 INFO L137 encePairwiseOnDemand]: 234/248 looper letters, 92 selfloop transitions, 37 changer transitions 29/404 dead transitions. [2022-11-20 12:09:12,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 404 transitions, 3109 flow [2022-11-20 12:09:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:09:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:09:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2403 transitions. [2022-11-20 12:09:12,888 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8808651026392962 [2022-11-20 12:09:12,888 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2403 transitions. [2022-11-20 12:09:12,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2403 transitions. [2022-11-20 12:09:12,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:12,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2403 transitions. [2022-11-20 12:09:12,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 218.45454545454547) internal successors, (2403), 11 states have internal predecessors, (2403), 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 12:09:12,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 248.0) internal successors, (2976), 12 states have internal predecessors, (2976), 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 12:09:12,897 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 248.0) internal successors, (2976), 12 states have internal predecessors, (2976), 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 12:09:12,898 INFO L175 Difference]: Start difference. First operand has 394 places, 368 transitions, 2567 flow. Second operand 11 states and 2403 transitions. [2022-11-20 12:09:12,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 404 transitions, 3109 flow [2022-11-20 12:09:13,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 404 transitions, 2962 flow, removed 36 selfloop flow, removed 8 redundant places. [2022-11-20 12:09:13,108 INFO L231 Difference]: Finished difference. Result has 397 places, 349 transitions, 2281 flow [2022-11-20 12:09:13,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2281, PETRI_PLACES=397, PETRI_TRANSITIONS=349} [2022-11-20 12:09:13,109 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 172 predicate places. [2022-11-20 12:09:13,109 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 349 transitions, 2281 flow [2022-11-20 12:09:13,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 214.33333333333334) internal successors, (1929), 9 states have internal predecessors, (1929), 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 12:09:13,110 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:13,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:13,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:09:13,111 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:09:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 492639339, now seen corresponding path program 1 times [2022-11-20 12:09:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968218944] [2022-11-20 12:09:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:13,370 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 12:09:13,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:13,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968218944] [2022-11-20 12:09:13,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968218944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:13,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:13,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:09:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631940862] [2022-11-20 12:09:13,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:09:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:09:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:09:13,377 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 248 [2022-11-20 12:09:13,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 349 transitions, 2281 flow. Second operand has 9 states, 9 states have (on average 217.22222222222223) internal successors, (1955), 9 states have internal predecessors, (1955), 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 12:09:13,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:13,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 248 [2022-11-20 12:09:13,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:17,142 INFO L130 PetriNetUnfolder]: 2798/14739 cut-off events. [2022-11-20 12:09:17,143 INFO L131 PetriNetUnfolder]: For 45883/50216 co-relation queries the response was YES. [2022-11-20 12:09:17,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39771 conditions, 14739 events. 2798/14739 cut-off events. For 45883/50216 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 202062 event pairs, 1320 based on Foata normal form. 571/14270 useless extension candidates. Maximal degree in co-relation 39701. Up to 2765 conditions per place. [2022-11-20 12:09:17,315 INFO L137 encePairwiseOnDemand]: 235/248 looper letters, 53 selfloop transitions, 16 changer transitions 30/393 dead transitions. [2022-11-20 12:09:17,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 393 transitions, 2642 flow [2022-11-20 12:09:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 12:09:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-20 12:09:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3725 transitions. [2022-11-20 12:09:17,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.88353889943074 [2022-11-20 12:09:17,320 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3725 transitions. [2022-11-20 12:09:17,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3725 transitions. [2022-11-20 12:09:17,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:17,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3725 transitions. [2022-11-20 12:09:17,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 219.11764705882354) internal successors, (3725), 17 states have internal predecessors, (3725), 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 12:09:17,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 248.0) internal successors, (4464), 18 states have internal predecessors, (4464), 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 12:09:17,332 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 248.0) internal successors, (4464), 18 states have internal predecessors, (4464), 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 12:09:17,332 INFO L175 Difference]: Start difference. First operand has 397 places, 349 transitions, 2281 flow. Second operand 17 states and 3725 transitions. [2022-11-20 12:09:17,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 393 transitions, 2642 flow [2022-11-20 12:09:17,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 393 transitions, 2473 flow, removed 19 selfloop flow, removed 18 redundant places. [2022-11-20 12:09:17,502 INFO L231 Difference]: Finished difference. Result has 401 places, 337 transitions, 2025 flow [2022-11-20 12:09:17,502 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2025, PETRI_PLACES=401, PETRI_TRANSITIONS=337} [2022-11-20 12:09:17,503 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 176 predicate places. [2022-11-20 12:09:17,503 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 337 transitions, 2025 flow [2022-11-20 12:09:17,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 217.22222222222223) internal successors, (1955), 9 states have internal predecessors, (1955), 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 12:09:17,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:17,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:17,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:09:17,504 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:09:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -710734711, now seen corresponding path program 1 times [2022-11-20 12:09:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:17,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845417187] [2022-11-20 12:09:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:17,557 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 12:09:17,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:17,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845417187] [2022-11-20 12:09:17,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845417187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:17,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:17,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:09:17,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467225601] [2022-11-20 12:09:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:17,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:09:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:09:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:09:17,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 248 [2022-11-20 12:09:17,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 337 transitions, 2025 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 12:09:17,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:17,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 248 [2022-11-20 12:09:17,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:20,012 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([676] L56-21-->L56-22: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork0_#t~ite15#1_3|) InVars {thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_3|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][220], [Black: 611#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 585#(and (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 613#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 589#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0)), 161#L50-22true, Black: 727#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 383#true, Black: 496#(or (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))), 806#true, Black: 580#(<= ~result_9~0 0), 717#true, 530#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 524#(not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))), Black: 257#(and (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), Black: 246#(<= ~result_9~0 0), 776#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 181#L44-22true, 445#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 647#true, Black: 398#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite5#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite4#1| 1) 0)), 92#L77-4true, Black: 649#(or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))), 132#L56-22true, Black: 786#(and (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 659#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0)), Black: 661#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)))), Black: 665#(and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)), Black: 663#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)))), 325#true, 863#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 543#(and (<= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 540#(and (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 538#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 528#true, Black: 427#(and (or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))) (or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)) (and (= 0 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))))), Black: 552#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 420#(or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)) (and (= 0 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))))), Black: 555#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 547#(and (<= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 421#(or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))), Black: 549#(and (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 308#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 303#(<= ~result_9~0 0), 418#true, 494#true, Black: 698#(and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 696#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0)), Black: 451#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)), Black: 830#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 848#(and (<= (+ ~result_10~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 808#(<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0), 574#true, Black: 443#true, Black: 826#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 453#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (<= 1 ~result_11~0)), Black: 846#(and (<= (+ ~result_10~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 839#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 836#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 812#(<= (+ ~result_10~0 1) 0), 242#true, Black: 834#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 329#(or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)), Black: 842#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ ~result_10~0 1) 0)), Black: 338#(and (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0)), Black: 335#(and (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0)), Black: 821#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 327#(<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0), Black: 333#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0)), Black: 475#(or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)), Black: 479#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)), Black: 481#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0))), Black: 357#(<= (+ ~result_10~0 1) 0), Black: 579#(or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)), Black: 592#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 379#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), Black: 587#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)))]) [2022-11-20 12:09:20,013 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-20 12:09:20,013 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:09:20,014 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 12:09:20,014 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:09:20,151 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([676] L56-21-->L56-22: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork0_#t~ite15#1_3|) InVars {thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_3|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][220], [Black: 611#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 585#(and (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 613#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 589#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0)), Black: 727#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), 161#L50-22true, Black: 383#true, Black: 496#(or (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))), 806#true, Black: 580#(<= ~result_9~0 0), 717#true, 530#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 524#(not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))), Black: 257#(and (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), Black: 246#(<= ~result_9~0 0), 776#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 181#L44-22true, 445#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 647#true, Black: 398#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite5#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite4#1| 1) 0)), 92#L77-4true, Black: 649#(or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))), Black: 786#(and (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), 132#L56-22true, Black: 659#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0)), Black: 661#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)))), Black: 665#(and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)), Black: 663#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)))), 325#true, 863#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 543#(and (<= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 540#(and (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 538#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 528#true, Black: 427#(and (or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))) (or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)) (and (= 0 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))))), Black: 552#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 420#(or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)) (and (= 0 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))))), Black: 555#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 547#(and (<= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 421#(or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))), Black: 549#(and (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 308#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 303#(<= ~result_9~0 0), 418#true, 494#true, Black: 698#(and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 696#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0)), Black: 451#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)), Black: 830#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 848#(and (<= (+ ~result_10~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 808#(<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0), 574#true, Black: 443#true, Black: 826#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 453#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (<= 1 ~result_11~0)), Black: 846#(and (<= (+ ~result_10~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 839#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 836#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), 242#true, Black: 812#(<= (+ ~result_10~0 1) 0), Black: 834#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 329#(or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)), Black: 842#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ ~result_10~0 1) 0)), Black: 338#(and (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0)), Black: 821#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 335#(and (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0)), Black: 327#(<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0), Black: 333#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0)), Black: 475#(or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)), Black: 479#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)), Black: 481#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0))), Black: 357#(<= (+ ~result_10~0 1) 0), Black: 579#(or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)), Black: 592#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 587#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 379#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0))]) [2022-11-20 12:09:20,152 INFO L383 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-11-20 12:09:20,152 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:09:20,152 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-20 12:09:20,153 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 12:09:20,153 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:09:20,346 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([676] L56-21-->L56-22: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork0_#t~ite15#1_3|) InVars {thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_3|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][220], [Black: 611#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 585#(and (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 613#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 589#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0)), Black: 727#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), 161#L50-22true, Black: 383#true, Black: 496#(or (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))), 806#true, Black: 580#(<= ~result_9~0 0), 717#true, 530#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 524#(not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))), Black: 257#(and (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), Black: 246#(<= ~result_9~0 0), 776#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 181#L44-22true, 445#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 647#true, Black: 398#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite5#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite4#1| 1) 0)), 92#L77-4true, Black: 649#(or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))), 132#L56-22true, Black: 786#(and (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 659#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0)), Black: 661#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)))), Black: 665#(and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)), Black: 663#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0)))), 325#true, 863#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 543#(and (<= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 540#(and (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 538#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), Black: 528#true, Black: 552#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 427#(and (or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))) (or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)) (and (= 0 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))))), Black: 420#(or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)) (and (= 0 |thread3Thread1of1ForFork0_#t~ite15#1|) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))))), Black: 555#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 547#(and (<= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 421#(or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))), Black: 549#(and (<= |thread1Thread1of1ForFork1_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 308#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 303#(<= ~result_9~0 0), 418#true, 494#true, Black: 698#(and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 696#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 1)) (and (= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))))) (<= ~result_9~0 0)), Black: 451#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)), Black: 830#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 848#(and (<= (+ ~result_10~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 808#(<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0), 574#true, Black: 826#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 443#true, Black: 453#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (<= 1 ~result_11~0)), Black: 846#(and (<= (+ ~result_10~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 839#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 836#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 812#(<= (+ ~result_10~0 1) 0), 242#true, Black: 329#(or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)), Black: 834#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 338#(and (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0)), Black: 842#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ ~result_10~0 1) 0)), Black: 335#(and (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0)), Black: 821#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite7#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite8#1| 1) 0)), Black: 327#(<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0), Black: 333#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite9#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite10#1| 1) 0)), Black: 475#(or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0)), Black: 479#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|)), Black: 481#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= 1 |thread3Thread1of1ForFork0_#t~ite15#1|) (or (<= ~result_10~0 0) (< 0 ~result_11~0) (<= ~result_9~0 0))), Black: 357#(<= (+ ~result_10~0 1) 0), Black: 579#(or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)), Black: 592#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 587#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork1_#t~ite4#1| 0))), Black: 379#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0))]) [2022-11-20 12:09:20,347 INFO L383 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-11-20 12:09:20,347 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:09:20,347 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-20 12:09:20,347 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 12:09:20,347 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:09:20,347 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 12:09:21,948 INFO L130 PetriNetUnfolder]: 1693/16830 cut-off events. [2022-11-20 12:09:21,949 INFO L131 PetriNetUnfolder]: For 54646/59573 co-relation queries the response was YES. [2022-11-20 12:09:22,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43824 conditions, 16830 events. 1693/16830 cut-off events. For 54646/59573 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 243281 event pairs, 889 based on Foata normal form. 253/15813 useless extension candidates. Maximal degree in co-relation 43750. Up to 1752 conditions per place. [2022-11-20 12:09:22,187 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 17 selfloop transitions, 4 changer transitions 0/345 dead transitions. [2022-11-20 12:09:22,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 345 transitions, 2095 flow [2022-11-20 12:09:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:09:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:09:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-20 12:09:22,189 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9475806451612904 [2022-11-20 12:09:22,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-20 12:09:22,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-20 12:09:22,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:22,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-20 12:09:22,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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 12:09:22,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:09:22,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:09:22,193 INFO L175 Difference]: Start difference. First operand has 401 places, 337 transitions, 2025 flow. Second operand 3 states and 705 transitions. [2022-11-20 12:09:22,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 345 transitions, 2095 flow [2022-11-20 12:09:22,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 345 transitions, 2010 flow, removed 24 selfloop flow, removed 18 redundant places. [2022-11-20 12:09:22,644 INFO L231 Difference]: Finished difference. Result has 370 places, 339 transitions, 1969 flow [2022-11-20 12:09:22,645 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1969, PETRI_PLACES=370, PETRI_TRANSITIONS=339} [2022-11-20 12:09:22,645 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 145 predicate places. [2022-11-20 12:09:22,645 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 339 transitions, 1969 flow [2022-11-20 12:09:22,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 12:09:22,645 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:22,645 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:22,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 12:09:22,646 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:09:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash -609873579, now seen corresponding path program 2 times [2022-11-20 12:09:22,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:22,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214866841] [2022-11-20 12:09:22,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:22,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:22,692 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 12:09:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:22,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214866841] [2022-11-20 12:09:22,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214866841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:22,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:22,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:09:22,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696226633] [2022-11-20 12:09:22,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:22,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:09:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:22,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:09:22,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:09:22,698 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 248 [2022-11-20 12:09:22,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 339 transitions, 1969 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 12:09:22,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:22,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 248 [2022-11-20 12:09:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:25,889 INFO L130 PetriNetUnfolder]: 1288/15714 cut-off events. [2022-11-20 12:09:25,889 INFO L131 PetriNetUnfolder]: For 30100/32992 co-relation queries the response was YES. [2022-11-20 12:09:26,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34538 conditions, 15714 events. 1288/15714 cut-off events. For 30100/32992 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 218386 event pairs, 856 based on Foata normal form. 279/14911 useless extension candidates. Maximal degree in co-relation 34473. Up to 1335 conditions per place. [2022-11-20 12:09:26,064 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 21 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2022-11-20 12:09:26,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 347 transitions, 2046 flow [2022-11-20 12:09:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:09:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:09:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-20 12:09:26,066 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9475806451612904 [2022-11-20 12:09:26,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-20 12:09:26,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-20 12:09:26,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:26,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-20 12:09:26,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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 12:09:26,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:09:26,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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 12:09:26,068 INFO L175 Difference]: Start difference. First operand has 370 places, 339 transitions, 1969 flow. Second operand 3 states and 705 transitions. [2022-11-20 12:09:26,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 347 transitions, 2046 flow [2022-11-20 12:09:26,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 347 transitions, 2034 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-20 12:09:26,222 INFO L231 Difference]: Finished difference. Result has 372 places, 341 transitions, 1981 flow [2022-11-20 12:09:26,222 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1981, PETRI_PLACES=372, PETRI_TRANSITIONS=341} [2022-11-20 12:09:26,223 INFO L288 CegarLoopForPetriNet]: 225 programPoint places, 147 predicate places. [2022-11-20 12:09:26,223 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 341 transitions, 1981 flow [2022-11-20 12:09:26,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 12:09:26,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:26,223 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:26,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 12:09:26,224 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:09:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1244095378, now seen corresponding path program 1 times [2022-11-20 12:09:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:26,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126415644] [2022-11-20 12:09:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:26,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:26,806 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 12:09:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:26,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126415644] [2022-11-20 12:09:26,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126415644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:26,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:26,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:09:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395522791] [2022-11-20 12:09:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:26,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:09:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:09:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:09:26,812 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 248 [2022-11-20 12:09:26,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 341 transitions, 1981 flow. Second operand has 10 states, 10 states have (on average 213.4) internal successors, (2134), 10 states have internal predecessors, (2134), 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 12:09:26,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:26,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 248 [2022-11-20 12:09:26,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand