/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_safe029_power.opt_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 18:49:41,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 18:49:41,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 18:49:41,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 18:49:41,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 18:49:41,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 18:49:41,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 18:49:41,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 18:49:41,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 18:49:41,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 18:49:41,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 18:49:41,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 18:49:41,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 18:49:41,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 18:49:41,171 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 18:49:41,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 18:49:41,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 18:49:41,172 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 18:49:41,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 18:49:41,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 18:49:41,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 18:49:41,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 18:49:41,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 18:49:41,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 18:49:41,183 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 18:49:41,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 18:49:41,184 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 18:49:41,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 18:49:41,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 18:49:41,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 18:49:41,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:49:41,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 18:49:41,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 18:49:41,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 18:49:41,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 18:49:41,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 18:49:41,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 18:49:41,187 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 18:49:41,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 18:49:41,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 18:49:41,187 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 18:49:41,187 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 18:49:41,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 18:49:41,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 18:49:41,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 18:49:41,430 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 18:49:41,430 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 18:49:41,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-03 18:49:42,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 18:49:42,793 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 18:49:42,794 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-03 18:49:42,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d6f8ea8/67a9140023964b2ab6554e8536630211/FLAGcc98bbb24 [2023-08-03 18:49:42,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d6f8ea8/67a9140023964b2ab6554e8536630211 [2023-08-03 18:49:42,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 18:49:42,827 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 18:49:42,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 18:49:42,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 18:49:42,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 18:49:42,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:49:42" (1/1) ... [2023-08-03 18:49:42,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7b0de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:42, skipping insertion in model container [2023-08-03 18:49:42,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:49:42" (1/1) ... [2023-08-03 18:49:42,873 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 18:49:42,998 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_safe029_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-03 18:49:43,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:49:43,172 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 18:49:43,184 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_safe029_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-03 18:49:43,200 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 18:49:43,202 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 18:49:43,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:49:43,274 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:49:43,274 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:49:43,282 INFO L206 MainTranslator]: Completed translation [2023-08-03 18:49:43,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43 WrapperNode [2023-08-03 18:49:43,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 18:49:43,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 18:49:43,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 18:49:43,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 18:49:43,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,351 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-03 18:49:43,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 18:49:43,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 18:49:43,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 18:49:43,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 18:49:43,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 18:49:43,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 18:49:43,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 18:49:43,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 18:49:43,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (1/1) ... [2023-08-03 18:49:43,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:49:43,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:49:43,458 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 18:49:43,474 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 18:49:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 18:49:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 18:49:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 18:49:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 18:49:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 18:49:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 18:49:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 18:49:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 18:49:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 18:49:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 18:49:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 18:49:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 18:49:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 18:49:43,509 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 18:49:43,658 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 18:49:43,660 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 18:49:43,917 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 18:49:44,062 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 18:49:44,063 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 18:49:44,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:49:44 BoogieIcfgContainer [2023-08-03 18:49:44,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 18:49:44,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 18:49:44,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 18:49:44,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 18:49:44,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 06:49:42" (1/3) ... [2023-08-03 18:49:44,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169cfe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:49:44, skipping insertion in model container [2023-08-03 18:49:44,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:49:43" (2/3) ... [2023-08-03 18:49:44,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169cfe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:49:44, skipping insertion in model container [2023-08-03 18:49:44,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:49:44" (3/3) ... [2023-08-03 18:49:44,072 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-03 18:49:44,078 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 18:49:44,089 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 18:49:44,089 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 18:49:44,089 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 18:49:44,128 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:49:44,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 100 transitions, 210 flow [2023-08-03 18:49:44,216 INFO L124 PetriNetUnfolderBase]: 14/216 cut-off events. [2023-08-03 18:49:44,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:49:44,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 14/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 603 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-03 18:49:44,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 100 transitions, 210 flow [2023-08-03 18:49:44,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 100 transitions, 210 flow [2023-08-03 18:49:44,228 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:49:44,235 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 100 transitions, 210 flow [2023-08-03 18:49:44,237 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 100 transitions, 210 flow [2023-08-03 18:49:44,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 100 transitions, 210 flow [2023-08-03 18:49:44,282 INFO L124 PetriNetUnfolderBase]: 14/216 cut-off events. [2023-08-03 18:49:44,283 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:49:44,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 14/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 603 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-03 18:49:44,286 INFO L119 LiptonReduction]: Number of co-enabled transitions 1432 [2023-08-03 18:49:47,202 INFO L134 LiptonReduction]: Checked pairs total: 3850 [2023-08-03 18:49:47,203 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-08-03 18:49:47,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:49:47,220 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;@39d03a20, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:49:47,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 18:49:47,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:49:47,224 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 18:49:47,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:49:47,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:49:47,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:49:47,225 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 18:49:47,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:49:47,229 INFO L85 PathProgramCache]: Analyzing trace with hash 436384621, now seen corresponding path program 1 times [2023-08-03 18:49:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:49:47,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639723644] [2023-08-03 18:49:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:49:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:49:47,415 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 18:49:47,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:49:47,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639723644] [2023-08-03 18:49:47,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639723644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:49:47,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:49:47,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:49:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560743639] [2023-08-03 18:49:47,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:49:47,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:49:47,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:49:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:49:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:49:47,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 189 [2023-08-03 18:49:47,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:49:47,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:49:47,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 189 [2023-08-03 18:49:47,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:49:47,606 INFO L124 PetriNetUnfolderBase]: 293/544 cut-off events. [2023-08-03 18:49:47,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:49:47,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 544 events. 293/544 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2657 event pairs, 128 based on Foata normal form. 24/452 useless extension candidates. Maximal degree in co-relation 1077. Up to 514 conditions per place. [2023-08-03 18:49:47,614 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-03 18:49:47,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 118 flow [2023-08-03 18:49:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:49:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:49:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2023-08-03 18:49:47,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48677248677248675 [2023-08-03 18:49:47,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 276 transitions. [2023-08-03 18:49:47,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 276 transitions. [2023-08-03 18:49:47,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:49:47,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 276 transitions. [2023-08-03 18:49:47,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 18:49:47,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 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 18:49:47,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 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 18:49:47,637 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 62 flow. Second operand 3 states and 276 transitions. [2023-08-03 18:49:47,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 118 flow [2023-08-03 18:49:47,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 18:49:47,641 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 68 flow [2023-08-03 18:49:47,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-03 18:49:47,645 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-03 18:49:47,645 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 68 flow [2023-08-03 18:49:47,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:49:47,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:49:47,646 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 18:49:47,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 18:49:47,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 18:49:47,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:49:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash 637579277, now seen corresponding path program 1 times [2023-08-03 18:49:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:49:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643879977] [2023-08-03 18:49:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:49:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:49:47,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:49:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:49:47,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:49:47,731 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:49:47,737 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 18:49:47,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 18:49:47,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 18:49:47,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-03 18:49:47,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 18:49:47,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 18:49:47,742 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 18:49:47,745 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 18:49:47,745 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 18:49:47,772 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:49:47,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 117 transitions, 258 flow [2023-08-03 18:49:47,818 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-03 18:49:47,819 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 18:49:47,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 449 events. 30/449 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1896 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 324. Up to 18 conditions per place. [2023-08-03 18:49:47,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 117 transitions, 258 flow [2023-08-03 18:49:47,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 117 transitions, 258 flow [2023-08-03 18:49:47,822 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:49:47,822 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 117 transitions, 258 flow [2023-08-03 18:49:47,822 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 117 transitions, 258 flow [2023-08-03 18:49:47,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 117 transitions, 258 flow [2023-08-03 18:49:47,868 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-03 18:49:47,868 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 18:49:47,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 449 events. 30/449 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1896 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 324. Up to 18 conditions per place. [2023-08-03 18:49:47,875 INFO L119 LiptonReduction]: Number of co-enabled transitions 3372 [2023-08-03 18:49:50,781 INFO L134 LiptonReduction]: Checked pairs total: 10224 [2023-08-03 18:49:50,782 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-03 18:49:50,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:49:50,784 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;@39d03a20, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:49:50,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 18:49:50,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:49:50,788 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 18:49:50,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:49:50,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:49:50,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:49:50,788 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 18:49:50,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:49:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash 652151593, now seen corresponding path program 1 times [2023-08-03 18:49:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:49:50,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053891175] [2023-08-03 18:49:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:50,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:49:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:49:50,863 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 18:49:50,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:49:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053891175] [2023-08-03 18:49:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053891175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:49:50,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:49:50,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:49:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009278397] [2023-08-03 18:49:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:49:50,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:49:50,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:49:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:49:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:49:50,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-08-03 18:49:50,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 18:49:50,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:49:50,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-08-03 18:49:50,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:49:53,122 INFO L124 PetriNetUnfolderBase]: 15012/21860 cut-off events. [2023-08-03 18:49:53,122 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-03 18:49:53,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43022 conditions, 21860 events. 15012/21860 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 139492 event pairs, 10800 based on Foata normal form. 620/18547 useless extension candidates. Maximal degree in co-relation 9495. Up to 20629 conditions per place. [2023-08-03 18:49:53,271 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 33 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-03 18:49:53,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 180 flow [2023-08-03 18:49:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:49:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:49:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-03 18:49:53,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-03 18:49:53,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-03 18:49:53,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-03 18:49:53,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:49:53,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-03 18:49:53,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:49:53,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 18:49:53,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 18:49:53,284 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 102 flow. Second operand 3 states and 319 transitions. [2023-08-03 18:49:53,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 180 flow [2023-08-03 18:49:53,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 176 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 18:49:53,289 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 108 flow [2023-08-03 18:49:53,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-03 18:49:53,290 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2023-08-03 18:49:53,290 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 108 flow [2023-08-03 18:49:53,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 18:49:53,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:49:53,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:49:53,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 18:49:53,291 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 18:49:53,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:49:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1797085874, now seen corresponding path program 1 times [2023-08-03 18:49:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:49:53,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704641312] [2023-08-03 18:49:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:53,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:49:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:49:53,388 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 18:49:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:49:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704641312] [2023-08-03 18:49:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704641312] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:49:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886004549] [2023-08-03 18:49:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:53,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:49:53,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:49:53,393 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 18:49:53,417 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 18:49:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:49:53,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:49:53,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:49:53,548 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 18:49:53,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:49:53,566 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 18:49:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886004549] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:49:53,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:49:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 18:49:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668888157] [2023-08-03 18:49:53,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:49:53,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:49:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:49:53,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:49:53,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:49:53,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2023-08-03 18:49:53,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 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 18:49:53,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:49:53,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2023-08-03 18:49:53,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:49:55,369 INFO L124 PetriNetUnfolderBase]: 12690/18194 cut-off events. [2023-08-03 18:49:55,370 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-03 18:49:55,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35797 conditions, 18194 events. 12690/18194 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 110784 event pairs, 5964 based on Foata normal form. 4/15061 useless extension candidates. Maximal degree in co-relation 9503. Up to 17113 conditions per place. [2023-08-03 18:49:55,454 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 38 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2023-08-03 18:49:55,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 214 flow [2023-08-03 18:49:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:49:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:49:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-03 18:49:55,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4964114832535885 [2023-08-03 18:49:55,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-03 18:49:55,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-03 18:49:55,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:49:55,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-03 18:49:55,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 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 18:49:55,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 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 18:49:55,459 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 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 18:49:55,459 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 108 flow. Second operand 4 states and 415 transitions. [2023-08-03 18:49:55,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 214 flow [2023-08-03 18:49:55,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:49:55,461 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 126 flow [2023-08-03 18:49:55,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-03 18:49:55,462 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 18:49:55,462 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 126 flow [2023-08-03 18:49:55,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 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 18:49:55,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:49:55,463 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 18:49:55,473 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 18:49:55,669 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 18:49:55,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:49:55,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:49:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash 326082803, now seen corresponding path program 1 times [2023-08-03 18:49:55,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:49:55,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424151015] [2023-08-03 18:49:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:49:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:49:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:49:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:49:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424151015] [2023-08-03 18:49:55,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424151015] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:49:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669250908] [2023-08-03 18:49:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:49:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:49:55,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:49:55,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 18:49:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:49:55,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 18:49:55,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:49:55,880 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 18:49:55,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:49:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669250908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:49:55,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:49:55,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 18:49:55,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380992690] [2023-08-03 18:49:55,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:49:55,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:49:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:49:55,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:49:55,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 18:49:55,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2023-08-03 18:49:55,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 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 18:49:55,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:49:55,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2023-08-03 18:49:55,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:49:57,529 INFO L124 PetriNetUnfolderBase]: 12666/18146 cut-off events. [2023-08-03 18:49:57,529 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2023-08-03 18:49:57,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35761 conditions, 18146 events. 12666/18146 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 110454 event pairs, 5952 based on Foata normal form. 16/15025 useless extension candidates. Maximal degree in co-relation 9479. Up to 17112 conditions per place. [2023-08-03 18:49:57,797 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 38 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2023-08-03 18:49:57,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 220 flow [2023-08-03 18:49:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:49:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:49:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-03 18:49:57,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851674641148325 [2023-08-03 18:49:57,799 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-03 18:49:57,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-03 18:49:57,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:49:57,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-03 18:49:57,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 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 18:49:57,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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 18:49:57,803 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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 18:49:57,803 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 126 flow. Second operand 5 states and 507 transitions. [2023-08-03 18:49:57,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 220 flow [2023-08-03 18:49:57,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 213 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 18:49:57,807 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 115 flow [2023-08-03 18:49:57,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-03 18:49:57,809 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 18:49:57,809 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 115 flow [2023-08-03 18:49:57,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 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 18:49:57,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:49:57,810 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:49:57,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 18:49:58,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:49:58,017 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 18:49:58,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:49:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash -166921988, now seen corresponding path program 1 times [2023-08-03 18:49:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:49:58,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743641564] [2023-08-03 18:49:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:49:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:49:58,146 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 18:49:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:49:58,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743641564] [2023-08-03 18:49:58,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743641564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:49:58,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:49:58,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 18:49:58,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630670118] [2023-08-03 18:49:58,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:49:58,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:49:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:49:58,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:49:58,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:49:58,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 209 [2023-08-03 18:49:58,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 18:49:58,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:49:58,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 209 [2023-08-03 18:49:58,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:49:59,258 INFO L124 PetriNetUnfolderBase]: 10842/15687 cut-off events. [2023-08-03 18:49:59,258 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-08-03 18:49:59,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30793 conditions, 15687 events. 10842/15687 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 95429 event pairs, 2106 based on Foata normal form. 0/13382 useless extension candidates. Maximal degree in co-relation 14373. Up to 13633 conditions per place. [2023-08-03 18:49:59,337 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 45 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-03 18:49:59,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 250 flow [2023-08-03 18:49:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:49:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:49:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-03 18:49:59,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5422647527910686 [2023-08-03 18:49:59,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-03 18:49:59,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-03 18:49:59,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:49:59,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-03 18:49:59,340 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 18:49:59,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 18:49:59,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 18:49:59,342 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 115 flow. Second operand 3 states and 340 transitions. [2023-08-03 18:49:59,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 250 flow [2023-08-03 18:49:59,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 18:49:59,344 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 131 flow [2023-08-03 18:49:59,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-03 18:49:59,345 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 18:49:59,345 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 131 flow [2023-08-03 18:49:59,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 18:49:59,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:49:59,345 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:49:59,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 18:49:59,346 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 18:49:59,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:49:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -879235820, now seen corresponding path program 1 times [2023-08-03 18:49:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:49:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909833336] [2023-08-03 18:49:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:49:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:49:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:49:59,389 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 18:49:59,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:49:59,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909833336] [2023-08-03 18:49:59,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909833336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:49:59,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:49:59,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 18:49:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435391938] [2023-08-03 18:49:59,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:49:59,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:49:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:49:59,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:49:59,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:49:59,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-08-03 18:49:59,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 18:49:59,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:49:59,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-08-03 18:49:59,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:50:00,539 INFO L124 PetriNetUnfolderBase]: 10698/15127 cut-off events. [2023-08-03 18:50:00,539 INFO L125 PetriNetUnfolderBase]: For 1289/1289 co-relation queries the response was YES. [2023-08-03 18:50:00,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32630 conditions, 15127 events. 10698/15127 cut-off events. For 1289/1289 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 89688 event pairs, 8154 based on Foata normal form. 0/12998 useless extension candidates. Maximal degree in co-relation 15317. Up to 14281 conditions per place. [2023-08-03 18:50:00,624 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 42 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-03 18:50:00,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 244 flow [2023-08-03 18:50:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:50:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:50:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-03 18:50:00,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518341307814992 [2023-08-03 18:50:00,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-03 18:50:00,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-03 18:50:00,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:50:00,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-03 18:50:00,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 18:50:00,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 18:50:00,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 18:50:00,631 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 131 flow. Second operand 3 states and 325 transitions. [2023-08-03 18:50:00,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 244 flow [2023-08-03 18:50:00,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:50:00,638 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 142 flow [2023-08-03 18:50:00,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-03 18:50:00,639 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2023-08-03 18:50:00,639 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 142 flow [2023-08-03 18:50:00,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 18:50:00,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:50:00,640 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:50:00,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 18:50:00,640 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 18:50:00,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:50:00,641 INFO L85 PathProgramCache]: Analyzing trace with hash -276598479, now seen corresponding path program 1 times [2023-08-03 18:50:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:50:00,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966340815] [2023-08-03 18:50:00,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:50:00,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:50:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:50:00,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:50:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:50:00,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:50:00,706 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:50:00,706 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-03 18:50:00,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 18:50:00,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 18:50:00,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 18:50:00,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 18:50:00,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 18:50:00,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 18:50:00,707 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 18:50:00,711 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 18:50:00,711 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 18:50:00,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 06:50:00 BasicIcfg [2023-08-03 18:50:00,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 18:50:00,776 INFO L158 Benchmark]: Toolchain (without parser) took 17949.90ms. Allocated memory was 360.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 314.8MB in the beginning and 414.5MB in the end (delta: -99.7MB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-03 18:50:00,777 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 360.7MB. Free memory is still 312.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 18:50:00,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.16ms. Allocated memory is still 360.7MB. Free memory was 314.4MB in the beginning and 291.9MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-03 18:50:00,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.12ms. Allocated memory is still 360.7MB. Free memory was 291.9MB in the beginning and 289.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 18:50:00,778 INFO L158 Benchmark]: Boogie Preprocessor took 53.77ms. Allocated memory is still 360.7MB. Free memory was 289.3MB in the beginning and 287.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:50:00,779 INFO L158 Benchmark]: RCFGBuilder took 658.22ms. Allocated memory was 360.7MB in the beginning and 520.1MB in the end (delta: 159.4MB). Free memory was 287.2MB in the beginning and 474.4MB in the end (delta: -187.2MB). Peak memory consumption was 28.3MB. Max. memory is 16.0GB. [2023-08-03 18:50:00,779 INFO L158 Benchmark]: TraceAbstraction took 16709.54ms. Allocated memory was 520.1MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 474.4MB in the beginning and 414.5MB in the end (delta: 59.9MB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-03 18:50:00,781 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.11ms. Allocated memory is still 360.7MB. Free memory is still 312.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 457.16ms. Allocated memory is still 360.7MB. Free memory was 314.4MB in the beginning and 291.9MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.12ms. Allocated memory is still 360.7MB. Free memory was 291.9MB in the beginning and 289.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 53.77ms. Allocated memory is still 360.7MB. Free memory was 289.3MB in the beginning and 287.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 658.22ms. Allocated memory was 360.7MB in the beginning and 520.1MB in the end (delta: 159.4MB). Free memory was 287.2MB in the beginning and 474.4MB in the end (delta: -187.2MB). Peak memory consumption was 28.3MB. Max. memory is 16.0GB. * TraceAbstraction took 16709.54ms. Allocated memory was 520.1MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 474.4MB in the beginning and 414.5MB in the end (delta: 59.9MB). Peak memory consumption was 1.3GB. 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.0s, 101 PlacesBefore, 30 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1432 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 89 TotalNumberOfCompositions, 3850 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1701, independent: 1558, independent conditional: 0, independent unconditional: 1558, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 767, independent: 745, independent conditional: 0, independent unconditional: 745, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1701, independent: 813, independent conditional: 0, independent unconditional: 813, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 767, unknown conditional: 0, unknown unconditional: 767] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 122 PlacesBefore, 47 PlacesAfterwards, 117 TransitionsBefore, 39 TransitionsAfterwards, 3372 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 10224 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3544, independent: 3310, independent conditional: 0, independent unconditional: 3310, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1667, independent: 1635, independent conditional: 0, independent unconditional: 1635, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3544, independent: 1675, independent conditional: 0, independent unconditional: 1675, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 1667, unknown conditional: 0, unknown unconditional: 1667] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475[2]; [L791] 0 int asdf=0; VAL [__unbuffered_cnt=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] COND TRUE 0 asdf<2 [L791] FCALL, FORK 0 pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0))=-3, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] COND TRUE 0 asdf<2 [L791] FCALL, FORK 0 pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0))=-2, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] COND FALSE 0 !(asdf<2) [L792] 0 pthread_t t2476[2]; [L793] 0 int asdf=0; VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] COND TRUE 0 asdf<2 [L793] FCALL, FORK 0 pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0))=-1, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 3 x$w_buff1 = x$w_buff0 [L755] 3 x$w_buff0 = 2 [L756] 3 x$w_buff1_used = x$w_buff0_used [L757] 3 x$w_buff0_used = (_Bool)1 [L758] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L758] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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] [L793] COND TRUE 0 asdf<2 [L793] FCALL, FORK 0 pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 4 x$w_buff1 = x$w_buff0 [L755] 4 x$w_buff0 = 2 [L756] 4 x$w_buff1_used = x$w_buff0_used [L757] 4 x$w_buff0_used = (_Bool)1 [L758] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=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] - 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: 791]: 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: 793]: 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, 114 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: 3.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 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=68occurred 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.0s 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, 131 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: 12.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 397 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 3 mSDtfsCounter, 397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred 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, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 23/31 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 18:50:00,808 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...