./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/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_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/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_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/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 a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:45:12,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:45:12,713 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:45:12,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:45:12,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:45:12,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:45:12,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:45:12,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:45:12,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:45:12,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:45:12,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:45:12,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:45:12,774 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:45:12,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:45:12,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:45:12,776 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:45:12,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:45:12,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:45:12,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:45:12,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:45:12,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:45:12,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:45:12,779 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:45:12,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:45:12,780 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:45:12,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:45:12,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:45:12,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:45:12,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:12,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:45:12,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:45:12,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:45:12,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:45:12,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:45:12,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:45:12,786 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:45:12,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:45:12,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:45:12,786 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:45:12,787 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_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/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_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/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 -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 [2023-11-19 07:45:13,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:45:13,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:45:13,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:45:13,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:45:13,209 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:45:13,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix055.opt.i [2023-11-19 07:45:16,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:45:16,737 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:45:16,738 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/sv-benchmarks/c/pthread-wmm/mix055.opt.i [2023-11-19 07:45:16,757 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/data/ecb089b3d/a2e82a7fac294291949787150dd07fcd/FLAGc09cdd67d [2023-11-19 07:45:16,772 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/data/ecb089b3d/a2e82a7fac294291949787150dd07fcd [2023-11-19 07:45:16,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:45:16,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:45:16,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:16,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:45:16,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:45:16,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:16" (1/1) ... [2023-11-19 07:45:16,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749c7f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:16, skipping insertion in model container [2023-11-19 07:45:16,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:16" (1/1) ... [2023-11-19 07:45:16,836 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:45:17,008 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_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2023-11-19 07:45:17,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:17,385 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:45:17,399 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_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2023-11-19 07:45:17,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:17,508 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:17,508 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:17,516 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:45:17,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17 WrapperNode [2023-11-19 07:45:17,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:17,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:17,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:45:17,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:45:17,529 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:17" (1/1) ... [2023-11-19 07:45:17,559 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:17" (1/1) ... [2023-11-19 07:45:17,614 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-11-19 07:45:17,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:17,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:45:17,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:45:17,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:45:17,629 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:17" (1/1) ... [2023-11-19 07:45:17,630 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:17" (1/1) ... [2023-11-19 07:45:17,657 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:17" (1/1) ... [2023-11-19 07:45:17,658 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:17" (1/1) ... [2023-11-19 07:45:17,670 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:17" (1/1) ... [2023-11-19 07:45:17,682 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:17" (1/1) ... [2023-11-19 07:45:17,697 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:17" (1/1) ... [2023-11-19 07:45:17,699 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:17" (1/1) ... [2023-11-19 07:45:17,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:45:17,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:45:17,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:45:17,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:45:17,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:17,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:17,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/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:17,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/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:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:45:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:45:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:45:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:45:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:45:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:45:17,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:45:17,810 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:45:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:45:17,810 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:45:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:45:17,810 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:45:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:45:17,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:45:17,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:45:17,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:45:17,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:45:17,813 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:17,996 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:45:17,999 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:45:18,368 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:45:18,577 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:45:18,578 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:45:18,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:18 BoogieIcfgContainer [2023-11-19 07:45:18,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:45:18,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:45:18,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:45:18,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:45:18,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:45:16" (1/3) ... [2023-11-19 07:45:18,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df80c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:18, skipping insertion in model container [2023-11-19 07:45:18,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (2/3) ... [2023-11-19 07:45:18,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df80c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:18, skipping insertion in model container [2023-11-19 07:45:18,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:18" (3/3) ... [2023-11-19 07:45:18,601 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-11-19 07:45:18,611 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:45:18,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:45:18,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:45:18,624 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:45:18,719 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:45:18,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 278 flow [2023-11-19 07:45:18,876 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-11-19 07:45:18,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:18,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-19 07:45:18,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 278 flow [2023-11-19 07:45:18,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-11-19 07:45:18,906 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:45:18,931 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-11-19 07:45:18,934 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-11-19 07:45:18,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-11-19 07:45:18,987 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-11-19 07:45:18,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:18,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-19 07:45:18,992 INFO L119 LiptonReduction]: Number of co-enabled transitions 3248 [2023-11-19 07:45:23,900 INFO L134 LiptonReduction]: Checked pairs total: 7493 [2023-11-19 07:45:23,901 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-11-19 07:45:23,936 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:45:23,944 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;@745e7429, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:45:23,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 07:45:23,964 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:45:23,964 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-11-19 07:45:23,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:23,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:23,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:23,966 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:23,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1382676831, now seen corresponding path program 1 times [2023-11-19 07:45:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387244293] [2023-11-19 07:45:23,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:24,556 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:45:24,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:24,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387244293] [2023-11-19 07:45:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387244293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:24,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:45:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416432255] [2023-11-19 07:45:24,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:24,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:24,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:24,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 241 [2023-11-19 07:45:24,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 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:45:24,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:24,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 241 [2023-11-19 07:45:24,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:25,929 INFO L124 PetriNetUnfolderBase]: 5463/7888 cut-off events. [2023-11-19 07:45:25,930 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-19 07:45:25,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15488 conditions, 7888 events. 5463/7888 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 42981 event pairs, 1287 based on Foata normal form. 256/7616 useless extension candidates. Maximal degree in co-relation 15476. Up to 5521 conditions per place. [2023-11-19 07:45:25,996 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 35 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-11-19 07:45:25,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 180 flow [2023-11-19 07:45:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-11-19 07:45:26,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5463347164591977 [2023-11-19 07:45:26,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-11-19 07:45:26,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-11-19 07:45:26,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:26,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-11-19 07:45:26,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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:45:26,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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:45:26,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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:45:26,039 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 395 transitions. [2023-11-19 07:45:26,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 180 flow [2023-11-19 07:45:26,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:45:26,051 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-11-19 07:45:26,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-11-19 07:45:26,058 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-19 07:45:26,058 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-11-19 07:45:26,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 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:45:26,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:26,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:26,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:45:26,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:26,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1702932009, now seen corresponding path program 1 times [2023-11-19 07:45:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:26,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062746850] [2023-11-19 07:45:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:27,137 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:45:27,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:27,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062746850] [2023-11-19 07:45:27,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062746850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:27,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:27,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:27,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912120396] [2023-11-19 07:45:27,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:27,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:27,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:27,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:27,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-11-19 07:45:27,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 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:45:27,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:27,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-11-19 07:45:27,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:28,318 INFO L124 PetriNetUnfolderBase]: 5255/7280 cut-off events. [2023-11-19 07:45:28,319 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-11-19 07:45:28,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15150 conditions, 7280 events. 5255/7280 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 33986 event pairs, 1367 based on Foata normal form. 320/7568 useless extension candidates. Maximal degree in co-relation 15140. Up to 5313 conditions per place. [2023-11-19 07:45:28,377 INFO L140 encePairwiseOnDemand]: 236/241 looper letters, 36 selfloop transitions, 3 changer transitions 24/64 dead transitions. [2023-11-19 07:45:28,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 274 flow [2023-11-19 07:45:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2023-11-19 07:45:28,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269709543568465 [2023-11-19 07:45:28,384 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2023-11-19 07:45:28,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2023-11-19 07:45:28,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:28,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2023-11-19 07:45:28,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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:45:28,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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:45:28,396 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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:45:28,396 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 635 transitions. [2023-11-19 07:45:28,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 274 flow [2023-11-19 07:45:28,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:28,408 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 87 flow [2023-11-19 07:45:28,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-11-19 07:45:28,416 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-19 07:45:28,416 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 87 flow [2023-11-19 07:45:28,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 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:45:28,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:28,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:45:28,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:28,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1516780381, now seen corresponding path program 1 times [2023-11-19 07:45:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:28,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318700063] [2023-11-19 07:45:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:29,581 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:45:29,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:29,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318700063] [2023-11-19 07:45:29,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318700063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:29,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:29,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:29,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803327674] [2023-11-19 07:45:29,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:29,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:29,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:29,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:29,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:29,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-11-19 07:45:29,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 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:45:29,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:29,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-11-19 07:45:29,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:31,432 INFO L124 PetriNetUnfolderBase]: 7554/10575 cut-off events. [2023-11-19 07:45:31,432 INFO L125 PetriNetUnfolderBase]: For 3124/3124 co-relation queries the response was YES. [2023-11-19 07:45:31,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23803 conditions, 10575 events. 7554/10575 cut-off events. For 3124/3124 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 56406 event pairs, 569 based on Foata normal form. 446/11019 useless extension candidates. Maximal degree in co-relation 23790. Up to 6675 conditions per place. [2023-11-19 07:45:31,521 INFO L140 encePairwiseOnDemand]: 230/241 looper letters, 52 selfloop transitions, 12 changer transitions 36/102 dead transitions. [2023-11-19 07:45:31,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 102 transitions, 479 flow [2023-11-19 07:45:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:45:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:45:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 835 transitions. [2023-11-19 07:45:31,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4949614700652045 [2023-11-19 07:45:31,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 835 transitions. [2023-11-19 07:45:31,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 835 transitions. [2023-11-19 07:45:31,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:31,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 835 transitions. [2023-11-19 07:45:31,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 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:45:31,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:45:31,537 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:45:31,537 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 87 flow. Second operand 7 states and 835 transitions. [2023-11-19 07:45:31,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 102 transitions, 479 flow [2023-11-19 07:45:31,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 102 transitions, 470 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:31,619 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 181 flow [2023-11-19 07:45:31,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-11-19 07:45:31,621 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-11-19 07:45:31,626 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 181 flow [2023-11-19 07:45:31,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 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:45:31,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:31,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:31,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:45:31,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:31,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 225232278, now seen corresponding path program 1 times [2023-11-19 07:45:31,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:31,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034541767] [2023-11-19 07:45:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:32,191 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:45:32,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:32,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034541767] [2023-11-19 07:45:32,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034541767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:32,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044018771] [2023-11-19 07:45:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:32,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:45:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:32,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:45:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:32,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-11-19 07:45:32,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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:45:32,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:32,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-11-19 07:45:32,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:34,051 INFO L124 PetriNetUnfolderBase]: 7298/10451 cut-off events. [2023-11-19 07:45:34,051 INFO L125 PetriNetUnfolderBase]: For 12638/12638 co-relation queries the response was YES. [2023-11-19 07:45:34,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33076 conditions, 10451 events. 7298/10451 cut-off events. For 12638/12638 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 55131 event pairs, 1311 based on Foata normal form. 300/10751 useless extension candidates. Maximal degree in co-relation 33058. Up to 7003 conditions per place. [2023-11-19 07:45:34,147 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 65 selfloop transitions, 10 changer transitions 26/103 dead transitions. [2023-11-19 07:45:34,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 103 transitions, 672 flow [2023-11-19 07:45:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:45:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-11-19 07:45:34,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152143845089903 [2023-11-19 07:45:34,151 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-11-19 07:45:34,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-11-19 07:45:34,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:34,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-11-19 07:45:34,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 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:45:34,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:45:34,162 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:45:34,162 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 181 flow. Second operand 6 states and 745 transitions. [2023-11-19 07:45:34,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 103 transitions, 672 flow [2023-11-19 07:45:34,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 103 transitions, 664 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:34,214 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 263 flow [2023-11-19 07:45:34,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-11-19 07:45:34,216 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-11-19 07:45:34,217 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 263 flow [2023-11-19 07:45:34,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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:45:34,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:34,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:34,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:45:34,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:34,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1729708608, now seen corresponding path program 2 times [2023-11-19 07:45:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:34,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61998323] [2023-11-19 07:45:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:34,815 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:45:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:34,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61998323] [2023-11-19 07:45:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61998323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:34,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627249396] [2023-11-19 07:45:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:34,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:45:34,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:34,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:45:34,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:34,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-11-19 07:45:34,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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:45:34,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:34,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-11-19 07:45:34,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:36,388 INFO L124 PetriNetUnfolderBase]: 7079/10112 cut-off events. [2023-11-19 07:45:36,388 INFO L125 PetriNetUnfolderBase]: For 15270/15270 co-relation queries the response was YES. [2023-11-19 07:45:36,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34563 conditions, 10112 events. 7079/10112 cut-off events. For 15270/15270 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 51640 event pairs, 1051 based on Foata normal form. 300/10412 useless extension candidates. Maximal degree in co-relation 34541. Up to 6989 conditions per place. [2023-11-19 07:45:36,476 INFO L140 encePairwiseOnDemand]: 236/241 looper letters, 69 selfloop transitions, 8 changer transitions 26/105 dead transitions. [2023-11-19 07:45:36,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 105 transitions, 759 flow [2023-11-19 07:45:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:45:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-11-19 07:45:36,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131396957123098 [2023-11-19 07:45:36,480 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-11-19 07:45:36,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-11-19 07:45:36,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:36,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-11-19 07:45:36,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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:45:36,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:45:36,488 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:45:36,488 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 263 flow. Second operand 6 states and 742 transitions. [2023-11-19 07:45:36,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 105 transitions, 759 flow [2023-11-19 07:45:36,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 105 transitions, 746 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-19 07:45:36,564 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 296 flow [2023-11-19 07:45:36,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-19 07:45:36,567 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-11-19 07:45:36,567 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 296 flow [2023-11-19 07:45:36,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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:45:36,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:36,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:36,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:45:36,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:36,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2123317174, now seen corresponding path program 1 times [2023-11-19 07:45:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925013791] [2023-11-19 07:45:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:37,103 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:45:37,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:37,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925013791] [2023-11-19 07:45:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925013791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:37,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:37,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:37,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7673661] [2023-11-19 07:45:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:37,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:45:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:37,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:45:37,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:37,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-11-19 07:45:37,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:37,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:37,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-11-19 07:45:37,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:38,948 INFO L124 PetriNetUnfolderBase]: 8259/11622 cut-off events. [2023-11-19 07:45:38,949 INFO L125 PetriNetUnfolderBase]: For 21435/21692 co-relation queries the response was YES. [2023-11-19 07:45:38,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40947 conditions, 11622 events. 8259/11622 cut-off events. For 21435/21692 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 60478 event pairs, 4570 based on Foata normal form. 249/11718 useless extension candidates. Maximal degree in co-relation 40923. Up to 8901 conditions per place. [2023-11-19 07:45:39,078 INFO L140 encePairwiseOnDemand]: 233/241 looper letters, 61 selfloop transitions, 23 changer transitions 25/111 dead transitions. [2023-11-19 07:45:39,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 862 flow [2023-11-19 07:45:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:45:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:45:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-11-19 07:45:39,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074096028452875 [2023-11-19 07:45:39,083 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-11-19 07:45:39,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-11-19 07:45:39,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:39,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-11-19 07:45:39,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 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:45:39,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:45:39,094 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:45:39,094 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 296 flow. Second operand 7 states and 856 transitions. [2023-11-19 07:45:39,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 862 flow [2023-11-19 07:45:39,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 111 transitions, 847 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-19 07:45:39,334 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 481 flow [2023-11-19 07:45:39,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-11-19 07:45:39,337 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-11-19 07:45:39,337 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 481 flow [2023-11-19 07:45:39,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:39,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:39,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:39,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:45:39,338 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:39,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2080937074, now seen corresponding path program 2 times [2023-11-19 07:45:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:39,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580461314] [2023-11-19 07:45:39,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:40,039 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:45:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580461314] [2023-11-19 07:45:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580461314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163452696] [2023-11-19 07:45:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:45:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:45:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:45:40,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-11-19 07:45:40,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 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:45:40,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:40,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-11-19 07:45:40,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:41,656 INFO L124 PetriNetUnfolderBase]: 8278/11697 cut-off events. [2023-11-19 07:45:41,656 INFO L125 PetriNetUnfolderBase]: For 31605/31821 co-relation queries the response was YES. [2023-11-19 07:45:41,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45572 conditions, 11697 events. 8278/11697 cut-off events. For 31605/31821 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 60565 event pairs, 1391 based on Foata normal form. 240/11824 useless extension candidates. Maximal degree in co-relation 45545. Up to 7175 conditions per place. [2023-11-19 07:45:41,753 INFO L140 encePairwiseOnDemand]: 233/241 looper letters, 99 selfloop transitions, 26 changer transitions 26/153 dead transitions. [2023-11-19 07:45:41,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 153 transitions, 1300 flow [2023-11-19 07:45:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:45:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:45:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions. [2023-11-19 07:45:41,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046680497925311 [2023-11-19 07:45:41,758 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 973 transitions. [2023-11-19 07:45:41,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions. [2023-11-19 07:45:41,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:41,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions. [2023-11-19 07:45:41,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 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:45:41,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 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:45:41,768 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 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:45:41,768 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 481 flow. Second operand 8 states and 973 transitions. [2023-11-19 07:45:41,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 153 transitions, 1300 flow [2023-11-19 07:45:41,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 153 transitions, 1271 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-19 07:45:41,910 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 615 flow [2023-11-19 07:45:41,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=615, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-11-19 07:45:41,911 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-11-19 07:45:41,912 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 615 flow [2023-11-19 07:45:41,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 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:45:41,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:41,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:41,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:45:41,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:41,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2081311864, now seen corresponding path program 3 times [2023-11-19 07:45:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:41,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159394362] [2023-11-19 07:45:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:42,416 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:45:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159394362] [2023-11-19 07:45:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159394362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660342784] [2023-11-19 07:45:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:45:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:42,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:45:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:45:42,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-11-19 07:45:42,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 615 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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:45:42,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:42,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-11-19 07:45:42,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:44,029 INFO L124 PetriNetUnfolderBase]: 9195/13046 cut-off events. [2023-11-19 07:45:44,029 INFO L125 PetriNetUnfolderBase]: For 47241/47457 co-relation queries the response was YES. [2023-11-19 07:45:44,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54074 conditions, 13046 events. 9195/13046 cut-off events. For 47241/47457 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 69390 event pairs, 1845 based on Foata normal form. 320/13268 useless extension candidates. Maximal degree in co-relation 54045. Up to 7766 conditions per place. [2023-11-19 07:45:44,128 INFO L140 encePairwiseOnDemand]: 233/241 looper letters, 90 selfloop transitions, 32 changer transitions 26/150 dead transitions. [2023-11-19 07:45:44,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 150 transitions, 1469 flow [2023-11-19 07:45:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:45:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:45:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-11-19 07:45:44,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145228215767634 [2023-11-19 07:45:44,140 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-11-19 07:45:44,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-11-19 07:45:44,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:44,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-11-19 07:45:44,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 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:45:44,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:45:44,152 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:45:44,153 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 615 flow. Second operand 7 states and 868 transitions. [2023-11-19 07:45:44,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 150 transitions, 1469 flow [2023-11-19 07:45:44,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 150 transitions, 1394 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-11-19 07:45:44,403 INFO L231 Difference]: Finished difference. Result has 66 places, 80 transitions, 841 flow [2023-11-19 07:45:44,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=841, PETRI_PLACES=66, PETRI_TRANSITIONS=80} [2023-11-19 07:45:44,406 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-11-19 07:45:44,407 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 841 flow [2023-11-19 07:45:44,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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:45:44,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:44,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:44,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:45:44,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:44,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1957237827, now seen corresponding path program 1 times [2023-11-19 07:45:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:44,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574499702] [2023-11-19 07:45:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:44,589 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:45:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:44,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574499702] [2023-11-19 07:45:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574499702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:44,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310361904] [2023-11-19 07:45:44,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:44,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:44,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-11-19 07:45:44,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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:45:44,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:44,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-11-19 07:45:44,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:45,617 INFO L124 PetriNetUnfolderBase]: 5084/7451 cut-off events. [2023-11-19 07:45:45,617 INFO L125 PetriNetUnfolderBase]: For 42350/42984 co-relation queries the response was YES. [2023-11-19 07:45:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33678 conditions, 7451 events. 5084/7451 cut-off events. For 42350/42984 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 40106 event pairs, 1106 based on Foata normal form. 441/7741 useless extension candidates. Maximal degree in co-relation 33649. Up to 6414 conditions per place. [2023-11-19 07:45:45,680 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 115 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2023-11-19 07:45:45,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 1524 flow [2023-11-19 07:45:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-19 07:45:45,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5283540802213001 [2023-11-19 07:45:45,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-19 07:45:45,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-19 07:45:45,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:45,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-19 07:45:45,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 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:45:45,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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:45:45,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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:45:45,699 INFO L175 Difference]: Start difference. First operand has 66 places, 80 transitions, 841 flow. Second operand 3 states and 382 transitions. [2023-11-19 07:45:45,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 1524 flow [2023-11-19 07:45:45,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 125 transitions, 1404 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-11-19 07:45:45,808 INFO L231 Difference]: Finished difference. Result has 62 places, 84 transitions, 796 flow [2023-11-19 07:45:45,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=62, PETRI_TRANSITIONS=84} [2023-11-19 07:45:45,810 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2023-11-19 07:45:45,810 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 84 transitions, 796 flow [2023-11-19 07:45:45,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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:45:45,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:45,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:45,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:45:45,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:45,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1036279123, now seen corresponding path program 1 times [2023-11-19 07:45:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506696810] [2023-11-19 07:45:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:46,060 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:45:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:46,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506696810] [2023-11-19 07:45:46,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506696810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:46,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:46,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:46,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881037298] [2023-11-19 07:45:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:46,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:46,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-11-19 07:45:46,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 84 transitions, 796 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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:45:46,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:46,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-11-19 07:45:46,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:46,840 INFO L124 PetriNetUnfolderBase]: 2618/4052 cut-off events. [2023-11-19 07:45:46,841 INFO L125 PetriNetUnfolderBase]: For 17784/18102 co-relation queries the response was YES. [2023-11-19 07:45:46,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18338 conditions, 4052 events. 2618/4052 cut-off events. For 17784/18102 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 21066 event pairs, 453 based on Foata normal form. 430/4410 useless extension candidates. Maximal degree in co-relation 18310. Up to 2104 conditions per place. [2023-11-19 07:45:46,870 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 148 selfloop transitions, 9 changer transitions 0/162 dead transitions. [2023-11-19 07:45:46,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 162 transitions, 1836 flow [2023-11-19 07:45:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:45:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-11-19 07:45:46,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5300829875518672 [2023-11-19 07:45:46,875 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-11-19 07:45:46,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-11-19 07:45:46,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:46,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-11-19 07:45:46,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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:45:46,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:45:46,881 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:45:46,882 INFO L175 Difference]: Start difference. First operand has 62 places, 84 transitions, 796 flow. Second operand 4 states and 511 transitions. [2023-11-19 07:45:46,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 162 transitions, 1836 flow [2023-11-19 07:45:46,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 1827 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-19 07:45:46,918 INFO L231 Difference]: Finished difference. Result has 65 places, 82 transitions, 769 flow [2023-11-19 07:45:46,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=769, PETRI_PLACES=65, PETRI_TRANSITIONS=82} [2023-11-19 07:45:46,919 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-11-19 07:45:46,920 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 82 transitions, 769 flow [2023-11-19 07:45:46,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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:45:46,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:46,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:46,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:45:46,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:46,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1198589744, now seen corresponding path program 1 times [2023-11-19 07:45:46,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:46,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739765753] [2023-11-19 07:45:46,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:47,884 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:45:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739765753] [2023-11-19 07:45:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739765753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877617216] [2023-11-19 07:45:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:47,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:47,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:47,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-11-19 07:45:47,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 82 transitions, 769 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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:45:47,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:47,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-11-19 07:45:47,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:49,111 INFO L124 PetriNetUnfolderBase]: 3477/5390 cut-off events. [2023-11-19 07:45:49,111 INFO L125 PetriNetUnfolderBase]: For 24296/24701 co-relation queries the response was YES. [2023-11-19 07:45:49,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26158 conditions, 5390 events. 3477/5390 cut-off events. For 24296/24701 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 29527 event pairs, 659 based on Foata normal form. 345/5709 useless extension candidates. Maximal degree in co-relation 26128. Up to 2579 conditions per place. [2023-11-19 07:45:49,147 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 110 selfloop transitions, 10 changer transitions 41/164 dead transitions. [2023-11-19 07:45:49,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 164 transitions, 1792 flow [2023-11-19 07:45:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:45:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions. [2023-11-19 07:45:49,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48893499308437066 [2023-11-19 07:45:49,152 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions. [2023-11-19 07:45:49,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions. [2023-11-19 07:45:49,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:49,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions. [2023-11-19 07:45:49,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 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:45:49,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:45:49,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:45:49,161 INFO L175 Difference]: Start difference. First operand has 65 places, 82 transitions, 769 flow. Second operand 6 states and 707 transitions. [2023-11-19 07:45:49,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 164 transitions, 1792 flow [2023-11-19 07:45:49,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 164 transitions, 1758 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:49,216 INFO L231 Difference]: Finished difference. Result has 72 places, 84 transitions, 819 flow [2023-11-19 07:45:49,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=819, PETRI_PLACES=72, PETRI_TRANSITIONS=84} [2023-11-19 07:45:49,217 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-11-19 07:45:49,217 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 84 transitions, 819 flow [2023-11-19 07:45:49,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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:45:49,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:49,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:49,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:45:49,218 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:49,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1896734876, now seen corresponding path program 1 times [2023-11-19 07:45:49,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:49,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764462423] [2023-11-19 07:45:49,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:49,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:49,450 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:45:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764462423] [2023-11-19 07:45:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764462423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:49,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856742130] [2023-11-19 07:45:49,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:49,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:49,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:49,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-11-19 07:45:49,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 84 transitions, 819 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:49,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-11-19 07:45:49,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:50,205 INFO L124 PetriNetUnfolderBase]: 2161/3392 cut-off events. [2023-11-19 07:45:50,206 INFO L125 PetriNetUnfolderBase]: For 17564/17876 co-relation queries the response was YES. [2023-11-19 07:45:50,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15917 conditions, 3392 events. 2161/3392 cut-off events. For 17564/17876 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 18198 event pairs, 312 based on Foata normal form. 349/3666 useless extension candidates. Maximal degree in co-relation 15883. Up to 1312 conditions per place. [2023-11-19 07:45:50,226 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 138 selfloop transitions, 13 changer transitions 22/178 dead transitions. [2023-11-19 07:45:50,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 178 transitions, 2094 flow [2023-11-19 07:45:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-11-19 07:45:50,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5294605809128631 [2023-11-19 07:45:50,231 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-11-19 07:45:50,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-11-19 07:45:50,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:50,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-11-19 07:45:50,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 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:45:50,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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:45:50,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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:45:50,239 INFO L175 Difference]: Start difference. First operand has 72 places, 84 transitions, 819 flow. Second operand 5 states and 638 transitions. [2023-11-19 07:45:50,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 178 transitions, 2094 flow [2023-11-19 07:45:50,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 178 transitions, 2065 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-19 07:45:50,275 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 738 flow [2023-11-19 07:45:50,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=738, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2023-11-19 07:45:50,276 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-11-19 07:45:50,277 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 738 flow [2023-11-19 07:45:50,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:50,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:50,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:50,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:45:50,278 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:50,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1037120386, now seen corresponding path program 1 times [2023-11-19 07:45:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:50,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502553892] [2023-11-19 07:45:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:50,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:51,020 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:45:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502553892] [2023-11-19 07:45:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502553892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:51,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:51,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053114709] [2023-11-19 07:45:51,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:51,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:45:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:45:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:51,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-11-19 07:45:51,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 738 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 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:45:51,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:51,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-11-19 07:45:51,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:52,119 INFO L124 PetriNetUnfolderBase]: 2947/4676 cut-off events. [2023-11-19 07:45:52,119 INFO L125 PetriNetUnfolderBase]: For 24753/25166 co-relation queries the response was YES. [2023-11-19 07:45:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23794 conditions, 4676 events. 2947/4676 cut-off events. For 24753/25166 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 26853 event pairs, 227 based on Foata normal form. 249/4903 useless extension candidates. Maximal degree in co-relation 23760. Up to 1993 conditions per place. [2023-11-19 07:45:52,150 INFO L140 encePairwiseOnDemand]: 230/241 looper letters, 109 selfloop transitions, 28 changer transitions 64/204 dead transitions. [2023-11-19 07:45:52,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 204 transitions, 2284 flow [2023-11-19 07:45:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:45:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:45:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-11-19 07:45:52,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842916419679905 [2023-11-19 07:45:52,155 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-11-19 07:45:52,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-11-19 07:45:52,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:52,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-11-19 07:45:52,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 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:45:52,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:45:52,163 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:45:52,163 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 738 flow. Second operand 7 states and 817 transitions. [2023-11-19 07:45:52,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 204 transitions, 2284 flow [2023-11-19 07:45:52,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 204 transitions, 2162 flow, removed 30 selfloop flow, removed 3 redundant places. [2023-11-19 07:45:52,303 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 832 flow [2023-11-19 07:45:52,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=832, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2023-11-19 07:45:52,304 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2023-11-19 07:45:52,304 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 832 flow [2023-11-19 07:45:52,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 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:45:52,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:52,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:52,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:45:52,305 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:52,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1489982078, now seen corresponding path program 2 times [2023-11-19 07:45:52,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:52,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263514422] [2023-11-19 07:45:52,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:52,496 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:45:52,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:52,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263514422] [2023-11-19 07:45:52,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263514422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:52,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:52,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231095881] [2023-11-19 07:45:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:52,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:45:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:45:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:52,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-11-19 07:45:52,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 832 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 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:45:52,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:52,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-11-19 07:45:52,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:53,055 INFO L124 PetriNetUnfolderBase]: 2307/3666 cut-off events. [2023-11-19 07:45:53,055 INFO L125 PetriNetUnfolderBase]: For 23365/23632 co-relation queries the response was YES. [2023-11-19 07:45:53,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18236 conditions, 3666 events. 2307/3666 cut-off events. For 23365/23632 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 21175 event pairs, 293 based on Foata normal form. 177/3753 useless extension candidates. Maximal degree in co-relation 18206. Up to 1469 conditions per place. [2023-11-19 07:45:53,070 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 95 selfloop transitions, 17 changer transitions 57/173 dead transitions. [2023-11-19 07:45:53,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 173 transitions, 2242 flow [2023-11-19 07:45:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:45:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-11-19 07:45:53,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193637621023514 [2023-11-19 07:45:53,074 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-11-19 07:45:53,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-11-19 07:45:53,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:53,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-11-19 07:45:53,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 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:45:53,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:45:53,082 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:45:53,082 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 832 flow. Second operand 6 states and 751 transitions. [2023-11-19 07:45:53,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 173 transitions, 2242 flow [2023-11-19 07:45:53,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 173 transitions, 2102 flow, removed 42 selfloop flow, removed 5 redundant places. [2023-11-19 07:45:53,253 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 573 flow [2023-11-19 07:45:53,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2023-11-19 07:45:53,254 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2023-11-19 07:45:53,254 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 573 flow [2023-11-19 07:45:53,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 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:45:53,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:53,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:53,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:45:53,255 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:53,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1620624049, now seen corresponding path program 1 times [2023-11-19 07:45:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629647884] [2023-11-19 07:45:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,527 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:45:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629647884] [2023-11-19 07:45:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629647884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:53,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666123676] [2023-11-19 07:45:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:53,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:53,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:53,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-11-19 07:45:53,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 573 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:53,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:53,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-11-19 07:45:53,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:53,905 INFO L124 PetriNetUnfolderBase]: 998/1647 cut-off events. [2023-11-19 07:45:53,906 INFO L125 PetriNetUnfolderBase]: For 8912/8992 co-relation queries the response was YES. [2023-11-19 07:45:53,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8344 conditions, 1647 events. 998/1647 cut-off events. For 8912/8992 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8803 event pairs, 240 based on Foata normal form. 31/1639 useless extension candidates. Maximal degree in co-relation 8313. Up to 890 conditions per place. [2023-11-19 07:45:53,914 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 51 selfloop transitions, 1 changer transitions 58/113 dead transitions. [2023-11-19 07:45:53,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 113 transitions, 1238 flow [2023-11-19 07:45:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-11-19 07:45:53,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053941908713693 [2023-11-19 07:45:53,918 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-11-19 07:45:53,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-11-19 07:45:53,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:53,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-11-19 07:45:53,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 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:45:53,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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:45:53,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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:45:53,924 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 573 flow. Second operand 5 states and 609 transitions. [2023-11-19 07:45:53,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 113 transitions, 1238 flow [2023-11-19 07:45:53,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 113 transitions, 1005 flow, removed 55 selfloop flow, removed 12 redundant places. [2023-11-19 07:45:53,958 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 281 flow [2023-11-19 07:45:53,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2023-11-19 07:45:53,960 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-11-19 07:45:53,960 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 281 flow [2023-11-19 07:45:53,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:53,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:53,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:53,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:45:53,962 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:45:53,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash -63344547, now seen corresponding path program 2 times [2023-11-19 07:45:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:53,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882300461] [2023-11-19 07:45:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:45:54,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:45:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:45:54,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:45:54,151 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:45:54,153 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-19 07:45:54,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-19 07:45:54,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-19 07:45:54,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-19 07:45:54,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-19 07:45:54,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-19 07:45:54,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-19 07:45:54,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:45:54,162 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:54,169 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:45:54,169 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:45:54,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:45:54,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:45:54,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:45:54,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:45:54,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:45:54 BasicIcfg [2023-11-19 07:45:54,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:45:54,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:45:54,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:45:54,294 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:45:54,295 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:18" (3/4) ... [2023-11-19 07:45:54,296 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:45:54,328 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:45:54,331 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:45:54,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:45:54,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:45:54,421 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:45:54,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:45:54,422 INFO L158 Benchmark]: Toolchain (without parser) took 37645.68ms. Allocated memory was 134.2MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 94.7MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 972.7MB. Max. memory is 16.1GB. [2023-11-19 07:45:54,422 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 100.7MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:45:54,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.16ms. Allocated memory is still 134.2MB. Free memory was 94.3MB in the beginning and 70.9MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:54,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.66ms. Allocated memory is still 134.2MB. Free memory was 70.9MB in the beginning and 68.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:54,423 INFO L158 Benchmark]: Boogie Preprocessor took 85.82ms. Allocated memory is still 134.2MB. Free memory was 68.0MB in the beginning and 103.8MB in the end (delta: -35.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2023-11-19 07:45:54,423 INFO L158 Benchmark]: RCFGBuilder took 881.49ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 103.8MB in the beginning and 107.8MB in the end (delta: -4.1MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2023-11-19 07:45:54,424 INFO L158 Benchmark]: TraceAbstraction took 35704.14ms. Allocated memory was 172.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 106.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 933.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:54,424 INFO L158 Benchmark]: Witness Printer took 127.57ms. Allocated memory is still 2.9GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:45:54,426 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.32ms. Allocated memory is still 100.7MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.16ms. Allocated memory is still 134.2MB. Free memory was 94.3MB in the beginning and 70.9MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.66ms. Allocated memory is still 134.2MB. Free memory was 70.9MB in the beginning and 68.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.82ms. Allocated memory is still 134.2MB. Free memory was 68.0MB in the beginning and 103.8MB in the end (delta: -35.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 881.49ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 103.8MB in the beginning and 107.8MB in the end (delta: -4.1MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35704.14ms. Allocated memory was 172.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 106.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 933.1MB. Max. memory is 16.1GB. * Witness Printer took 127.57ms. Allocated memory is still 2.9GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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 Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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 Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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.0s, 138 PlacesBefore, 42 PlacesAfterwards, 127 TransitionsBefore, 30 TransitionsAfterwards, 3248 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 7493 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3624, independent: 3424, independent conditional: 0, independent unconditional: 3424, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1688, independent: 1657, independent conditional: 0, independent unconditional: 1657, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3624, independent: 1767, independent conditional: 0, independent unconditional: 1767, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 1688, unknown conditional: 0, unknown unconditional: 1688] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 841]: 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: 843]: 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: 839]: 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: 837]: 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 9 procedures, 167 locations, 7 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: 35.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 988 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 816 mSDsluCounter, 411 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2291 IncrementalHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 109 mSDtfsCounter, 2291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=841occurred in iteration=8, InterpolantAutomatonStates: 85, 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.7s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1669 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:45:54,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71e5e6a6-627b-4a47-87d5-3ef2ab88cb37/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE