/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_safe011_power.opt_pso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 18:11:43,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 18:11:43,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 18:11:43,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 18:11:43,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 18:11:43,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 18:11:43,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 18:11:43,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 18:11:43,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 18:11:43,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 18:11:43,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 18:11:43,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 18:11:43,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 18:11:43,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 18:11:43,183 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 18:11:43,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 18:11:43,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 18:11:43,184 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 18:11:43,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 18:11:43,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 18:11:43,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 18:11:43,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 18:11:43,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 18:11:43,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 18:11:43,186 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 18:11:43,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 18:11:43,187 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 18:11:43,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 18:11:43,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 18:11:43,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 18:11:43,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:11:43,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 18:11:43,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 18:11:43,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 18:11:43,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 18:11:43,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 18:11:43,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 18:11:43,190 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 18:11:43,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 18:11:43,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 18:11:43,190 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 18:11:43,191 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:11:43,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 18:11:43,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 18:11:43,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 18:11:43,411 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 18:11:43,411 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 18:11:43,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe011_power.opt_pso.opt_bound2.i [2023-08-03 18:11:44,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 18:11:44,770 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 18:11:44,770 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe011_power.opt_pso.opt_bound2.i [2023-08-03 18:11:44,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d11937b/a586ce5fc1f2460885170609bd0750ad/FLAG8d3c05686 [2023-08-03 18:11:44,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d11937b/a586ce5fc1f2460885170609bd0750ad [2023-08-03 18:11:44,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 18:11:44,802 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 18:11:44,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 18:11:44,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 18:11:44,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 18:11:44,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:11:44" (1/1) ... [2023-08-03 18:11:44,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75343afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:44, skipping insertion in model container [2023-08-03 18:11:44,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:11:44" (1/1) ... [2023-08-03 18:11:44,871 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 18:11:45,003 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_safe011_power.opt_pso.opt_bound2.i[959,972] [2023-08-03 18:11:45,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:11:45,192 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 18:11:45,203 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_safe011_power.opt_pso.opt_bound2.i[959,972] [2023-08-03 18:11:45,222 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 18:11:45,224 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 18:11:45,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:11:45,292 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:11:45,292 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:11:45,297 INFO L206 MainTranslator]: Completed translation [2023-08-03 18:11:45,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45 WrapperNode [2023-08-03 18:11:45,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 18:11:45,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 18:11:45,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 18:11:45,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 18:11:45,305 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:11:45" (1/1) ... [2023-08-03 18:11:45,326 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:11:45" (1/1) ... [2023-08-03 18:11:45,351 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-03 18:11:45,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 18:11:45,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 18:11:45,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 18:11:45,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 18:11:45,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 18:11:45,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 18:11:45,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 18:11:45,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 18:11:45,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (1/1) ... [2023-08-03 18:11:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:11:45,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:11:45,445 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:11:45,449 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:11:45,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 18:11:45,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 18:11:45,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 18:11:45,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 18:11:45,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 18:11:45,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 18:11:45,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 18:11:45,474 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 18:11:45,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 18:11:45,474 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 18:11:45,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 18:11:45,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 18:11:45,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 18:11:45,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 18:11:45,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 18:11:45,476 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:11:45,597 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 18:11:45,599 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 18:11:45,947 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 18:11:46,069 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 18:11:46,069 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 18:11:46,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:11:46 BoogieIcfgContainer [2023-08-03 18:11:46,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 18:11:46,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 18:11:46,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 18:11:46,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 18:11:46,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 06:11:44" (1/3) ... [2023-08-03 18:11:46,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b44b22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:11:46, skipping insertion in model container [2023-08-03 18:11:46,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:11:45" (2/3) ... [2023-08-03 18:11:46,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b44b22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:11:46, skipping insertion in model container [2023-08-03 18:11:46,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:11:46" (3/3) ... [2023-08-03 18:11:46,082 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe011_power.opt_pso.opt_bound2.i [2023-08-03 18:11:46,090 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 18:11:46,098 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 18:11:46,098 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 18:11:46,098 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 18:11:46,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:11:46,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-03 18:11:46,336 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-03 18:11:46,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:11:46,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1969 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 269. Up to 16 conditions per place. [2023-08-03 18:11:46,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 128 transitions, 271 flow [2023-08-03 18:11:46,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 128 transitions, 271 flow [2023-08-03 18:11:46,355 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:11:46,366 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 128 transitions, 271 flow [2023-08-03 18:11:46,368 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 128 transitions, 271 flow [2023-08-03 18:11:46,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-03 18:11:46,426 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-03 18:11:46,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:11:46,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1969 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 269. Up to 16 conditions per place. [2023-08-03 18:11:46,435 INFO L119 LiptonReduction]: Number of co-enabled transitions 2698 [2023-08-03 18:11:49,773 INFO L134 LiptonReduction]: Checked pairs total: 6777 [2023-08-03 18:11:49,774 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-03 18:11:49,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:11:49,791 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;@25ebab30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:11:49,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 18:11:49,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:11:49,795 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 18:11:49,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:11:49,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:11:49,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:11:49,796 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:11:49,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:11:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash 533636640, now seen corresponding path program 1 times [2023-08-03 18:11:49,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:11:49,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533345102] [2023-08-03 18:11:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:11:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:11:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:11:50,024 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:11:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:11:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533345102] [2023-08-03 18:11:50,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533345102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:11:50,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:11:50,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:11:50,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558498256] [2023-08-03 18:11:50,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:11:50,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:11:50,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:11:50,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:11:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:11:50,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-03 18:11:50,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:11:50,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:11:50,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-03 18:11:50,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:11:50,526 INFO L124 PetriNetUnfolderBase]: 2161/3484 cut-off events. [2023-08-03 18:11:50,526 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 18:11:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6886 conditions, 3484 events. 2161/3484 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 19933 event pairs, 1312 based on Foata normal form. 120/2984 useless extension candidates. Maximal degree in co-relation 6865. Up to 3294 conditions per place. [2023-08-03 18:11:50,548 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 30 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-03 18:11:50,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 155 flow [2023-08-03 18:11:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:11:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:11:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-03 18:11:50,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035161744022504 [2023-08-03 18:11:50,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-03 18:11:50,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-03 18:11:50,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:11:50,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-03 18:11:50,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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:11:50,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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:11:50,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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:11:50,586 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 85 flow. Second operand 3 states and 358 transitions. [2023-08-03 18:11:50,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 155 flow [2023-08-03 18:11:50,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 155 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 18:11:50,591 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 91 flow [2023-08-03 18:11:50,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-03 18:11:50,596 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-03 18:11:50,596 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 91 flow [2023-08-03 18:11:50,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:11:50,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:11:50,597 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 18:11:50,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 18:11:50,597 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:11:50,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:11:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash -652478484, now seen corresponding path program 1 times [2023-08-03 18:11:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:11:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590355719] [2023-08-03 18:11:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:11:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:11:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:11:50,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:11:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:11:50,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:11:50,663 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:11:50,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 18:11:50,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 18:11:50,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 18:11:50,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 18:11:50,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 18:11:50,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 18:11:50,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 18:11:50,667 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 18:11:50,669 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 18:11:50,669 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 18:11:50,693 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:11:50,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 18:11:50,867 INFO L124 PetriNetUnfolderBase]: 93/1380 cut-off events. [2023-08-03 18:11:50,867 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 18:11:50,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 1380 events. 93/1380 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9505 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 1003. Up to 54 conditions per place. [2023-08-03 18:11:50,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 18:11:50,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 153 transitions, 342 flow [2023-08-03 18:11:50,877 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:11:50,878 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-03 18:11:50,878 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-03 18:11:50,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 18:11:51,006 INFO L124 PetriNetUnfolderBase]: 93/1380 cut-off events. [2023-08-03 18:11:51,007 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 18:11:51,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 1380 events. 93/1380 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9505 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 1003. Up to 54 conditions per place. [2023-08-03 18:11:51,039 INFO L119 LiptonReduction]: Number of co-enabled transitions 6496 [2023-08-03 18:11:54,376 INFO L134 LiptonReduction]: Checked pairs total: 18716 [2023-08-03 18:11:54,376 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-03 18:11:54,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:11:54,379 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;@25ebab30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:11:54,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 18:11:54,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:11:54,381 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-03 18:11:54,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:11:54,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:11:54,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:11:54,384 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:11:54,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:11:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash 812342496, now seen corresponding path program 1 times [2023-08-03 18:11:54,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:11:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781753916] [2023-08-03 18:11:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:11:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:11:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:11:54,466 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:11:54,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:11:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781753916] [2023-08-03 18:11:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781753916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:11:54,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:11:54,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:11:54,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744152026] [2023-08-03 18:11:54,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:11:54,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:11:54,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:11:54,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:11:54,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:11:54,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 267 [2023-08-03 18:11:54,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:11:54,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:11:54,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 267 [2023-08-03 18:11:54,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:12:46,504 INFO L124 PetriNetUnfolderBase]: 468866/614602 cut-off events. [2023-08-03 18:12:46,504 INFO L125 PetriNetUnfolderBase]: For 9588/9588 co-relation queries the response was YES. [2023-08-03 18:12:48,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214260 conditions, 614602 events. 468866/614602 cut-off events. For 9588/9588 co-relation queries the response was YES. Maximal size of possible extension queue 15306. Compared 4404185 event pairs, 380024 based on Foata normal form. 13020/544257 useless extension candidates. Maximal degree in co-relation 261790. Up to 587323 conditions per place. [2023-08-03 18:12:50,502 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 44 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-03 18:12:50,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 58 transitions, 244 flow [2023-08-03 18:12:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:12:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:12:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-03 18:12:50,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280898876404494 [2023-08-03 18:12:50,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-03 18:12:50,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-03 18:12:50,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:12:50,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-03 18:12:50,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:12:50,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:12:50,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:12:50,509 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 144 flow. Second operand 3 states and 423 transitions. [2023-08-03 18:12:50,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 58 transitions, 244 flow [2023-08-03 18:12:50,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 238 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 18:12:50,526 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 148 flow [2023-08-03 18:12:50,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2023-08-03 18:12:50,527 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-03 18:12:50,527 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 148 flow [2023-08-03 18:12:50,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:12:50,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:12:50,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:12:50,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 18:12:50,528 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:12:50,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:12:50,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1905198417, now seen corresponding path program 1 times [2023-08-03 18:12:50,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:12:50,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986705356] [2023-08-03 18:12:50,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:12:50,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:12:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:12:50,637 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:12:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:12:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986705356] [2023-08-03 18:12:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986705356] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:12:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699305396] [2023-08-03 18:12:50,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:12:50,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:12:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:12:50,649 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:12:50,653 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:12:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:12:50,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:12:50,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:12:50,809 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:12:50,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:12:50,834 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:12:50,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699305396] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:12:50,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:12:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 18:12:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785246154] [2023-08-03 18:12:50,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:12:50,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:12:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:12:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:12:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:12:50,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-03 18:12:50,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 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:12:50,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:12:50,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-03 18:12:50,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:13:33,195 INFO L124 PetriNetUnfolderBase]: 389314/506034 cut-off events. [2023-08-03 18:13:33,196 INFO L125 PetriNetUnfolderBase]: For 6296/6296 co-relation queries the response was YES. [2023-08-03 18:13:35,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998727 conditions, 506034 events. 389314/506034 cut-off events. For 6296/6296 co-relation queries the response was YES. Maximal size of possible extension queue 13483. Compared 3490068 event pairs, 247180 based on Foata normal form. 4/439365 useless extension candidates. Maximal degree in co-relation 261519. Up to 484009 conditions per place. [2023-08-03 18:13:38,176 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 49 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2023-08-03 18:13:38,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 276 flow [2023-08-03 18:13:38,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:13:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:13:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-03 18:13:38,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149812734082397 [2023-08-03 18:13:38,207 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-03 18:13:38,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-03 18:13:38,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:13:38,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-03 18:13:38,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 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:13:38,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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:13:38,214 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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:13:38,214 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 148 flow. Second operand 4 states and 550 transitions. [2023-08-03 18:13:38,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 276 flow [2023-08-03 18:13:38,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:13:38,217 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 166 flow [2023-08-03 18:13:38,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2023-08-03 18:13:38,219 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2023-08-03 18:13:38,220 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 166 flow [2023-08-03 18:13:38,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 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:13:38,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:13:38,220 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 18:13:38,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 18:13:38,426 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:13:38,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:13:38,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:13:38,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1773066556, now seen corresponding path program 1 times [2023-08-03 18:13:38,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:13:38,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492096652] [2023-08-03 18:13:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:38,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:13:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:13:38,560 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:13:38,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:13:38,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492096652] [2023-08-03 18:13:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492096652] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:13:38,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135249273] [2023-08-03 18:13:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:38,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:13:38,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:13:38,574 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:13:38,613 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:13:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:13:38,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 18:13:38,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:13:38,732 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:13:38,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:13:38,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135249273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:13:38,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:13:38,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 18:13:38,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498321251] [2023-08-03 18:13:38,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:13:38,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:13:38,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:13:38,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:13:38,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 18:13:38,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-03 18:13:38,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 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:13:38,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:13:38,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-03 18:13:38,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:19,126 INFO L124 PetriNetUnfolderBase]: 389290/505986 cut-off events. [2023-08-03 18:14:19,126 INFO L125 PetriNetUnfolderBase]: For 6396/6396 co-relation queries the response was YES. [2023-08-03 18:14:20,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998691 conditions, 505986 events. 389290/505986 cut-off events. For 6396/6396 co-relation queries the response was YES. Maximal size of possible extension queue 13483. Compared 3489344 event pairs, 247168 based on Foata normal form. 16/439329 useless extension candidates. Maximal degree in co-relation 261495. Up to 484008 conditions per place. [2023-08-03 18:14:22,474 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 49 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-03 18:14:22,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 63 transitions, 282 flow [2023-08-03 18:14:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:14:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:14:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-03 18:14:22,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041198501872659 [2023-08-03 18:14:22,477 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-03 18:14:22,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-03 18:14:22,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:22,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-03 18:14:22,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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:14:22,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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:14:22,482 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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:14:22,482 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 166 flow. Second operand 5 states and 673 transitions. [2023-08-03 18:14:22,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 63 transitions, 282 flow [2023-08-03 18:14:22,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 63 transitions, 275 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 18:14:22,484 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 155 flow [2023-08-03 18:14:22,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-08-03 18:14:22,485 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2023-08-03 18:14:22,485 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 155 flow [2023-08-03 18:14:22,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 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:14:22,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:22,486 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:14:22,494 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:14:22,691 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:14:22,691 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:14:22,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1185633343, now seen corresponding path program 1 times [2023-08-03 18:14:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49699780] [2023-08-03 18:14:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:22,850 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:14:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49699780] [2023-08-03 18:14:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49699780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:14:22,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:14:22,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 18:14:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074613847] [2023-08-03 18:14:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:14:22,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:14:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:22,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:14:22,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:14:22,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 267 [2023-08-03 18:14:22,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:14:22,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:22,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 267 [2023-08-03 18:14:22,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:55,896 INFO L124 PetriNetUnfolderBase]: 335018/438311 cut-off events. [2023-08-03 18:14:55,897 INFO L125 PetriNetUnfolderBase]: For 5801/5801 co-relation queries the response was YES. [2023-08-03 18:14:57,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862411 conditions, 438311 events. 335018/438311 cut-off events. For 5801/5801 co-relation queries the response was YES. Maximal size of possible extension queue 11794. Compared 3073857 event pairs, 55610 based on Foata normal form. 0/388614 useless extension candidates. Maximal degree in co-relation 410525. Up to 383649 conditions per place. [2023-08-03 18:14:58,655 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 67 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-08-03 18:14:58,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 81 transitions, 364 flow [2023-08-03 18:14:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:14:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:14:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-08-03 18:14:58,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568039950062422 [2023-08-03 18:14:58,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-08-03 18:14:58,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-08-03 18:14:58,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:58,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-08-03 18:14:58,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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:14:58,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:14:58,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:14:58,660 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 155 flow. Second operand 3 states and 455 transitions. [2023-08-03 18:14:58,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 81 transitions, 364 flow [2023-08-03 18:14:58,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 81 transitions, 359 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 18:14:58,663 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 171 flow [2023-08-03 18:14:58,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2023-08-03 18:14:58,664 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2023-08-03 18:14:58,664 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 171 flow [2023-08-03 18:14:58,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:14:58,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:58,664 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:14:58,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 18:14:58,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:14:58,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:58,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1243335931, now seen corresponding path program 1 times [2023-08-03 18:14:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336352450] [2023-08-03 18:14:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:58,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:58,714 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:14:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336352450] [2023-08-03 18:14:58,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336352450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:14:58,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:14:58,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 18:14:58,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121006714] [2023-08-03 18:14:58,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:14:58,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:14:58,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:14:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:14:58,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 267 [2023-08-03 18:14:58,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:14:58,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:58,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 267 [2023-08-03 18:14:58,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:15:33,934 INFO L124 PetriNetUnfolderBase]: 326858/427335 cut-off events. [2023-08-03 18:15:33,935 INFO L125 PetriNetUnfolderBase]: For 32441/32441 co-relation queries the response was YES. [2023-08-03 18:15:35,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896200 conditions, 427335 events. 326858/427335 cut-off events. For 32441/32441 co-relation queries the response was YES. Maximal size of possible extension queue 12043. Compared 2969931 event pairs, 274810 based on Foata normal form. 0/381542 useless extension candidates. Maximal degree in co-relation 428173. Up to 406153 conditions per place. [2023-08-03 18:15:36,897 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 53 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-03 18:15:36,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 306 flow [2023-08-03 18:15:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:15:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:15:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-03 18:15:36,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343320848938826 [2023-08-03 18:15:36,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-03 18:15:36,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-03 18:15:36,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:15:36,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-03 18:15:36,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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:15:36,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:15:36,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:15:36,902 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 171 flow. Second operand 3 states and 428 transitions. [2023-08-03 18:15:36,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 306 flow [2023-08-03 18:15:36,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:15:36,906 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 180 flow [2023-08-03 18:15:36,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2023-08-03 18:15:36,907 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2023-08-03 18:15:36,907 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 180 flow [2023-08-03 18:15:36,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:15:36,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:36,907 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:15:36,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 18:15:36,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:15:36,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash 298581243, now seen corresponding path program 1 times [2023-08-03 18:15:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51290860] [2023-08-03 18:15:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:15:36,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:15:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:15:36,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:15:36,944 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:15:36,944 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 18:15:36,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 18:15:36,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 18:15:36,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 18:15:36,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 18:15:36,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 18:15:36,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 18:15:36,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 18:15:36,945 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 18:15:36,949 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 18:15:36,949 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 18:15:37,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 06:15:37 BasicIcfg [2023-08-03 18:15:37,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 18:15:37,004 INFO L158 Benchmark]: Toolchain (without parser) took 232201.80ms. Allocated memory was 343.9MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 293.0MB in the beginning and 9.7GB in the end (delta: -9.4GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-08-03 18:15:37,004 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 343.9MB. Free memory is still 293.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 18:15:37,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.20ms. Allocated memory is still 343.9MB. Free memory was 292.6MB in the beginning and 269.2MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 18:15:37,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.08ms. Allocated memory is still 343.9MB. Free memory was 269.2MB in the beginning and 266.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:15:37,005 INFO L158 Benchmark]: Boogie Preprocessor took 54.38ms. Allocated memory is still 343.9MB. Free memory was 266.4MB in the beginning and 264.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:15:37,005 INFO L158 Benchmark]: RCFGBuilder took 663.75ms. Allocated memory was 343.9MB in the beginning and 513.8MB in the end (delta: 169.9MB). Free memory was 264.3MB in the beginning and 453.5MB in the end (delta: -189.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.0GB. [2023-08-03 18:15:37,006 INFO L158 Benchmark]: TraceAbstraction took 230928.06ms. Allocated memory was 513.8MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 452.4MB in the beginning and 9.7GB in the end (delta: -9.2GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-08-03 18:15:37,007 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.10ms. Allocated memory is still 343.9MB. Free memory is still 293.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 495.20ms. Allocated memory is still 343.9MB. Free memory was 292.6MB in the beginning and 269.2MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.08ms. Allocated memory is still 343.9MB. Free memory was 269.2MB in the beginning and 266.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.38ms. Allocated memory is still 343.9MB. Free memory was 266.4MB in the beginning and 264.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 663.75ms. Allocated memory was 343.9MB in the beginning and 513.8MB in the end (delta: 169.9MB). Free memory was 264.3MB in the beginning and 453.5MB in the end (delta: -189.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.0GB. * TraceAbstraction took 230928.06ms. Allocated memory was 513.8MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 452.4MB in the beginning and 9.7GB in the end (delta: -9.2GB). Peak memory consumption was 6.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.4s, 130 PlacesBefore, 41 PlacesAfterwards, 128 TransitionsBefore, 35 TransitionsAfterwards, 2698 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 109 TotalNumberOfCompositions, 6777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2815, independent: 2652, independent conditional: 0, independent unconditional: 2652, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1403, independent: 1377, independent conditional: 0, independent unconditional: 1377, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2815, independent: 1275, independent conditional: 0, independent unconditional: 1275, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 1403, unknown conditional: 0, unknown unconditional: 1403] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 161 PlacesBefore, 66 PlacesAfterwards, 153 TransitionsBefore, 54 TransitionsAfterwards, 6496 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 114 TotalNumberOfCompositions, 18716 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7454, independent: 7168, independent conditional: 0, independent unconditional: 7168, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3182, independent: 3119, independent conditional: 0, independent unconditional: 3119, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7454, independent: 4049, independent conditional: 0, independent unconditional: 4049, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 3182, unknown conditional: 0, unknown unconditional: 3182] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 366, Positive conditional cache size: 0, Positive unconditional cache size: 366, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028[2]; [L819] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L819] COND TRUE 0 asdf<2 [L819] FCALL, FORK 0 pthread_create(&t2028[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2028[asdf], ((void *)0), P0, ((void *)0))=-3, t2028={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L819] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2028={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L819] COND TRUE 0 asdf<2 [L819] FCALL, FORK 0 pthread_create(&t2028[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2028[asdf], ((void *)0), P0, ((void *)0))=-2, t2028={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L819] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2028={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L819] COND FALSE 0 !(asdf<2) [L820] 0 pthread_t t2029[2]; [L821] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L821] COND TRUE 0 asdf<2 [L821] FCALL, FORK 0 pthread_create(&t2029[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2029[asdf], ((void *)0), P1, ((void *)0))=-1, t2028={5:0}, t2029={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L761] 3 x$w_buff1 = x$w_buff0 [L762] 3 x$w_buff0 = 2 [L763] 3 x$w_buff1_used = x$w_buff0_used [L764] 3 x$w_buff0_used = (_Bool)1 [L765] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L765] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L821] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L821] COND TRUE 0 asdf<2 [L821] FCALL, FORK 0 pthread_create(&t2029[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2029[asdf], ((void *)0), P1, ((void *)0))=0, t2028={5:0}, t2029={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L761] 4 x$w_buff1 = x$w_buff0 [L762] 4 x$w_buff0 = 2 [L763] 4 x$w_buff1_used = x$w_buff0_used [L764] 4 x$w_buff0_used = (_Bool)1 [L765] 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, __unbuffered_p2_EAX=0, arg={0:0}, expression=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 823]: 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 7 procedures, 149 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: 4.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 62 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=91occurred 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 10 procedures, 174 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 226.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 221.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 492 IncrementalHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 9 mSDtfsCounter, 492 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=180occurred 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.5s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 284 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:15:37,029 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...