/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_mix054_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:42:56,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:42:56,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:42:56,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:42:56,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:42:56,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:42:56,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:42:56,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:42:56,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:42:56,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:42:56,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:42:56,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:42:56,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:42:56,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:42:56,904 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:42:56,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:42:56,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:42:56,905 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:42:56,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:42:56,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:42:56,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:42:56,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:42:56,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:42:56,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:42:56,907 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:42:56,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:42:56,907 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:42:56,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:42:56,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:42:56,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:42:56,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:42:56,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:42:56,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:42:56,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:42:56,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:42:56,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:42:56,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:42:56,911 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:42:56,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:42:56,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:42:56,911 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:42:56,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 17:42:57,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:42:57,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:42:57,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:42:57,178 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:42:57,179 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:42:57,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix054_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:42:58,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:42:58,513 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:42:58,513 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix054_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:42:58,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1587661e4/2b439a44aaf74fbcb69ee8c25e680281/FLAG30f5b1de9 [2023-08-03 17:42:58,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1587661e4/2b439a44aaf74fbcb69ee8c25e680281 [2023-08-03 17:42:58,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:42:58,552 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:42:58,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:42:58,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:42:58,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:42:58,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:42:58" (1/1) ... [2023-08-03 17:42:58,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fba9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:58, skipping insertion in model container [2023-08-03 17:42:58,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:42:58" (1/1) ... [2023-08-03 17:42:58,619 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:42:58,799 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_mix054_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[973,986] [2023-08-03 17:42:58,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:42:58,984 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:42:58,994 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_mix054_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[973,986] [2023-08-03 17:42:59,001 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:42:59,003 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:42:59,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:42:59,055 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:42:59,055 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:42:59,061 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:42:59,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59 WrapperNode [2023-08-03 17:42:59,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:42:59,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:42:59,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:42:59,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:42:59,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,116 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-03 17:42:59,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:42:59,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:42:59,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:42:59,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:42:59,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:42:59,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:42:59,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:42:59,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:42:59,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (1/1) ... [2023-08-03 17:42:59,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:42:59,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:42:59,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 17:42:59,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 17:42:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:42:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:42:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:42:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:42:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:42:59,228 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:42:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:42:59,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:42:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:42:59,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:42:59,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:42:59,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:42:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:42:59,231 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:42:59,415 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:42:59,416 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:42:59,643 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:42:59,836 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:42:59,836 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 17:42:59,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:42:59 BoogieIcfgContainer [2023-08-03 17:42:59,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:42:59,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:42:59,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:42:59,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:42:59,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:42:58" (1/3) ... [2023-08-03 17:42:59,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246e727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:42:59, skipping insertion in model container [2023-08-03 17:42:59,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:42:59" (2/3) ... [2023-08-03 17:42:59,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246e727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:42:59, skipping insertion in model container [2023-08-03 17:42:59,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:42:59" (3/3) ... [2023-08-03 17:42:59,849 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix054_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:42:59,856 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:42:59,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:42:59,864 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:42:59,864 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:42:59,922 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:42:59,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 101 transitions, 212 flow [2023-08-03 17:43:00,041 INFO L124 PetriNetUnfolderBase]: 14/217 cut-off events. [2023-08-03 17:43:00,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:43:00,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 217 events. 14/217 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 594 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2023-08-03 17:43:00,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 101 transitions, 212 flow [2023-08-03 17:43:00,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 101 transitions, 212 flow [2023-08-03 17:43:00,054 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:43:00,061 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 101 transitions, 212 flow [2023-08-03 17:43:00,065 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 101 transitions, 212 flow [2023-08-03 17:43:00,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 101 transitions, 212 flow [2023-08-03 17:43:00,119 INFO L124 PetriNetUnfolderBase]: 14/217 cut-off events. [2023-08-03 17:43:00,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:43:00,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 217 events. 14/217 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 594 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2023-08-03 17:43:00,122 INFO L119 LiptonReduction]: Number of co-enabled transitions 1432 [2023-08-03 17:43:03,152 INFO L134 LiptonReduction]: Checked pairs total: 3490 [2023-08-03 17:43:03,152 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-03 17:43:03,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:43:03,171 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;@6bf07688, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:43:03,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 17:43:03,175 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:43:03,176 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 17:43:03,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:43:03,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:43:03,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:43:03,177 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:43:03,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:43:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 436496158, now seen corresponding path program 1 times [2023-08-03 17:43:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:43:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905464317] [2023-08-03 17:43:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:43:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:43:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:43:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:43:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905464317] [2023-08-03 17:43:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905464317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:43:03,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:43:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:43:03,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846330133] [2023-08-03 17:43:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:43:03,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:43:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:43:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:43:03,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:43:03,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 188 [2023-08-03 17:43:03,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:03,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:43:03,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 188 [2023-08-03 17:43:03,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:43:03,597 INFO L124 PetriNetUnfolderBase]: 293/556 cut-off events. [2023-08-03 17:43:03,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:43:03,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 556 events. 293/556 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2594 event pairs, 128 based on Foata normal form. 24/460 useless extension candidates. Maximal degree in co-relation 1077. Up to 514 conditions per place. [2023-08-03 17:43:03,604 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-03 17:43:03,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 118 flow [2023-08-03 17:43:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:43:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:43:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-08-03 17:43:03,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946808510638298 [2023-08-03 17:43:03,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-08-03 17:43:03,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-08-03 17:43:03,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:43:03,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-08-03 17:43:03,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:03,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:03,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:03,645 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 62 flow. Second operand 3 states and 279 transitions. [2023-08-03 17:43:03,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 118 flow [2023-08-03 17:43:03,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:43:03,649 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 68 flow [2023-08-03 17:43:03,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-03 17:43:03,654 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-03 17:43:03,655 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 68 flow [2023-08-03 17:43:03,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:03,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:43:03,656 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:43:03,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:43:03,656 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:43:03,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:43:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash 633953302, now seen corresponding path program 1 times [2023-08-03 17:43:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:43:03,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372785618] [2023-08-03 17:43:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:43:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:43:03,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:43:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:43:03,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:43:03,741 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:43:03,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 17:43:03,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 17:43:03,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 17:43:03,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-03 17:43:03,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 17:43:03,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:43:03,749 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:43:03,751 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:43:03,751 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:43:03,777 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:43:03,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 118 transitions, 260 flow [2023-08-03 17:43:03,838 INFO L124 PetriNetUnfolderBase]: 30/450 cut-off events. [2023-08-03 17:43:03,838 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:43:03,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 450 events. 30/450 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1876 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 325. Up to 18 conditions per place. [2023-08-03 17:43:03,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 118 transitions, 260 flow [2023-08-03 17:43:03,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 118 transitions, 260 flow [2023-08-03 17:43:03,844 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:43:03,845 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 118 transitions, 260 flow [2023-08-03 17:43:03,845 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 118 transitions, 260 flow [2023-08-03 17:43:03,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 118 transitions, 260 flow [2023-08-03 17:43:03,893 INFO L124 PetriNetUnfolderBase]: 30/450 cut-off events. [2023-08-03 17:43:03,893 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:43:03,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 450 events. 30/450 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1876 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 325. Up to 18 conditions per place. [2023-08-03 17:43:03,900 INFO L119 LiptonReduction]: Number of co-enabled transitions 3372 [2023-08-03 17:43:06,613 INFO L134 LiptonReduction]: Checked pairs total: 9502 [2023-08-03 17:43:06,613 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-03 17:43:06,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:43:06,616 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;@6bf07688, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:43:06,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:43:06,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:43:06,622 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 17:43:06,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:43:06,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:43:06,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:43:06,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:43:06,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:43:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 654966394, now seen corresponding path program 1 times [2023-08-03 17:43:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:43:06,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972268953] [2023-08-03 17:43:06,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:43:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:43:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:43:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:43:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972268953] [2023-08-03 17:43:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972268953] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:43:06,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:43:06,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:43:06,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523207819] [2023-08-03 17:43:06,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:43:06,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:43:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:43:06,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:43:06,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:43:06,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 212 [2023-08-03 17:43:06,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:06,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:43:06,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 212 [2023-08-03 17:43:06,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:43:08,991 INFO L124 PetriNetUnfolderBase]: 15012/21860 cut-off events. [2023-08-03 17:43:08,991 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-03 17:43:09,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43022 conditions, 21860 events. 15012/21860 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 139357 event pairs, 10800 based on Foata normal form. 620/18579 useless extension candidates. Maximal degree in co-relation 9495. Up to 20629 conditions per place. [2023-08-03 17:43:09,130 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 33 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-03 17:43:09,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 180 flow [2023-08-03 17:43:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:43:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:43:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-08-03 17:43:09,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062893081761006 [2023-08-03 17:43:09,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-08-03 17:43:09,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-08-03 17:43:09,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:43:09,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-08-03 17:43:09,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:09,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:09,139 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:09,139 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 102 flow. Second operand 3 states and 322 transitions. [2023-08-03 17:43:09,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 180 flow [2023-08-03 17:43:09,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 176 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 17:43:09,144 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 108 flow [2023-08-03 17:43:09,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-03 17:43:09,145 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2023-08-03 17:43:09,145 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 108 flow [2023-08-03 17:43:09,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:09,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:43:09,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:43:09,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:43:09,146 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:43:09,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:43:09,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1149838731, now seen corresponding path program 1 times [2023-08-03 17:43:09,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:43:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418222735] [2023-08-03 17:43:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:43:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:43:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:43:09,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:43:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418222735] [2023-08-03 17:43:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418222735] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:43:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752586872] [2023-08-03 17:43:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:43:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:43:09,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:43:09,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 17:43:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:43:09,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:43:09,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:43:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:43:09,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:43:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:43:09,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752586872] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:43:09,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:43:09,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:43:09,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906711634] [2023-08-03 17:43:09,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:43:09,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:43:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:43:09,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:43:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:43:09,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-08-03 17:43:09,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:09,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:43:09,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-08-03 17:43:09,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:43:11,356 INFO L124 PetriNetUnfolderBase]: 12690/18194 cut-off events. [2023-08-03 17:43:11,357 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-03 17:43:11,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35797 conditions, 18194 events. 12690/18194 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 110685 event pairs, 5964 based on Foata normal form. 4/15093 useless extension candidates. Maximal degree in co-relation 9503. Up to 17113 conditions per place. [2023-08-03 17:43:11,436 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 38 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2023-08-03 17:43:11,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 214 flow [2023-08-03 17:43:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:43:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:43:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-08-03 17:43:11,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49410377358490565 [2023-08-03 17:43:11,439 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-08-03 17:43:11,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-08-03 17:43:11,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:43:11,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-08-03 17:43:11,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:11,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:11,442 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:11,442 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 108 flow. Second operand 4 states and 419 transitions. [2023-08-03 17:43:11,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 214 flow [2023-08-03 17:43:11,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:43:11,444 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 126 flow [2023-08-03 17:43:11,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-03 17:43:11,448 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 17:43:11,448 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 126 flow [2023-08-03 17:43:11,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:11,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:43:11,449 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:43:11,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:43:11,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:43:11,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:43:11,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:43:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1023007528, now seen corresponding path program 1 times [2023-08-03 17:43:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:43:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862767550] [2023-08-03 17:43:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:43:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:43:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:43:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:43:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862767550] [2023-08-03 17:43:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862767550] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:43:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78639452] [2023-08-03 17:43:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:11,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:43:11,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:43:11,756 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 17:43:11,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 17:43:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:43:11,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:43:11,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:43:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:43:11,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:43:11,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78639452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:43:11,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:43:11,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:43:11,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973680625] [2023-08-03 17:43:11,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:43:11,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:43:11,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:43:11,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:43:11,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:43:11,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-08-03 17:43:11,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:11,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:43:11,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-08-03 17:43:11,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:43:13,364 INFO L124 PetriNetUnfolderBase]: 12666/18146 cut-off events. [2023-08-03 17:43:13,364 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2023-08-03 17:43:13,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35761 conditions, 18146 events. 12666/18146 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 110442 event pairs, 5952 based on Foata normal form. 16/15057 useless extension candidates. Maximal degree in co-relation 9479. Up to 17112 conditions per place. [2023-08-03 17:43:13,460 INFO L140 encePairwiseOnDemand]: 209/212 looper letters, 38 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2023-08-03 17:43:13,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 220 flow [2023-08-03 17:43:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:43:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:43:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-03 17:43:13,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830188679245283 [2023-08-03 17:43:13,462 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-03 17:43:13,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-03 17:43:13,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:43:13,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-03 17:43:13,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:13,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:13,467 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:13,467 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 126 flow. Second operand 5 states and 512 transitions. [2023-08-03 17:43:13,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 220 flow [2023-08-03 17:43:13,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 213 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:43:13,471 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 115 flow [2023-08-03 17:43:13,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-03 17:43:13,472 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 17:43:13,472 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 115 flow [2023-08-03 17:43:13,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:13,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:43:13,473 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:43:13,481 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 17:43:13,681 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 17:43:13,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:43:13,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:43:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -437086371, now seen corresponding path program 1 times [2023-08-03 17:43:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:43:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195165293] [2023-08-03 17:43:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:43:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:43:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:43:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:43:13,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195165293] [2023-08-03 17:43:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195165293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:43:13,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:43:13,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:43:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905565581] [2023-08-03 17:43:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:43:13,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:43:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:43:13,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:43:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:43:13,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 212 [2023-08-03 17:43:13,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:13,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:43:13,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 212 [2023-08-03 17:43:13,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:43:15,095 INFO L124 PetriNetUnfolderBase]: 10842/15687 cut-off events. [2023-08-03 17:43:15,096 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-08-03 17:43:15,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30793 conditions, 15687 events. 10842/15687 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 95255 event pairs, 2106 based on Foata normal form. 0/13382 useless extension candidates. Maximal degree in co-relation 14373. Up to 13633 conditions per place. [2023-08-03 17:43:15,175 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 45 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-03 17:43:15,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 250 flow [2023-08-03 17:43:15,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:43:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:43:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-03 17:43:15,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.539308176100629 [2023-08-03 17:43:15,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-03 17:43:15,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-03 17:43:15,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:43:15,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-03 17:43:15,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:15,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:15,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:15,181 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 115 flow. Second operand 3 states and 343 transitions. [2023-08-03 17:43:15,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 250 flow [2023-08-03 17:43:15,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:43:15,185 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 131 flow [2023-08-03 17:43:15,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-03 17:43:15,188 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 17:43:15,189 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 131 flow [2023-08-03 17:43:15,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:15,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:43:15,189 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:43:15,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:43:15,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:43:15,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:43:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash -664785367, now seen corresponding path program 1 times [2023-08-03 17:43:15,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:43:15,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896148626] [2023-08-03 17:43:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:43:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:43:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:43:15,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:43:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896148626] [2023-08-03 17:43:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896148626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:43:15,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:43:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:43:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149168546] [2023-08-03 17:43:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:43:15,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:43:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:43:15,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:43:15,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:43:15,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 212 [2023-08-03 17:43:15,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:15,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:43:15,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 212 [2023-08-03 17:43:15,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:43:16,390 INFO L124 PetriNetUnfolderBase]: 10698/15127 cut-off events. [2023-08-03 17:43:16,390 INFO L125 PetriNetUnfolderBase]: For 1289/1289 co-relation queries the response was YES. [2023-08-03 17:43:16,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32630 conditions, 15127 events. 10698/15127 cut-off events. For 1289/1289 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 89716 event pairs, 8154 based on Foata normal form. 0/12902 useless extension candidates. Maximal degree in co-relation 15317. Up to 14281 conditions per place. [2023-08-03 17:43:16,474 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 42 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-03 17:43:16,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 244 flow [2023-08-03 17:43:16,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:43:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:43:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-03 17:43:16,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157232704402516 [2023-08-03 17:43:16,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-03 17:43:16,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-03 17:43:16,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:43:16,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-03 17:43:16,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:16,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:16,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:16,479 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 131 flow. Second operand 3 states and 328 transitions. [2023-08-03 17:43:16,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 244 flow [2023-08-03 17:43:16,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:43:16,484 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 142 flow [2023-08-03 17:43:16,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-03 17:43:16,485 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2023-08-03 17:43:16,485 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 142 flow [2023-08-03 17:43:16,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:43:16,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:43:16,485 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:43:16,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:43:16,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:43:16,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:43:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 639085454, now seen corresponding path program 1 times [2023-08-03 17:43:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:43:16,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872868521] [2023-08-03 17:43:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:43:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:43:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:43:16,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:43:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:43:16,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:43:16,521 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:43:16,521 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-03 17:43:16,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:43:16,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:43:16,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:43:16,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:43:16,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:43:16,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:43:16,522 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:43:16,526 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:43:16,526 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:43:16,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:43:16 BasicIcfg [2023-08-03 17:43:16,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:43:16,567 INFO L158 Benchmark]: Toolchain (without parser) took 18015.32ms. Allocated memory was 568.3MB in the beginning and 2.0GB in the end (delta: 1.4GB). Free memory was 516.7MB in the beginning and 999.6MB in the end (delta: -482.9MB). Peak memory consumption was 957.1MB. Max. memory is 16.0GB. [2023-08-03 17:43:16,568 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 377.5MB. Free memory was 328.6MB in the beginning and 328.5MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:43:16,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.18ms. Allocated memory is still 568.3MB. Free memory was 516.4MB in the beginning and 493.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:43:16,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.62ms. Allocated memory is still 568.3MB. Free memory was 493.6MB in the beginning and 491.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:43:16,568 INFO L158 Benchmark]: Boogie Preprocessor took 31.00ms. Allocated memory is still 568.3MB. Free memory was 491.0MB in the beginning and 488.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:43:16,569 INFO L158 Benchmark]: RCFGBuilder took 689.31ms. Allocated memory is still 568.3MB. Free memory was 488.9MB in the beginning and 504.8MB in the end (delta: -15.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.0GB. [2023-08-03 17:43:16,569 INFO L158 Benchmark]: TraceAbstraction took 16725.47ms. Allocated memory was 568.3MB in the beginning and 2.0GB in the end (delta: 1.4GB). Free memory was 504.1MB in the beginning and 999.6MB in the end (delta: -495.6MB). Peak memory consumption was 942.7MB. Max. memory is 16.0GB. [2023-08-03 17:43:16,570 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 377.5MB. Free memory was 328.6MB in the beginning and 328.5MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 507.18ms. Allocated memory is still 568.3MB. Free memory was 516.4MB in the beginning and 493.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.62ms. Allocated memory is still 568.3MB. Free memory was 493.6MB in the beginning and 491.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.00ms. Allocated memory is still 568.3MB. Free memory was 491.0MB in the beginning and 488.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 689.31ms. Allocated memory is still 568.3MB. Free memory was 488.9MB in the beginning and 504.8MB in the end (delta: -15.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.0GB. * TraceAbstraction took 16725.47ms. Allocated memory was 568.3MB in the beginning and 2.0GB in the end (delta: 1.4GB). Free memory was 504.1MB in the beginning and 999.6MB in the end (delta: -495.6MB). Peak memory consumption was 942.7MB. 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.1s, 102 PlacesBefore, 30 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1432 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, 3490 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1659, independent: 1534, independent conditional: 0, independent unconditional: 1534, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 760, independent: 734, independent conditional: 0, independent unconditional: 734, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1659, independent: 800, independent conditional: 0, independent unconditional: 800, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 760, unknown conditional: 0, unknown unconditional: 760] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 123 PlacesBefore, 47 PlacesAfterwards, 118 TransitionsBefore, 39 TransitionsAfterwards, 3372 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 94 TotalNumberOfCompositions, 9502 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3669, independent: 3465, independent conditional: 0, independent unconditional: 3465, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1681, independent: 1650, independent conditional: 0, independent unconditional: 1650, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3669, independent: 1815, independent conditional: 0, independent unconditional: 1815, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 1681, unknown conditional: 0, unknown unconditional: 1681] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447[2]; [L793] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] COND TRUE 0 asdf<2 [L793] FCALL, FORK 0 pthread_create(&t1447[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447[asdf], ((void *)0), P0, ((void *)0))=-4, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] COND TRUE 0 asdf<2 [L793] FCALL, FORK 0 pthread_create(&t1447[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447[asdf], ((void *)0), P0, ((void *)0))=-3, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] COND FALSE 0 !(asdf<2) [L794] 0 pthread_t t1448[2]; [L795] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L795] COND TRUE 0 asdf<2 [L795] FCALL, FORK 0 pthread_create(&t1448[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448[asdf], ((void *)0), P1, ((void *)0))=-2, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 3 x$w_buff1 = x$w_buff0 [L757] 3 x$w_buff0 = 2 [L758] 3 x$w_buff1_used = x$w_buff0_used [L759] 3 x$w_buff0_used = (_Bool)1 [L760] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L760] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L795] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L795] COND TRUE 0 asdf<2 [L795] FCALL, FORK 0 pthread_create(&t1448[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448[asdf], ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 4 x$w_buff1 = x$w_buff0 [L757] 4 x$w_buff0 = 2 [L758] 4 x$w_buff1_used = x$w_buff0_used [L759] 4 x$w_buff0_used = (_Bool)1 [L760] 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_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 4 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 272 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 17:43:16,588 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...