/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:33:43,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:33:44,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:33:44,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:33:44,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:33:44,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:33:44,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:33:44,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:33:44,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:33:44,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:33:44,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:33:44,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:33:44,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:33:44,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:33:44,048 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:33:44,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:33:44,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:33:44,048 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:33:44,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:33:44,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:33:44,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:33:44,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:33:44,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:33:44,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:33:44,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:33:44,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:33:44,050 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:33:44,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:33:44,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:33:44,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:33:44,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:33:44,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:33:44,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:33:44,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:33:44,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:33:44,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:33:44,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:33:44,053 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:33:44,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:33:44,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:33:44,054 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:33:44,054 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 17:33:44,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:33:44,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:33:44,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:33:44,291 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:33:44,292 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:33:44,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:33:45,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:33:45,747 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:33:45,748 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:33:45,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b7f0f6b7/2bfb5fdb661a420783d97432bd9164be/FLAGec1f81434 [2023-08-03 17:33:45,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b7f0f6b7/2bfb5fdb661a420783d97432bd9164be [2023-08-03 17:33:45,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:33:45,779 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:33:45,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:33:45,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:33:45,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:33:45,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:33:45" (1/1) ... [2023-08-03 17:33:45,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d8e100d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:45, skipping insertion in model container [2023-08-03 17:33:45,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:33:45" (1/1) ... [2023-08-03 17:33:45,821 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:33:45,944 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[983,996] [2023-08-03 17:33:46,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:33:46,159 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:33:46,171 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[983,996] [2023-08-03 17:33:46,189 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:33:46,191 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:33:46,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:33:46,259 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:33:46,259 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:33:46,265 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:33:46,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46 WrapperNode [2023-08-03 17:33:46,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:33:46,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:33:46,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:33:46,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:33:46,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,328 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-08-03 17:33:46,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:33:46,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:33:46,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:33:46,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:33:46,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:33:46,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:33:46,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:33:46,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:33:46,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (1/1) ... [2023-08-03 17:33:46,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:33:46,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:33:46,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 17:33:46,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 17:33:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:33:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:33:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:33:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:33:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:33:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:33:46,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:33:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:33:46,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:33:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:33:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:33:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:33:46,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:33:46,448 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:33:46,575 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:33:46,576 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:33:46,814 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:33:46,932 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:33:46,932 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 17:33:46,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:33:46 BoogieIcfgContainer [2023-08-03 17:33:46,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:33:46,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:33:46,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:33:46,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:33:46,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:33:45" (1/3) ... [2023-08-03 17:33:46,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d23aa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:33:46, skipping insertion in model container [2023-08-03 17:33:46,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:33:46" (2/3) ... [2023-08-03 17:33:46,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d23aa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:33:46, skipping insertion in model container [2023-08-03 17:33:46,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:33:46" (3/3) ... [2023-08-03 17:33:46,946 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:33:46,954 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:33:46,962 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:33:46,962 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:33:46,962 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:33:47,019 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:33:47,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 17:33:47,149 INFO L124 PetriNetUnfolderBase]: 14/223 cut-off events. [2023-08-03 17:33:47,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:33:47,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 14/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 628 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-03 17:33:47,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 17:33:47,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 105 transitions, 220 flow [2023-08-03 17:33:47,163 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:33:47,181 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 105 transitions, 220 flow [2023-08-03 17:33:47,185 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 105 transitions, 220 flow [2023-08-03 17:33:47,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 17:33:47,236 INFO L124 PetriNetUnfolderBase]: 14/223 cut-off events. [2023-08-03 17:33:47,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:33:47,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 14/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 628 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-03 17:33:47,240 INFO L119 LiptonReduction]: Number of co-enabled transitions 1608 [2023-08-03 17:33:50,398 INFO L134 LiptonReduction]: Checked pairs total: 4482 [2023-08-03 17:33:50,399 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-03 17:33:50,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:33:50,417 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ef392e7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:33:50,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 17:33:50,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:33:50,421 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-03 17:33:50,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:33:50,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:33:50,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:33:50,423 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-08-03 17:33:50,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:33:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash 451652374, now seen corresponding path program 1 times [2023-08-03 17:33:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:33:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030835620] [2023-08-03 17:33:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:33:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:33:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:33:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:33:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030835620] [2023-08-03 17:33:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030835620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:33:50,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:33:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:33:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765713584] [2023-08-03 17:33:50,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:33:50,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:33:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:33:50,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:33:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:33:50,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 198 [2023-08-03 17:33:50,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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-08-03 17:33:50,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:33:50,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 198 [2023-08-03 17:33:50,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:33:50,889 INFO L124 PetriNetUnfolderBase]: 293/576 cut-off events. [2023-08-03 17:33:50,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:33:50,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 576 events. 293/576 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2814 event pairs, 128 based on Foata normal form. 24/476 useless extension candidates. Maximal degree in co-relation 1097. Up to 514 conditions per place. [2023-08-03 17:33:50,895 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 23 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-03 17:33:50,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 120 flow [2023-08-03 17:33:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:33:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:33:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-08-03 17:33:50,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2023-08-03 17:33:50,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-08-03 17:33:50,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-08-03 17:33:50,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:33:50,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-08-03 17:33:50,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-08-03 17:33:50,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 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-08-03 17:33:50,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 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-08-03 17:33:50,919 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 64 flow. Second operand 3 states and 291 transitions. [2023-08-03 17:33:50,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 120 flow [2023-08-03 17:33:50,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:33:50,923 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 70 flow [2023-08-03 17:33:50,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-03 17:33:50,928 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-03 17:33:50,928 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 70 flow [2023-08-03 17:33:50,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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-08-03 17:33:50,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:33:50,929 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:33:50,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:33:50,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:33:50,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:33:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1109931437, now seen corresponding path program 1 times [2023-08-03 17:33:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:33:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728541693] [2023-08-03 17:33:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:33:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:33:50,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:33:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:33:51,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:33:51,001 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:33:51,002 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 17:33:51,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 17:33:51,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 17:33:51,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-03 17:33:51,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 17:33:51,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:33:51,011 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:33:51,015 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:33:51,015 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:33:51,045 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:33:51,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 17:33:51,115 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-03 17:33:51,115 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:33:51,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 464 events. 30/464 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1982 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 333. Up to 18 conditions per place. [2023-08-03 17:33:51,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 17:33:51,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 124 transitions, 272 flow [2023-08-03 17:33:51,122 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:33:51,122 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 124 transitions, 272 flow [2023-08-03 17:33:51,122 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 124 transitions, 272 flow [2023-08-03 17:33:51,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 17:33:51,165 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-03 17:33:51,166 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:33:51,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 464 events. 30/464 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1982 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 333. Up to 18 conditions per place. [2023-08-03 17:33:51,173 INFO L119 LiptonReduction]: Number of co-enabled transitions 3856 [2023-08-03 17:33:54,056 INFO L134 LiptonReduction]: Checked pairs total: 13069 [2023-08-03 17:33:54,057 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-03 17:33:54,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:33:54,063 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ef392e7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:33:54,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:33:54,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:33:54,066 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 17:33:54,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:33:54,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:33:54,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:33:54,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:33:54,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:33:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 680721912, now seen corresponding path program 1 times [2023-08-03 17:33:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:33:54,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087653880] [2023-08-03 17:33:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:33:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:33:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:33:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:33:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087653880] [2023-08-03 17:33:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087653880] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:33:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:33:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:33:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724521614] [2023-08-03 17:33:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:33:54,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:33:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:33:54,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:33:54,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:33:54,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2023-08-03 17:33:54,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-08-03 17:33:54,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:33:54,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2023-08-03 17:33:54,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:33:56,710 INFO L124 PetriNetUnfolderBase]: 15012/23296 cut-off events. [2023-08-03 17:33:56,710 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-03 17:33:56,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44458 conditions, 23296 events. 15012/23296 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 168511 event pairs, 10800 based on Foata normal form. 620/19716 useless extension candidates. Maximal degree in co-relation 9780. Up to 20629 conditions per place. [2023-08-03 17:33:56,860 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 33 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-03 17:33:56,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 188 flow [2023-08-03 17:33:56,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:33:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:33:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-03 17:33:56,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-03 17:33:56,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-03 17:33:56,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-03 17:33:56,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:33:56,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-03 17:33:56,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-08-03 17:33:56,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-08-03 17:33:56,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-08-03 17:33:56,874 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 110 flow. Second operand 3 states and 340 transitions. [2023-08-03 17:33:56,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 188 flow [2023-08-03 17:33:56,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 184 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 17:33:56,878 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 116 flow [2023-08-03 17:33:56,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-03 17:33:56,879 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-03 17:33:56,879 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 116 flow [2023-08-03 17:33:56,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-08-03 17:33:56,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:33:56,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:33:56,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:33:56,880 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:33:56,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:33:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1068827422, now seen corresponding path program 1 times [2023-08-03 17:33:56,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:33:56,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110668994] [2023-08-03 17:33:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:56,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:33:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:33:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:33:56,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:33:56,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110668994] [2023-08-03 17:33:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110668994] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:33:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160113027] [2023-08-03 17:33:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:56,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:33:56,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:33:56,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:33:56,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 17:33:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:33:57,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:33:57,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:33:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:33:57,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:33:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:33:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160113027] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:33:57,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:33:57,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-03 17:33:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492652606] [2023-08-03 17:33:57,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:33:57,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 17:33:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:33:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 17:33:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 17:33:57,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 221 [2023-08-03 17:33:57,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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-08-03 17:33:57,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:33:57,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 221 [2023-08-03 17:33:57,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:33:58,898 INFO L124 PetriNetUnfolderBase]: 12690/19378 cut-off events. [2023-08-03 17:33:58,899 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-03 17:33:58,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36981 conditions, 19378 events. 12690/19378 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 134214 event pairs, 5964 based on Foata normal form. 4/16054 useless extension candidates. Maximal degree in co-relation 9799. Up to 17113 conditions per place. [2023-08-03 17:33:59,030 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 38 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-03 17:33:59,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 222 flow [2023-08-03 17:33:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:33:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:33:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2023-08-03 17:33:59,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501131221719457 [2023-08-03 17:33:59,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2023-08-03 17:33:59,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2023-08-03 17:33:59,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:33:59,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2023-08-03 17:33:59,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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-08-03 17:33:59,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 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-08-03 17:33:59,037 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 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-08-03 17:33:59,037 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 116 flow. Second operand 4 states and 443 transitions. [2023-08-03 17:33:59,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 222 flow [2023-08-03 17:33:59,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:33:59,039 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 134 flow [2023-08-03 17:33:59,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-03 17:33:59,040 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-03 17:33:59,040 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 134 flow [2023-08-03 17:33:59,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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-08-03 17:33:59,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:33:59,041 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:33:59,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:33:59,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:33:59,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:33:59,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:33:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash -831814794, now seen corresponding path program 1 times [2023-08-03 17:33:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:33:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796201980] [2023-08-03 17:33:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:33:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:33:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:33:59,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:33:59,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796201980] [2023-08-03 17:33:59,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796201980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:33:59,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:33:59,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 17:33:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140587759] [2023-08-03 17:33:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:33:59,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:33:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:33:59,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:33:59,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:33:59,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 221 [2023-08-03 17:33:59,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-08-03 17:33:59,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:33:59,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 221 [2023-08-03 17:33:59,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:34:00,842 INFO L124 PetriNetUnfolderBase]: 12666/19330 cut-off events. [2023-08-03 17:34:00,843 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2023-08-03 17:34:00,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36945 conditions, 19330 events. 12666/19330 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 133846 event pairs, 5952 based on Foata normal form. 16/16018 useless extension candidates. Maximal degree in co-relation 9775. Up to 17112 conditions per place. [2023-08-03 17:34:00,982 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 38 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-08-03 17:34:00,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 228 flow [2023-08-03 17:34:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:34:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:34:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-03 17:34:00,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49049773755656106 [2023-08-03 17:34:00,986 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-03 17:34:00,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-03 17:34:00,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:34:00,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-03 17:34:00,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:34:00,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 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-08-03 17:34:00,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 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-08-03 17:34:00,990 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 134 flow. Second operand 5 states and 542 transitions. [2023-08-03 17:34:00,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 228 flow [2023-08-03 17:34:00,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 221 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:34:00,994 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 123 flow [2023-08-03 17:34:00,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-08-03 17:34:00,996 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-03 17:34:00,997 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 123 flow [2023-08-03 17:34:00,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-08-03 17:34:00,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:34:00,998 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:34:00,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 17:34:00,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:34:00,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:34:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash -509890035, now seen corresponding path program 1 times [2023-08-03 17:34:00,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:34:00,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81929740] [2023-08-03 17:34:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:34:00,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:34:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:34:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:34:01,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:34:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81929740] [2023-08-03 17:34:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81929740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:34:01,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:34:01,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:34:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258273353] [2023-08-03 17:34:01,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:34:01,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:34:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:34:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:34:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:34:01,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 221 [2023-08-03 17:34:01,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 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-08-03 17:34:01,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:34:01,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 221 [2023-08-03 17:34:01,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:34:02,524 INFO L124 PetriNetUnfolderBase]: 10842/16983 cut-off events. [2023-08-03 17:34:02,524 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-08-03 17:34:02,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32089 conditions, 16983 events. 10842/16983 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 118580 event pairs, 2106 based on Foata normal form. 0/14247 useless extension candidates. Maximal degree in co-relation 15021. Up to 13633 conditions per place. [2023-08-03 17:34:02,615 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 45 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-03 17:34:02,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 258 flow [2023-08-03 17:34:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:34:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:34:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-03 17:34:02,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444947209653092 [2023-08-03 17:34:02,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-03 17:34:02,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-03 17:34:02,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:34:02,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-03 17:34:02,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-08-03 17:34:02,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-08-03 17:34:02,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-08-03 17:34:02,621 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 123 flow. Second operand 3 states and 361 transitions. [2023-08-03 17:34:02,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 258 flow [2023-08-03 17:34:02,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 59 transitions, 253 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:34:02,626 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 139 flow [2023-08-03 17:34:02,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-03 17:34:02,630 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-03 17:34:02,630 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 139 flow [2023-08-03 17:34:02,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 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-08-03 17:34:02,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:34:02,631 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:34:02,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:34:02,631 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:34:02,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:34:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1373569341, now seen corresponding path program 1 times [2023-08-03 17:34:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:34:02,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913254994] [2023-08-03 17:34:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:34:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:34:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:34:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:34:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:34:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913254994] [2023-08-03 17:34:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913254994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:34:02,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:34:02,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:34:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878544637] [2023-08-03 17:34:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:34:02,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:34:02,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:34:02,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:34:02,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:34:02,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2023-08-03 17:34:02,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-08-03 17:34:02,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:34:02,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2023-08-03 17:34:02,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:34:03,980 INFO L124 PetriNetUnfolderBase]: 10698/16071 cut-off events. [2023-08-03 17:34:03,981 INFO L125 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES. [2023-08-03 17:34:04,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33574 conditions, 16071 events. 10698/16071 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 109305 event pairs, 8154 based on Foata normal form. 0/13647 useless extension candidates. Maximal degree in co-relation 15789. Up to 14281 conditions per place. [2023-08-03 17:34:04,073 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 42 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-03 17:34:04,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 252 flow [2023-08-03 17:34:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:34:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:34:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-03 17:34:04,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521870286576169 [2023-08-03 17:34:04,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-03 17:34:04,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-03 17:34:04,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:34:04,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-03 17:34:04,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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-08-03 17:34:04,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-08-03 17:34:04,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-08-03 17:34:04,078 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 139 flow. Second operand 3 states and 346 transitions. [2023-08-03 17:34:04,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 252 flow [2023-08-03 17:34:04,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:34:04,080 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 150 flow [2023-08-03 17:34:04,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-03 17:34:04,081 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-03 17:34:04,081 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 150 flow [2023-08-03 17:34:04,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-08-03 17:34:04,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:34:04,082 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:34:04,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:34:04,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:34:04,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:34:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -644272342, now seen corresponding path program 1 times [2023-08-03 17:34:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:34:04,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913337829] [2023-08-03 17:34:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:34:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:34:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:34:04,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:34:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:34:04,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:34:04,115 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:34:04,115 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-03 17:34:04,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:34:04,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:34:04,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:34:04,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:34:04,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:34:04,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:34:04,116 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:34:04,120 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:34:04,120 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:34:04,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:34:04 BasicIcfg [2023-08-03 17:34:04,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:34:04,184 INFO L158 Benchmark]: Toolchain (without parser) took 18405.06ms. Allocated memory was 455.1MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 404.1MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-03 17:34:04,184 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 339.7MB. Free memory was 293.3MB in the beginning and 293.2MB in the end (delta: 51.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:34:04,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.20ms. Allocated memory is still 455.1MB. Free memory was 403.7MB in the beginning and 381.0MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-03 17:34:04,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.06ms. Allocated memory is still 455.1MB. Free memory was 381.0MB in the beginning and 378.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 17:34:04,189 INFO L158 Benchmark]: Boogie Preprocessor took 42.48ms. Allocated memory is still 455.1MB. Free memory was 378.3MB in the beginning and 376.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:34:04,189 INFO L158 Benchmark]: RCFGBuilder took 561.53ms. Allocated memory is still 455.1MB. Free memory was 376.2MB in the beginning and 394.9MB in the end (delta: -18.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.0GB. [2023-08-03 17:34:04,189 INFO L158 Benchmark]: TraceAbstraction took 17243.11ms. Allocated memory was 455.1MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 394.0MB in the beginning and 1.6GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-03 17:34:04,191 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.13ms. Allocated memory is still 339.7MB. Free memory was 293.3MB in the beginning and 293.2MB in the end (delta: 51.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 486.20ms. Allocated memory is still 455.1MB. Free memory was 403.7MB in the beginning and 381.0MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 62.06ms. Allocated memory is still 455.1MB. Free memory was 381.0MB in the beginning and 378.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.48ms. Allocated memory is still 455.1MB. Free memory was 378.3MB in the beginning and 376.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 561.53ms. Allocated memory is still 455.1MB. Free memory was 376.2MB in the beginning and 394.9MB in the end (delta: -18.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.0GB. * TraceAbstraction took 17243.11ms. Allocated memory was 455.1MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 394.0MB in the beginning and 1.6GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 106 PlacesBefore, 31 PlacesAfterwards, 105 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 93 TotalNumberOfCompositions, 4482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1940, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 875, independent: 846, independent conditional: 0, independent unconditional: 846, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1940, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 875, unknown conditional: 0, unknown unconditional: 875] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 129 PlacesBefore, 51 PlacesAfterwards, 124 TransitionsBefore, 43 TransitionsAfterwards, 3856 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, 13069 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4666, independent: 4398, independent conditional: 0, independent unconditional: 4398, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1905, independent: 1862, independent conditional: 0, independent unconditional: 1862, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4666, independent: 2536, independent conditional: 0, independent unconditional: 2536, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 1905, unknown conditional: 0, unknown unconditional: 1905] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091[2]; [L803] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091={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, z=0] [L803] COND TRUE 0 asdf<2 [L803] FCALL, FORK 0 pthread_create(&t1091[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091[asdf], ((void *)0), P0, ((void *)0))=-1, t1091={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, z=0] [L803] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1091={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, z=0] [L803] COND TRUE 0 asdf<2 [L803] FCALL, FORK 0 pthread_create(&t1091[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091[asdf], ((void *)0), P0, ((void *)0))=0, t1091={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, z=0] [L803] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1091={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, z=0] [L803] COND FALSE 0 !(asdf<2) [L804] 0 pthread_t t1092[2]; [L805] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, t1092={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, z=0] [L805] COND TRUE 0 asdf<2 [L805] FCALL, FORK 0 pthread_create(&t1092[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092[asdf], ((void *)0), P1, ((void *)0))=1, t1091={5:0}, t1092={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, z=0] [L760] 3 x$w_buff1 = x$w_buff0 [L761] 3 x$w_buff0 = 2 [L762] 3 x$w_buff1_used = x$w_buff0_used [L763] 3 x$w_buff0_used = (_Bool)1 [L764] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L764] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L805] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L805] COND TRUE 0 asdf<2 [L805] FCALL, FORK 0 pthread_create(&t1092[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092[asdf], ((void *)0), P1, ((void *)0))=2, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 4 x$w_buff1 = x$w_buff0 [L761] 4 x$w_buff0 = 2 [L762] 4 x$w_buff1_used = x$w_buff0_used [L763] 4 x$w_buff0_used = (_Bool)1 [L764] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 121 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: 4.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=1, InterpolantAutomatonStates: 3, 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 3 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=5, InterpolantAutomatonStates: 18, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 20/23 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-08-03 17:34:04,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...