./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:45:53,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:45:53,565 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:45:53,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:45:53,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:45:53,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:45:53,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:45:53,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:45:53,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:45:53,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:45:53,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:45:53,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:45:53,619 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:45:53,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:45:53,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:45:53,622 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:45:53,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:45:53,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:45:53,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:45:53,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:45:53,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:45:53,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:45:53,628 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:45:53,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:45:53,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:45:53,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:45:53,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:45:53,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:45:53,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:53,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:45:53,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:45:53,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:45:53,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:45:53,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:45:53,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:45:53,637 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:45:53,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:45:53,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:45:53,638 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:45:53,638 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/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_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2023-11-19 07:45:53,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:45:54,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:45:54,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:45:54,069 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:45:54,069 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:45:54,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:45:57,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:45:57,642 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:45:57,643 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:45:57,671 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/data/9ea23b926/f29291f038834992ab920cb2b9a2a7fd/FLAG0961bfd31 [2023-11-19 07:45:57,697 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/data/9ea23b926/f29291f038834992ab920cb2b9a2a7fd [2023-11-19 07:45:57,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:45:57,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:45:57,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:57,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:45:57,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:45:57,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:57" (1/1) ... [2023-11-19 07:45:57,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c24dbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:57, skipping insertion in model container [2023-11-19 07:45:57,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:57" (1/1) ... [2023-11-19 07:45:57,778 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:45:57,972 WARN L240 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_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-19 07:45:58,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:58,275 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:45:58,290 WARN L240 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_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-19 07:45:58,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:58,392 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:58,393 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:58,402 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:45:58,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58 WrapperNode [2023-11-19 07:45:58,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:58,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:58,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:45:58,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:45:58,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,471 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-19 07:45:58,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:58,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:45:58,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:45:58,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:45:58,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:45:58,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:45:58,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:45:58,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:45:58,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (1/1) ... [2023-11-19 07:45:58,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:58,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:58,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:45:58,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:45:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:45:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:45:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:45:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:45:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:45:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:45:58,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:45:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:45:58,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:45:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:45:58,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:45:58,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:45:58,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:45:58,648 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:45:58,895 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:45:58,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:45:59,283 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:45:59,475 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:45:59,476 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:45:59,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:59 BoogieIcfgContainer [2023-11-19 07:45:59,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:45:59,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:45:59,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:45:59,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:45:59,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:45:57" (1/3) ... [2023-11-19 07:45:59,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe8a226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:59, skipping insertion in model container [2023-11-19 07:45:59,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:58" (2/3) ... [2023-11-19 07:45:59,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe8a226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:59, skipping insertion in model container [2023-11-19 07:45:59,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:59" (3/3) ... [2023-11-19 07:45:59,517 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:45:59,527 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:45:59,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:45:59,539 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:45:59,539 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:45:59,594 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:45:59,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 90 transitions, 188 flow [2023-11-19 07:45:59,728 INFO L124 PetriNetUnfolderBase]: 3/88 cut-off events. [2023-11-19 07:45:59,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:59,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 3/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-11-19 07:45:59,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 90 transitions, 188 flow [2023-11-19 07:45:59,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 88 transitions, 182 flow [2023-11-19 07:45:59,743 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:45:59,765 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 88 transitions, 182 flow [2023-11-19 07:45:59,771 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 88 transitions, 182 flow [2023-11-19 07:45:59,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 182 flow [2023-11-19 07:45:59,815 INFO L124 PetriNetUnfolderBase]: 3/88 cut-off events. [2023-11-19 07:45:59,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:59,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 3/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-11-19 07:45:59,818 INFO L119 LiptonReduction]: Number of co-enabled transitions 1216 [2023-11-19 07:46:04,919 INFO L134 LiptonReduction]: Checked pairs total: 2953 [2023-11-19 07:46:04,920 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-11-19 07:46:04,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:46:04,946 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=LoopHeads, 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;@20de657f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:46:04,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 07:46:04,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:46:04,952 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-19 07:46:04,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:46:04,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:04,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:46:04,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:04,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 395452537, now seen corresponding path program 1 times [2023-11-19 07:46:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575700161] [2023-11-19 07:46:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:04,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575700161] [2023-11-19 07:46:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575700161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:05,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:05,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:46:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377584184] [2023-11-19 07:46:05,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:05,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:46:05,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:05,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:46:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:46:05,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 173 [2023-11-19 07:46:05,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:05,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:05,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 173 [2023-11-19 07:46:05,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:05,827 INFO L124 PetriNetUnfolderBase]: 111/221 cut-off events. [2023-11-19 07:46:05,832 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 07:46:05,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 221 events. 111/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 882 event pairs, 18 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 425. Up to 154 conditions per place. [2023-11-19 07:46:05,838 INFO L140 encePairwiseOnDemand]: 170/173 looper letters, 17 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2023-11-19 07:46:05,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 94 flow [2023-11-19 07:46:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:46:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:46:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-11-19 07:46:05,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48747591522157996 [2023-11-19 07:46:05,864 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-11-19 07:46:05,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-11-19 07:46:05,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:05,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-11-19 07:46:05,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:05,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:05,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:05,887 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 253 transitions. [2023-11-19 07:46:05,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 94 flow [2023-11-19 07:46:05,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:46:05,894 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-11-19 07:46:05,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-11-19 07:46:05,902 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-19 07:46:05,902 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-11-19 07:46:05,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:05,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:05,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:05,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:46:05,904 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:05,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2072825381, now seen corresponding path program 1 times [2023-11-19 07:46:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:05,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80923171] [2023-11-19 07:46:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80923171] [2023-11-19 07:46:06,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80923171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:06,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:06,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:46:06,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509178199] [2023-11-19 07:46:06,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:06,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:46:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:06,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:46:06,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:46:06,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 173 [2023-11-19 07:46:06,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:06,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:06,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 173 [2023-11-19 07:46:06,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:06,379 INFO L124 PetriNetUnfolderBase]: 107/202 cut-off events. [2023-11-19 07:46:06,380 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-19 07:46:06,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 202 events. 107/202 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 701 event pairs, 41 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 415. Up to 184 conditions per place. [2023-11-19 07:46:06,389 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 18 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2023-11-19 07:46:06,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 98 flow [2023-11-19 07:46:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:46:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:46:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-11-19 07:46:06,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47591522157996147 [2023-11-19 07:46:06,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-11-19 07:46:06,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-11-19 07:46:06,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:06,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-11-19 07:46:06,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:06,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:06,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:06,410 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 247 transitions. [2023-11-19 07:46:06,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 98 flow [2023-11-19 07:46:06,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:46:06,413 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2023-11-19 07:46:06,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-11-19 07:46:06,416 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-19 07:46:06,416 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2023-11-19 07:46:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:06,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:06,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:06,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:46:06,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:06,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash -166923459, now seen corresponding path program 1 times [2023-11-19 07:46:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025615894] [2023-11-19 07:46:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:07,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025615894] [2023-11-19 07:46:07,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025615894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:07,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:07,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:46:07,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035602410] [2023-11-19 07:46:07,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:07,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:07,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:07,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:07,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:07,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 173 [2023-11-19 07:46:07,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:07,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 173 [2023-11-19 07:46:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:07,279 INFO L124 PetriNetUnfolderBase]: 119/227 cut-off events. [2023-11-19 07:46:07,280 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-19 07:46:07,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 227 events. 119/227 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 771 event pairs, 49 based on Foata normal form. 1/228 useless extension candidates. Maximal degree in co-relation 513. Up to 194 conditions per place. [2023-11-19 07:46:07,283 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 19 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-11-19 07:46:07,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 116 flow [2023-11-19 07:46:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:46:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:46:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-11-19 07:46:07,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701348747591522 [2023-11-19 07:46:07,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-11-19 07:46:07,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-11-19 07:46:07,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:07,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-11-19 07:46:07,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,291 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states and 244 transitions. [2023-11-19 07:46:07,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 116 flow [2023-11-19 07:46:07,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:46:07,293 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 69 flow [2023-11-19 07:46:07,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-11-19 07:46:07,294 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2023-11-19 07:46:07,295 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 69 flow [2023-11-19 07:46:07,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:07,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:07,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:46:07,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:07,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:07,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1004832330, now seen corresponding path program 1 times [2023-11-19 07:46:07,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:07,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248936848] [2023-11-19 07:46:07,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:07,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:07,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248936848] [2023-11-19 07:46:07,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248936848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:07,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:07,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:46:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759384823] [2023-11-19 07:46:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:07,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:07,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:07,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 173 [2023-11-19 07:46:07,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:07,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 173 [2023-11-19 07:46:07,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:07,972 INFO L124 PetriNetUnfolderBase]: 119/228 cut-off events. [2023-11-19 07:46:07,972 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-19 07:46:07,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 228 events. 119/228 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 778 event pairs, 21 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 574. Up to 162 conditions per place. [2023-11-19 07:46:07,977 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 22 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2023-11-19 07:46:07,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 161 flow [2023-11-19 07:46:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:46:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2023-11-19 07:46:07,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47398843930635837 [2023-11-19 07:46:07,980 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 328 transitions. [2023-11-19 07:46:07,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 328 transitions. [2023-11-19 07:46:07,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:07,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 328 transitions. [2023-11-19 07:46:07,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,986 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 69 flow. Second operand 4 states and 328 transitions. [2023-11-19 07:46:07,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 161 flow [2023-11-19 07:46:07,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:46:07,990 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 98 flow [2023-11-19 07:46:07,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-11-19 07:46:07,992 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2023-11-19 07:46:07,992 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 98 flow [2023-11-19 07:46:07,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:07,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:07,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:07,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:46:07,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:07,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1004799780, now seen corresponding path program 2 times [2023-11-19 07:46:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174255817] [2023-11-19 07:46:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:08,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:08,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174255817] [2023-11-19 07:46:08,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174255817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:08,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:08,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739162273] [2023-11-19 07:46:08,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:08,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:08,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 173 [2023-11-19 07:46:08,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:08,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:08,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 173 [2023-11-19 07:46:08,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:09,191 INFO L124 PetriNetUnfolderBase]: 110/206 cut-off events. [2023-11-19 07:46:09,191 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-11-19 07:46:09,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 206 events. 110/206 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 729 event pairs, 40 based on Foata normal form. 4/202 useless extension candidates. Maximal degree in co-relation 585. Up to 171 conditions per place. [2023-11-19 07:46:09,195 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 23 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2023-11-19 07:46:09,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 199 flow [2023-11-19 07:46:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:46:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:46:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 447 transitions. [2023-11-19 07:46:09,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430635838150289 [2023-11-19 07:46:09,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 447 transitions. [2023-11-19 07:46:09,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 447 transitions. [2023-11-19 07:46:09,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:09,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 447 transitions. [2023-11-19 07:46:09,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:09,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:09,207 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:09,207 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 98 flow. Second operand 6 states and 447 transitions. [2023-11-19 07:46:09,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 199 flow [2023-11-19 07:46:09,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 192 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 07:46:09,212 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 127 flow [2023-11-19 07:46:09,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-19 07:46:09,213 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2023-11-19 07:46:09,214 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 127 flow [2023-11-19 07:46:09,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:09,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:09,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:09,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:46:09,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:09,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:09,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1003871454, now seen corresponding path program 1 times [2023-11-19 07:46:09,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:09,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036101921] [2023-11-19 07:46:09,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:09,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:09,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:09,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036101921] [2023-11-19 07:46:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036101921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:09,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:09,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314880948] [2023-11-19 07:46:09,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:09,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:09,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 173 [2023-11-19 07:46:09,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:09,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:09,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 173 [2023-11-19 07:46:09,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:10,117 INFO L124 PetriNetUnfolderBase]: 86/171 cut-off events. [2023-11-19 07:46:10,117 INFO L125 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2023-11-19 07:46:10,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 171 events. 86/171 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 553 event pairs, 32 based on Foata normal form. 3/171 useless extension candidates. Maximal degree in co-relation 558. Up to 142 conditions per place. [2023-11-19 07:46:10,120 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 24 selfloop transitions, 9 changer transitions 0/35 dead transitions. [2023-11-19 07:46:10,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 237 flow [2023-11-19 07:46:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:46:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:46:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 391 transitions. [2023-11-19 07:46:10,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45202312138728323 [2023-11-19 07:46:10,124 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 391 transitions. [2023-11-19 07:46:10,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 391 transitions. [2023-11-19 07:46:10,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:10,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 391 transitions. [2023-11-19 07:46:10,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.2) internal successors, (391), 5 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:10,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:10,130 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:10,131 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 127 flow. Second operand 5 states and 391 transitions. [2023-11-19 07:46:10,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 237 flow [2023-11-19 07:46:10,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 218 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-19 07:46:10,135 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 157 flow [2023-11-19 07:46:10,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-11-19 07:46:10,136 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2023-11-19 07:46:10,136 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 157 flow [2023-11-19 07:46:10,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:10,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:10,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:10,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:46:10,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:10,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1004410519, now seen corresponding path program 1 times [2023-11-19 07:46:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18566585] [2023-11-19 07:46:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:10,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18566585] [2023-11-19 07:46:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18566585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:10,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646476115] [2023-11-19 07:46:10,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:10,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:10,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:10,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:10,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:10,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 173 [2023-11-19 07:46:10,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:10,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:10,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 173 [2023-11-19 07:46:10,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:10,978 INFO L124 PetriNetUnfolderBase]: 83/165 cut-off events. [2023-11-19 07:46:10,978 INFO L125 PetriNetUnfolderBase]: For 311/313 co-relation queries the response was YES. [2023-11-19 07:46:10,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 165 events. 83/165 cut-off events. For 311/313 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 522 event pairs, 24 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 615. Up to 129 conditions per place. [2023-11-19 07:46:10,981 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 27 selfloop transitions, 12 changer transitions 0/41 dead transitions. [2023-11-19 07:46:10,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 309 flow [2023-11-19 07:46:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:46:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:46:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 552 transitions. [2023-11-19 07:46:10,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558216350123865 [2023-11-19 07:46:10,985 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 552 transitions. [2023-11-19 07:46:10,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 552 transitions. [2023-11-19 07:46:10,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:10,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 552 transitions. [2023-11-19 07:46:10,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:10,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:10,992 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:10,992 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 157 flow. Second operand 7 states and 552 transitions. [2023-11-19 07:46:10,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 309 flow [2023-11-19 07:46:10,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 304 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 07:46:11,000 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 215 flow [2023-11-19 07:46:11,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=215, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-19 07:46:11,001 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 20 predicate places. [2023-11-19 07:46:11,002 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 215 flow [2023-11-19 07:46:11,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:11,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:11,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:11,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:46:11,003 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:11,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1796635973, now seen corresponding path program 1 times [2023-11-19 07:46:11,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:11,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141414622] [2023-11-19 07:46:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:11,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:11,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:11,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141414622] [2023-11-19 07:46:11,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141414622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:11,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:11,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:46:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72249549] [2023-11-19 07:46:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:11,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:11,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:11,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 173 [2023-11-19 07:46:11,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:11,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:11,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 173 [2023-11-19 07:46:11,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:11,725 INFO L124 PetriNetUnfolderBase]: 126/254 cut-off events. [2023-11-19 07:46:11,725 INFO L125 PetriNetUnfolderBase]: For 842/843 co-relation queries the response was YES. [2023-11-19 07:46:11,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 254 events. 126/254 cut-off events. For 842/843 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 976 event pairs, 38 based on Foata normal form. 13/267 useless extension candidates. Maximal degree in co-relation 1034. Up to 138 conditions per place. [2023-11-19 07:46:11,729 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 31 selfloop transitions, 6 changer transitions 8/48 dead transitions. [2023-11-19 07:46:11,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 403 flow [2023-11-19 07:46:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:46:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2023-11-19 07:46:11,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479768786127168 [2023-11-19 07:46:11,733 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 310 transitions. [2023-11-19 07:46:11,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 310 transitions. [2023-11-19 07:46:11,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:11,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 310 transitions. [2023-11-19 07:46:11,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:11,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:11,738 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:11,738 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 215 flow. Second operand 4 states and 310 transitions. [2023-11-19 07:46:11,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 403 flow [2023-11-19 07:46:11,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 369 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-19 07:46:11,744 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 218 flow [2023-11-19 07:46:11,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-11-19 07:46:11,749 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 22 predicate places. [2023-11-19 07:46:11,749 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 218 flow [2023-11-19 07:46:11,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:11,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:11,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:11,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:46:11,750 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:11,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:11,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1293181599, now seen corresponding path program 1 times [2023-11-19 07:46:11,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:11,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439685094] [2023-11-19 07:46:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:12,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:12,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439685094] [2023-11-19 07:46:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439685094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:12,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108506661] [2023-11-19 07:46:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:12,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:12,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:12,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 173 [2023-11-19 07:46:12,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:12,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:12,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 173 [2023-11-19 07:46:12,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:12,677 INFO L124 PetriNetUnfolderBase]: 112/231 cut-off events. [2023-11-19 07:46:12,677 INFO L125 PetriNetUnfolderBase]: For 660/662 co-relation queries the response was YES. [2023-11-19 07:46:12,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 231 events. 112/231 cut-off events. For 660/662 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 856 event pairs, 61 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 964. Up to 199 conditions per place. [2023-11-19 07:46:12,680 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 26 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2023-11-19 07:46:12,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 308 flow [2023-11-19 07:46:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:46:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 324 transitions. [2023-11-19 07:46:12,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682080924855491 [2023-11-19 07:46:12,684 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 324 transitions. [2023-11-19 07:46:12,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 324 transitions. [2023-11-19 07:46:12,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:12,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 324 transitions. [2023-11-19 07:46:12,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:12,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:12,688 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:12,688 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 218 flow. Second operand 4 states and 324 transitions. [2023-11-19 07:46:12,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 308 flow [2023-11-19 07:46:12,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 298 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-19 07:46:12,693 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 233 flow [2023-11-19 07:46:12,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-11-19 07:46:12,693 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 25 predicate places. [2023-11-19 07:46:12,694 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 233 flow [2023-11-19 07:46:12,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:12,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:12,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:12,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:46:12,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:12,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash 635950173, now seen corresponding path program 1 times [2023-11-19 07:46:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:12,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709642723] [2023-11-19 07:46:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:13,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:13,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709642723] [2023-11-19 07:46:13,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709642723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:13,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702222998] [2023-11-19 07:46:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:13,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:46:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:13,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:46:13,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:46:13,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 173 [2023-11-19 07:46:13,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:13,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:13,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 173 [2023-11-19 07:46:13,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:13,535 INFO L124 PetriNetUnfolderBase]: 119/244 cut-off events. [2023-11-19 07:46:13,535 INFO L125 PetriNetUnfolderBase]: For 804/808 co-relation queries the response was YES. [2023-11-19 07:46:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 244 events. 119/244 cut-off events. For 804/808 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 945 event pairs, 31 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 1030. Up to 188 conditions per place. [2023-11-19 07:46:13,538 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 21 selfloop transitions, 10 changer transitions 8/41 dead transitions. [2023-11-19 07:46:13,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 363 flow [2023-11-19 07:46:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:46:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:46:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions. [2023-11-19 07:46:13,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4578034682080925 [2023-11-19 07:46:13,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 396 transitions. [2023-11-19 07:46:13,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 396 transitions. [2023-11-19 07:46:13,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:13,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 396 transitions. [2023-11-19 07:46:13,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:13,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:13,547 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:13,548 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 233 flow. Second operand 5 states and 396 transitions. [2023-11-19 07:46:13,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 363 flow [2023-11-19 07:46:13,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 347 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:46:13,553 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 222 flow [2023-11-19 07:46:13,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2023-11-19 07:46:13,555 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 27 predicate places. [2023-11-19 07:46:13,556 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 222 flow [2023-11-19 07:46:13,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:13,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:13,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:13,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:46:13,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:13,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1071920955, now seen corresponding path program 2 times [2023-11-19 07:46:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80611866] [2023-11-19 07:46:13,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:13,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:14,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:14,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80611866] [2023-11-19 07:46:14,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80611866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:14,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:14,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:14,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495133023] [2023-11-19 07:46:14,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:14,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:46:14,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:14,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:46:14,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:46:14,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 173 [2023-11-19 07:46:14,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 28 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 68.57142857142857) internal successors, (480), 7 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:14,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:14,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 173 [2023-11-19 07:46:14,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:14,612 INFO L124 PetriNetUnfolderBase]: 133/257 cut-off events. [2023-11-19 07:46:14,613 INFO L125 PetriNetUnfolderBase]: For 1091/1091 co-relation queries the response was YES. [2023-11-19 07:46:14,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 257 events. 133/257 cut-off events. For 1091/1091 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 946 event pairs, 30 based on Foata normal form. 4/261 useless extension candidates. Maximal degree in co-relation 1157. Up to 150 conditions per place. [2023-11-19 07:46:14,616 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 18 selfloop transitions, 10 changer transitions 12/40 dead transitions. [2023-11-19 07:46:14,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 40 transitions, 382 flow [2023-11-19 07:46:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:46:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:46:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2023-11-19 07:46:14,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41184971098265893 [2023-11-19 07:46:14,621 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 570 transitions. [2023-11-19 07:46:14,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 570 transitions. [2023-11-19 07:46:14,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:14,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 570 transitions. [2023-11-19 07:46:14,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 71.25) internal successors, (570), 8 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:14,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:14,629 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:14,630 INFO L175 Difference]: Start difference. First operand has 51 places, 28 transitions, 222 flow. Second operand 8 states and 570 transitions. [2023-11-19 07:46:14,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 40 transitions, 382 flow [2023-11-19 07:46:14,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 356 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-19 07:46:14,637 INFO L231 Difference]: Finished difference. Result has 53 places, 22 transitions, 193 flow [2023-11-19 07:46:14,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=53, PETRI_TRANSITIONS=22} [2023-11-19 07:46:14,638 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 29 predicate places. [2023-11-19 07:46:14,639 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 22 transitions, 193 flow [2023-11-19 07:46:14,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.57142857142857) internal successors, (480), 7 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:14,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:14,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:14,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:46:14,640 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:14,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1150869338, now seen corresponding path program 1 times [2023-11-19 07:46:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:14,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904691072] [2023-11-19 07:46:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904691072] [2023-11-19 07:46:15,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904691072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:15,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:46:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853429944] [2023-11-19 07:46:15,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:15,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:15,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:15,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:15,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:15,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 173 [2023-11-19 07:46:15,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 22 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:15,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 173 [2023-11-19 07:46:15,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:15,187 INFO L124 PetriNetUnfolderBase]: 62/124 cut-off events. [2023-11-19 07:46:15,187 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2023-11-19 07:46:15,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 124 events. 62/124 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 36 based on Foata normal form. 2/126 useless extension candidates. Maximal degree in co-relation 607. Up to 103 conditions per place. [2023-11-19 07:46:15,190 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 16 selfloop transitions, 9 changer transitions 0/26 dead transitions. [2023-11-19 07:46:15,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 26 transitions, 265 flow [2023-11-19 07:46:15,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:46:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:46:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2023-11-19 07:46:15,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4508670520231214 [2023-11-19 07:46:15,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 390 transitions. [2023-11-19 07:46:15,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 390 transitions. [2023-11-19 07:46:15,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:15,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 390 transitions. [2023-11-19 07:46:15,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,200 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,200 INFO L175 Difference]: Start difference. First operand has 53 places, 22 transitions, 193 flow. Second operand 5 states and 390 transitions. [2023-11-19 07:46:15,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 26 transitions, 265 flow [2023-11-19 07:46:15,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 26 transitions, 215 flow, removed 12 selfloop flow, removed 13 redundant places. [2023-11-19 07:46:15,206 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 186 flow [2023-11-19 07:46:15,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-11-19 07:46:15,207 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2023-11-19 07:46:15,208 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 186 flow [2023-11-19 07:46:15,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:15,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:15,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:46:15,209 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:15,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash -101422435, now seen corresponding path program 1 times [2023-11-19 07:46:15,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:15,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253711547] [2023-11-19 07:46:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:15,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253711547] [2023-11-19 07:46:15,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253711547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:15,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:15,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:15,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641122768] [2023-11-19 07:46:15,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:15,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:15,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:15,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 173 [2023-11-19 07:46:15,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:15,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 173 [2023-11-19 07:46:15,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:15,710 INFO L124 PetriNetUnfolderBase]: 27/71 cut-off events. [2023-11-19 07:46:15,710 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2023-11-19 07:46:15,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 71 events. 27/71 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 173 event pairs, 3 based on Foata normal form. 7/78 useless extension candidates. Maximal degree in co-relation 335. Up to 55 conditions per place. [2023-11-19 07:46:15,712 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 22 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-11-19 07:46:15,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 29 transitions, 261 flow [2023-11-19 07:46:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:46:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:46:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2023-11-19 07:46:15,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4323699421965318 [2023-11-19 07:46:15,716 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 374 transitions. [2023-11-19 07:46:15,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 374 transitions. [2023-11-19 07:46:15,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:15,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 374 transitions. [2023-11-19 07:46:15,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,721 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 186 flow. Second operand 5 states and 374 transitions. [2023-11-19 07:46:15,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 29 transitions, 261 flow [2023-11-19 07:46:15,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 239 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-19 07:46:15,725 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 166 flow [2023-11-19 07:46:15,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2023-11-19 07:46:15,726 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 18 predicate places. [2023-11-19 07:46:15,727 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 166 flow [2023-11-19 07:46:15,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:15,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:15,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:46:15,728 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:15,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1150474491, now seen corresponding path program 1 times [2023-11-19 07:46:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330161345] [2023-11-19 07:46:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330161345] [2023-11-19 07:46:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330161345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:46:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494054070] [2023-11-19 07:46:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:15,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:15,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:15,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 173 [2023-11-19 07:46:15,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:15,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:15,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 173 [2023-11-19 07:46:15,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:16,038 INFO L124 PetriNetUnfolderBase]: 8/32 cut-off events. [2023-11-19 07:46:16,038 INFO L125 PetriNetUnfolderBase]: For 124/125 co-relation queries the response was YES. [2023-11-19 07:46:16,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 32 events. 8/32 cut-off events. For 124/125 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 1 based on Foata normal form. 8/40 useless extension candidates. Maximal degree in co-relation 145. Up to 14 conditions per place. [2023-11-19 07:46:16,040 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 18 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-11-19 07:46:16,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 26 transitions, 232 flow [2023-11-19 07:46:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:46:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2023-11-19 07:46:16,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46098265895953755 [2023-11-19 07:46:16,043 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 319 transitions. [2023-11-19 07:46:16,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 319 transitions. [2023-11-19 07:46:16,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:16,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 319 transitions. [2023-11-19 07:46:16,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:16,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:16,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:16,049 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 166 flow. Second operand 4 states and 319 transitions. [2023-11-19 07:46:16,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 26 transitions, 232 flow [2023-11-19 07:46:16,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 177 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-11-19 07:46:16,052 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 126 flow [2023-11-19 07:46:16,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-11-19 07:46:16,053 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2023-11-19 07:46:16,053 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 126 flow [2023-11-19 07:46:16,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:16,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:16,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:16,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:46:16,055 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:16,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -535473515, now seen corresponding path program 1 times [2023-11-19 07:46:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:16,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867658250] [2023-11-19 07:46:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:46:16,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867658250] [2023-11-19 07:46:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867658250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:16,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:16,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213455358] [2023-11-19 07:46:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:16,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:46:16,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:16,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:46:16,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:46:16,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 173 [2023-11-19 07:46:16,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:16,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:16,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 173 [2023-11-19 07:46:16,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:17,108 INFO L124 PetriNetUnfolderBase]: 9/40 cut-off events. [2023-11-19 07:46:17,109 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-19 07:46:17,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 40 events. 9/40 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 157. Up to 19 conditions per place. [2023-11-19 07:46:17,109 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 15 selfloop transitions, 4 changer transitions 9/29 dead transitions. [2023-11-19 07:46:17,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 224 flow [2023-11-19 07:46:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:46:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:46:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2023-11-19 07:46:17,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4416184971098266 [2023-11-19 07:46:17,113 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 382 transitions. [2023-11-19 07:46:17,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 382 transitions. [2023-11-19 07:46:17,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:17,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 382 transitions. [2023-11-19 07:46:17,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:17,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:17,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:17,119 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 126 flow. Second operand 5 states and 382 transitions. [2023-11-19 07:46:17,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 224 flow [2023-11-19 07:46:17,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 200 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-19 07:46:17,121 INFO L231 Difference]: Finished difference. Result has 39 places, 19 transitions, 103 flow [2023-11-19 07:46:17,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=39, PETRI_TRANSITIONS=19} [2023-11-19 07:46:17,122 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2023-11-19 07:46:17,122 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 19 transitions, 103 flow [2023-11-19 07:46:17,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:17,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:17,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:17,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:46:17,124 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:46:17,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:17,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1976072595, now seen corresponding path program 2 times [2023-11-19 07:46:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:17,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635490524] [2023-11-19 07:46:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:17,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:46:17,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:46:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:46:17,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:46:17,291 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:46:17,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-19 07:46:17,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 07:46:17,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-19 07:46:17,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-19 07:46:17,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 07:46:17,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:46:17,297 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:17,305 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:46:17,305 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:46:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:46:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:46:17,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:46:17 BasicIcfg [2023-11-19 07:46:17,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:46:17,388 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:46:17,389 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:46:17,389 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:46:17,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:59" (3/4) ... [2023-11-19 07:46:17,391 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:46:17,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:46:17,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:46:17,512 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:46:17,513 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:46:17,513 INFO L158 Benchmark]: Toolchain (without parser) took 19809.99ms. Allocated memory was 211.8MB in the beginning and 461.4MB in the end (delta: 249.6MB). Free memory was 164.1MB in the beginning and 402.4MB in the end (delta: -238.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2023-11-19 07:46:17,514 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 211.8MB. Free memory is still 186.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:46:17,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 698.01ms. Allocated memory is still 211.8MB. Free memory was 163.9MB in the beginning and 141.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:46:17,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.54ms. Allocated memory is still 211.8MB. Free memory was 141.3MB in the beginning and 138.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:46:17,515 INFO L158 Benchmark]: Boogie Preprocessor took 44.58ms. Allocated memory is still 211.8MB. Free memory was 138.5MB in the beginning and 136.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:46:17,516 INFO L158 Benchmark]: RCFGBuilder took 962.76ms. Allocated memory is still 211.8MB. Free memory was 136.6MB in the beginning and 104.2MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-19 07:46:17,516 INFO L158 Benchmark]: TraceAbstraction took 17878.67ms. Allocated memory was 211.8MB in the beginning and 461.4MB in the end (delta: 249.6MB). Free memory was 179.9MB in the beginning and 408.7MB in the end (delta: -228.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-11-19 07:46:17,517 INFO L158 Benchmark]: Witness Printer took 124.35ms. Allocated memory is still 461.4MB. Free memory was 408.7MB in the beginning and 402.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:46:17,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 211.8MB. Free memory is still 186.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 698.01ms. Allocated memory is still 211.8MB. Free memory was 163.9MB in the beginning and 141.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.54ms. Allocated memory is still 211.8MB. Free memory was 141.3MB in the beginning and 138.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.58ms. Allocated memory is still 211.8MB. Free memory was 138.5MB in the beginning and 136.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 962.76ms. Allocated memory is still 211.8MB. Free memory was 136.6MB in the beginning and 104.2MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17878.67ms. Allocated memory was 211.8MB in the beginning and 461.4MB in the end (delta: 249.6MB). Free memory was 179.9MB in the beginning and 408.7MB in the end (delta: -228.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Witness Printer took 124.35ms. Allocated memory is still 461.4MB. Free memory was 408.7MB in the beginning and 402.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 92 PlacesBefore, 24 PlacesAfterwards, 88 TransitionsBefore, 17 TransitionsAfterwards, 1216 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, 2953 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1308, independent: 1172, independent conditional: 0, independent unconditional: 1172, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 641, independent: 615, independent conditional: 0, independent unconditional: 615, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1308, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 641, unknown conditional: 0, unknown unconditional: 641] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 107 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 366 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1053 IncrementalHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 97 mSDtfsCounter, 1053 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=9, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 2030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 07:46:17,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d19307f-ecfb-4b0d-8948-8e92ba4f4b02/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE