./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000.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_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/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_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/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_58007156-8a2a-4d9f-9f18-90c0a2a73b06/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 fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:47:35,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:47:35,175 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:47:35,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:47:35,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:47:35,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:47:35,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:47:35,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:47:35,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:47:35,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:47:35,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:47:35,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:47:35,208 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:47:35,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:47:35,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:47:35,210 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:47:35,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:47:35,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:47:35,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:47:35,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:47:35,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:47:35,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:47:35,214 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:47:35,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:47:35,215 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:47:35,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:47:35,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:47:35,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:47:35,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:35,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:47:35,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:47:35,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:47:35,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:47:35,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:47:35,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:47:35,221 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:47:35,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:47:35,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:47:35,222 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:47:35,222 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_58007156-8a2a-4d9f-9f18-90c0a2a73b06/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_58007156-8a2a-4d9f-9f18-90c0a2a73b06/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 -> fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 [2023-11-19 07:47:35,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:47:35,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:47:35,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:47:35,484 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:47:35,484 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:47:35,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix000.opt.i [2023-11-19 07:47:38,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:47:38,967 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:47:38,968 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/sv-benchmarks/c/pthread-wmm/mix000.opt.i [2023-11-19 07:47:38,997 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/data/324d65668/19ab873e5cdb401ebf7d9023b817cf26/FLAG73ac20c90 [2023-11-19 07:47:39,012 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/data/324d65668/19ab873e5cdb401ebf7d9023b817cf26 [2023-11-19 07:47:39,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:47:39,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:47:39,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:39,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:47:39,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:47:39,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fca26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39, skipping insertion in model container [2023-11-19 07:47:39,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,083 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:47:39,262 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_58007156-8a2a-4d9f-9f18-90c0a2a73b06/sv-benchmarks/c/pthread-wmm/mix000.opt.i[987,1000] [2023-11-19 07:47:39,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:39,600 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:47:39,617 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_58007156-8a2a-4d9f-9f18-90c0a2a73b06/sv-benchmarks/c/pthread-wmm/mix000.opt.i[987,1000] [2023-11-19 07:47:39,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:39,741 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:47:39,741 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:47:39,749 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:47:39,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39 WrapperNode [2023-11-19 07:47:39,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:39,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:39,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:47:39,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:47:39,760 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:47:39" (1/1) ... [2023-11-19 07:47:39,782 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:47:39" (1/1) ... [2023-11-19 07:47:39,814 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2023-11-19 07:47:39,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:39,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:47:39,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:47:39,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:47:39,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:47:39,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:47:39,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:47:39,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:47:39,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (1/1) ... [2023-11-19 07:47:39,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:39,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/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:47:39,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/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:47:39,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:47:39,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:47:39,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:47:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:47:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:47:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:47:39,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:47:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:47:39,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:47:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:47:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:47:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:47:39,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:47:40,000 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:47:40,157 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:47:40,159 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:47:40,442 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:47:40,767 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:47:40,770 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:47:40,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:40 BoogieIcfgContainer [2023-11-19 07:47:40,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:47:40,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:47:40,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:47:40,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:47:40,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:47:39" (1/3) ... [2023-11-19 07:47:40,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5175d38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:40, skipping insertion in model container [2023-11-19 07:47:40,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:39" (2/3) ... [2023-11-19 07:47:40,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5175d38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:40, skipping insertion in model container [2023-11-19 07:47:40,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:40" (3/3) ... [2023-11-19 07:47:40,788 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-11-19 07:47:40,797 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:47:40,807 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:47:40,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:47:40,807 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:47:40,856 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:47:40,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 198 flow [2023-11-19 07:47:40,959 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-11-19 07:47:40,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:47:40,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-19 07:47:40,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 198 flow [2023-11-19 07:47:40,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2023-11-19 07:47:40,973 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:47:40,990 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2023-11-19 07:47:40,995 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2023-11-19 07:47:40,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2023-11-19 07:47:41,032 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-11-19 07:47:41,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:47:41,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-19 07:47:41,035 INFO L119 LiptonReduction]: Number of co-enabled transitions 1310 [2023-11-19 07:47:44,904 INFO L134 LiptonReduction]: Checked pairs total: 3082 [2023-11-19 07:47:44,904 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-11-19 07:47:44,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:47:44,925 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;@6c1c1ad0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:47:44,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 07:47:44,935 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:47:44,935 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-19 07:47:44,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:47:44,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:44,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:47:44,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:44,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash 437200607, now seen corresponding path program 1 times [2023-11-19 07:47:44,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:44,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517038804] [2023-11-19 07:47:44,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:44,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:45,412 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:47:45,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:45,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517038804] [2023-11-19 07:47:45,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517038804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:45,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:45,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:47:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119400342] [2023-11-19 07:47:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:45,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:47:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:45,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:47:45,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:47:45,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 184 [2023-11-19 07:47:45,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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:47:45,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:45,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 184 [2023-11-19 07:47:45,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:45,637 INFO L124 PetriNetUnfolderBase]: 142/272 cut-off events. [2023-11-19 07:47:45,637 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 07:47:45,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 272 events. 142/272 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1097 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 527. Up to 205 conditions per place. [2023-11-19 07:47:45,642 INFO L140 encePairwiseOnDemand]: 180/184 looper letters, 18 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-11-19 07:47:45,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 98 flow [2023-11-19 07:47:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:47:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:47:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2023-11-19 07:47:45,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2023-11-19 07:47:45,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2023-11-19 07:47:45,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2023-11-19 07:47:45,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:45,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2023-11-19 07:47:45,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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:47:45,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:45,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:45,686 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 274 transitions. [2023-11-19 07:47:45,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 98 flow [2023-11-19 07:47:45,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:47:45,691 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-11-19 07:47:45,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-19 07:47:45,699 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-19 07:47:45,699 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-11-19 07:47:45,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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:47:45,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:45,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:45,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:47:45,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:45,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -756936155, now seen corresponding path program 1 times [2023-11-19 07:47:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817254992] [2023-11-19 07:47:45,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,066 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:47:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817254992] [2023-11-19 07:47:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817254992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:46,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:46,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:47:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137078621] [2023-11-19 07:47:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:46,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:47:46,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:47:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:47:46,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 184 [2023-11-19 07:47:46,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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:47:46,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:46,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 184 [2023-11-19 07:47:46,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:46,202 INFO L124 PetriNetUnfolderBase]: 167/294 cut-off events. [2023-11-19 07:47:46,203 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:47:46,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 294 events. 167/294 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 981 event pairs, 65 based on Foata normal form. 4/298 useless extension candidates. Maximal degree in co-relation 612. Up to 267 conditions per place. [2023-11-19 07:47:46,210 INFO L140 encePairwiseOnDemand]: 180/184 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-11-19 07:47:46,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 108 flow [2023-11-19 07:47:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:47:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:47:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2023-11-19 07:47:46,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692028985507246 [2023-11-19 07:47:46,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2023-11-19 07:47:46,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2023-11-19 07:47:46,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:46,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2023-11-19 07:47:46,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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:47:46,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:46,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:46,224 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 259 transitions. [2023-11-19 07:47:46,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 108 flow [2023-11-19 07:47:46,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:47:46,226 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2023-11-19 07:47:46,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-19 07:47:46,228 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-19 07:47:46,229 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2023-11-19 07:47:46,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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:47:46,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:46,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:46,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:47:46,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:46,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1832828474, now seen corresponding path program 1 times [2023-11-19 07:47:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:46,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695553835] [2023-11-19 07:47:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,454 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:47:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695553835] [2023-11-19 07:47:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695553835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:47:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74272849] [2023-11-19 07:47:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:46,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:46,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 184 [2023-11-19 07:47:46,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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:47:46,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:46,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 184 [2023-11-19 07:47:46,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:46,568 INFO L124 PetriNetUnfolderBase]: 157/278 cut-off events. [2023-11-19 07:47:46,569 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-19 07:47:46,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 278 events. 157/278 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 881 event pairs, 53 based on Foata normal form. 6/284 useless extension candidates. Maximal degree in co-relation 635. Up to 200 conditions per place. [2023-11-19 07:47:46,572 INFO L140 encePairwiseOnDemand]: 181/184 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-11-19 07:47:46,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 111 flow [2023-11-19 07:47:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:47:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:47:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-11-19 07:47:46,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46557971014492755 [2023-11-19 07:47:46,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-11-19 07:47:46,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-11-19 07:47:46,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:46,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-11-19 07:47:46,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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:47:46,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:46,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:46,581 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 257 transitions. [2023-11-19 07:47:46,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 111 flow [2023-11-19 07:47:46,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:47:46,583 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 63 flow [2023-11-19 07:47:46,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-11-19 07:47:46,584 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-11-19 07:47:46,588 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 63 flow [2023-11-19 07:47:46,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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:47:46,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:46,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:46,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:47:46,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:46,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1624973434, now seen corresponding path program 1 times [2023-11-19 07:47:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:46,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018226727] [2023-11-19 07:47:46,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,847 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:47:46,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:46,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018226727] [2023-11-19 07:47:46,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018226727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:46,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:46,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:47:46,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310144468] [2023-11-19 07:47:46,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:46,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:47:46,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:46,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:47:46,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:47:46,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 184 [2023-11-19 07:47:46,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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:47:46,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:46,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 184 [2023-11-19 07:47:46,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:46,958 INFO L124 PetriNetUnfolderBase]: 116/224 cut-off events. [2023-11-19 07:47:46,958 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-19 07:47:46,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 224 events. 116/224 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 763 event pairs, 62 based on Foata normal form. 6/228 useless extension candidates. Maximal degree in co-relation 521. Up to 145 conditions per place. [2023-11-19 07:47:46,960 INFO L140 encePairwiseOnDemand]: 181/184 looper letters, 21 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-11-19 07:47:46,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 127 flow [2023-11-19 07:47:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:47:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:47:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2023-11-19 07:47:46,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2023-11-19 07:47:46,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2023-11-19 07:47:46,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2023-11-19 07:47:46,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:46,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2023-11-19 07:47:46,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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:47:46,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:46,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:46,967 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 63 flow. Second operand 3 states and 270 transitions. [2023-11-19 07:47:46,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 127 flow [2023-11-19 07:47:46,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:47:46,970 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 68 flow [2023-11-19 07:47:46,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-11-19 07:47:46,972 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-11-19 07:47:46,973 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 68 flow [2023-11-19 07:47:46,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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:47:46,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:46,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:46,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:47:46,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:46,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:46,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1409030649, now seen corresponding path program 1 times [2023-11-19 07:47:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:46,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748677920] [2023-11-19 07:47:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:46,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,214 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:47:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748677920] [2023-11-19 07:47:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748677920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:47,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:47,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:47:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975437652] [2023-11-19 07:47:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:47,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:47:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:47,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:47:47,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:47:47,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 184 [2023-11-19 07:47:47,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:47:47,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:47,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 184 [2023-11-19 07:47:47,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:47,298 INFO L124 PetriNetUnfolderBase]: 37/97 cut-off events. [2023-11-19 07:47:47,298 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-19 07:47:47,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 97 events. 37/97 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 278 event pairs, 13 based on Foata normal form. 14/110 useless extension candidates. Maximal degree in co-relation 227. Up to 61 conditions per place. [2023-11-19 07:47:47,299 INFO L140 encePairwiseOnDemand]: 180/184 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-11-19 07:47:47,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 139 flow [2023-11-19 07:47:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:47:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:47:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-11-19 07:47:47,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483695652173913 [2023-11-19 07:47:47,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-11-19 07:47:47,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-11-19 07:47:47,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:47,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-11-19 07:47:47,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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:47:47,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:47,306 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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:47:47,306 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 68 flow. Second operand 3 states and 267 transitions. [2023-11-19 07:47:47,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 139 flow [2023-11-19 07:47:47,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:47:47,309 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 81 flow [2023-11-19 07:47:47,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-11-19 07:47:47,312 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2023-11-19 07:47:47,312 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 81 flow [2023-11-19 07:47:47,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:47:47,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:47,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:47,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:47:47,314 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:47,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2060108431, now seen corresponding path program 1 times [2023-11-19 07:47:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:47,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187667630] [2023-11-19 07:47:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,610 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:47:47,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:47,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187667630] [2023-11-19 07:47:47,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187667630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:47,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:47,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:47:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315220184] [2023-11-19 07:47:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:47,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:47,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:47,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:47,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 184 [2023-11-19 07:47:47,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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:47:47,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:47,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 184 [2023-11-19 07:47:47,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:47,692 INFO L124 PetriNetUnfolderBase]: 19/59 cut-off events. [2023-11-19 07:47:47,692 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-19 07:47:47,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 59 events. 19/59 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 10 based on Foata normal form. 8/66 useless extension candidates. Maximal degree in co-relation 156. Up to 31 conditions per place. [2023-11-19 07:47:47,693 INFO L140 encePairwiseOnDemand]: 180/184 looper letters, 19 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-11-19 07:47:47,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 148 flow [2023-11-19 07:47:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:47:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2023-11-19 07:47:47,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47282608695652173 [2023-11-19 07:47:47,696 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 348 transitions. [2023-11-19 07:47:47,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 348 transitions. [2023-11-19 07:47:47,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:47,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 348 transitions. [2023-11-19 07:47:47,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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:47:47,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 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:47:47,702 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 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:47:47,702 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 81 flow. Second operand 4 states and 348 transitions. [2023-11-19 07:47:47,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 148 flow [2023-11-19 07:47:47,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 132 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-19 07:47:47,705 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 82 flow [2023-11-19 07:47:47,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-11-19 07:47:47,707 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2023-11-19 07:47:47,708 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 82 flow [2023-11-19 07:47:47,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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:47:47,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:47,708 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:47:47,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:47:47,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:47,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:47,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1959427645, now seen corresponding path program 1 times [2023-11-19 07:47:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:47,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241683940] [2023-11-19 07:47:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,981 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:47:47,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:47,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241683940] [2023-11-19 07:47:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241683940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:47,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:47,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:47:47,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248713442] [2023-11-19 07:47:47,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:48,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 184 [2023-11-19 07:47:48,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 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:47:48,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:48,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 184 [2023-11-19 07:47:48,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:48,114 INFO L124 PetriNetUnfolderBase]: 33/91 cut-off events. [2023-11-19 07:47:48,115 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-19 07:47:48,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 91 events. 33/91 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 257 event pairs, 2 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 252. Up to 58 conditions per place. [2023-11-19 07:47:48,116 INFO L140 encePairwiseOnDemand]: 177/184 looper letters, 26 selfloop transitions, 9 changer transitions 5/40 dead transitions. [2023-11-19 07:47:48,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 239 flow [2023-11-19 07:47:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:47:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:47:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 416 transitions. [2023-11-19 07:47:48,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45217391304347826 [2023-11-19 07:47:48,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 416 transitions. [2023-11-19 07:47:48,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 416 transitions. [2023-11-19 07:47:48,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:48,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 416 transitions. [2023-11-19 07:47:48,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 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:47:48,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 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:47:48,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 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:47:48,125 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 82 flow. Second operand 5 states and 416 transitions. [2023-11-19 07:47:48,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 239 flow [2023-11-19 07:47:48,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 220 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 07:47:48,130 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 124 flow [2023-11-19 07:47:48,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-19 07:47:48,131 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-11-19 07:47:48,132 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 124 flow [2023-11-19 07:47:48,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 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:47:48,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:48,132 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:47:48,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:47:48,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:48,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:48,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1846599631, now seen corresponding path program 2 times [2023-11-19 07:47:48,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:48,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222083654] [2023-11-19 07:47:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:48,417 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:47:48,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:48,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222083654] [2023-11-19 07:47:48,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222083654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:48,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:48,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:47:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531909401] [2023-11-19 07:47:48,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:48,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:48,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 184 [2023-11-19 07:47:48,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:47:48,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:48,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 184 [2023-11-19 07:47:48,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:48,521 INFO L124 PetriNetUnfolderBase]: 29/96 cut-off events. [2023-11-19 07:47:48,521 INFO L125 PetriNetUnfolderBase]: For 78/80 co-relation queries the response was YES. [2023-11-19 07:47:48,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 96 events. 29/96 cut-off events. For 78/80 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 300 event pairs, 5 based on Foata normal form. 3/99 useless extension candidates. Maximal degree in co-relation 301. Up to 46 conditions per place. [2023-11-19 07:47:48,522 INFO L140 encePairwiseOnDemand]: 181/184 looper letters, 18 selfloop transitions, 1 changer transitions 18/38 dead transitions. [2023-11-19 07:47:48,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 244 flow [2023-11-19 07:47:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:47:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2023-11-19 07:47:48,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741847826086957 [2023-11-19 07:47:48,525 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 349 transitions. [2023-11-19 07:47:48,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 349 transitions. [2023-11-19 07:47:48,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:48,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 349 transitions. [2023-11-19 07:47:48,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 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:47:48,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 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:47:48,551 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 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:47:48,551 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 124 flow. Second operand 4 states and 349 transitions. [2023-11-19 07:47:48,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 244 flow [2023-11-19 07:47:48,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:47:48,554 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 83 flow [2023-11-19 07:47:48,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2023-11-19 07:47:48,555 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2023-11-19 07:47:48,555 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 18 transitions, 83 flow [2023-11-19 07:47:48,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:47:48,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:48,555 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:47:48,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:47:48,556 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:48,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1797621005, now seen corresponding path program 3 times [2023-11-19 07:47:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:48,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499784199] [2023-11-19 07:47:48,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:48,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,900 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:47:49,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499784199] [2023-11-19 07:47:49,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499784199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:49,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:49,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861725582] [2023-11-19 07:47:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:49,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:49,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:50,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 184 [2023-11-19 07:47:50,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 18 transitions, 83 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 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:47:50,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:50,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 184 [2023-11-19 07:47:50,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:50,266 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2023-11-19 07:47:50,266 INFO L125 PetriNetUnfolderBase]: For 41/42 co-relation queries the response was YES. [2023-11-19 07:47:50,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 38 events. 6/38 cut-off events. For 41/42 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 1 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 121. Up to 14 conditions per place. [2023-11-19 07:47:50,266 INFO L140 encePairwiseOnDemand]: 177/184 looper letters, 12 selfloop transitions, 4 changer transitions 10/28 dead transitions. [2023-11-19 07:47:50,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 182 flow [2023-11-19 07:47:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:47:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:47:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2023-11-19 07:47:50,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42866847826086957 [2023-11-19 07:47:50,270 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 631 transitions. [2023-11-19 07:47:50,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 631 transitions. [2023-11-19 07:47:50,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:50,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 631 transitions. [2023-11-19 07:47:50,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.875) internal successors, (631), 8 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:47:50,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 184.0) internal successors, (1656), 9 states have internal predecessors, (1656), 0 states have call successors, (0), 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:47:50,277 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 184.0) internal successors, (1656), 9 states have internal predecessors, (1656), 0 states have call successors, (0), 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:47:50,277 INFO L175 Difference]: Start difference. First operand has 37 places, 18 transitions, 83 flow. Second operand 8 states and 631 transitions. [2023-11-19 07:47:50,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 182 flow [2023-11-19 07:47:50,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 162 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-19 07:47:50,279 INFO L231 Difference]: Finished difference. Result has 39 places, 18 transitions, 82 flow [2023-11-19 07:47:50,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=82, PETRI_PLACES=39, PETRI_TRANSITIONS=18} [2023-11-19 07:47:50,280 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2023-11-19 07:47:50,280 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 82 flow [2023-11-19 07:47:50,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 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:47:50,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:50,281 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:47:50,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:47:50,281 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:47:50,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash 987455867, now seen corresponding path program 4 times [2023-11-19 07:47:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:50,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943011656] [2023-11-19 07:47:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:47:50,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:47:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:47:50,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:47:50,389 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:47:50,390 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-19 07:47:50,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 07:47:50,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-19 07:47:50,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-19 07:47:50,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 07:47:50,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:47:50,393 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:50,399 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:47:50,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:47:50,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:47:50,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:47:50,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:47:50 BasicIcfg [2023-11-19 07:47:50,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:47:50,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:47:50,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:47:50,452 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:47:50,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:40" (3/4) ... [2023-11-19 07:47:50,453 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:47:50,471 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:47:50,472 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:47:50,546 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:47:50,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:47:50,547 INFO L158 Benchmark]: Toolchain (without parser) took 11531.26ms. Allocated memory was 184.5MB in the beginning and 247.5MB in the end (delta: 62.9MB). Free memory was 145.7MB in the beginning and 122.9MB in the end (delta: 22.8MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2023-11-19 07:47:50,547 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:47:50,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 733.63ms. Allocated memory is still 184.5MB. Free memory was 145.2MB in the beginning and 121.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:47:50,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.09ms. Allocated memory is still 184.5MB. Free memory was 121.6MB in the beginning and 118.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:47:50,548 INFO L158 Benchmark]: Boogie Preprocessor took 84.37ms. Allocated memory is still 184.5MB. Free memory was 118.4MB in the beginning and 116.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:47:50,548 INFO L158 Benchmark]: RCFGBuilder took 874.79ms. Allocated memory is still 184.5MB. Free memory was 116.9MB in the beginning and 143.0MB in the end (delta: -26.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2023-11-19 07:47:50,549 INFO L158 Benchmark]: TraceAbstraction took 9673.00ms. Allocated memory was 184.5MB in the beginning and 247.5MB in the end (delta: 62.9MB). Free memory was 141.9MB in the beginning and 130.2MB in the end (delta: 11.7MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2023-11-19 07:47:50,550 INFO L158 Benchmark]: Witness Printer took 95.06ms. Allocated memory is still 247.5MB. Free memory was 130.2MB in the beginning and 122.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:47:50,552 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.21ms. Allocated memory is still 117.4MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 733.63ms. Allocated memory is still 184.5MB. Free memory was 145.2MB in the beginning and 121.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.09ms. Allocated memory is still 184.5MB. Free memory was 121.6MB in the beginning and 118.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.37ms. Allocated memory is still 184.5MB. Free memory was 118.4MB in the beginning and 116.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 874.79ms. Allocated memory is still 184.5MB. Free memory was 116.9MB in the beginning and 143.0MB in the end (delta: -26.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9673.00ms. Allocated memory was 184.5MB in the beginning and 247.5MB in the end (delta: 62.9MB). Free memory was 141.9MB in the beginning and 130.2MB in the end (delta: 11.7MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * Witness Printer took 95.06ms. Allocated memory is still 247.5MB. Free memory was 130.2MB in the beginning and 122.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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~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: 3.9s, 98 PlacesBefore, 25 PlacesAfterwards, 93 TransitionsBefore, 19 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 3082 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1418, independent: 1293, independent conditional: 0, independent unconditional: 1293, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 746, independent: 714, independent conditional: 0, independent unconditional: 714, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1418, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 746, unknown conditional: 0, unknown unconditional: 746] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: 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: 829]: 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: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 11 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=7, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:47:50,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58007156-8a2a-4d9f-9f18-90c0a2a73b06/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE