/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_33-traces-v-matters_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:42:53,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:42:53,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:42:53,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:42:53,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:42:53,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:42:53,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:42:53,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:42:53,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:42:53,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:42:53,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:42:53,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:42:53,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:42:53,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:42:53,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:42:53,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:42:53,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:42:53,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:42:53,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:42:53,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:42:53,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:42:53,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:42:53,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:42:53,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:42:53,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:42:53,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:42:53,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:42:53,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:42:53,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:42:53,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:42:53,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:42:53,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:42:53,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:42:53,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:42:53,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:42:53,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:42:53,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:42:53,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:42:53,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:42:53,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:42:53,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:42:53,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:42:53,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:42:53,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:42:53,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:42:53,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:42:53,260 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:42:53,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:42:53,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:42:53,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:42:53,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:42:53,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:42:53,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:42:53,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:42:53,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:42:53,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:42:53,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:42:53,262 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:42:53,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:42:53,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:42:53,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:42:53,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:42:53,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:42:53,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:53,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:42:53,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:42:53,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:42:53,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:42:53,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:42:53,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:42:53,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-05 23:42:53,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:42:53,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:42:53,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:42:53,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:42:53,551 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:42:53,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_33-traces-v-matters_true.i [2022-12-05 23:42:54,520 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:42:54,754 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:42:54,754 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_33-traces-v-matters_true.i [2022-12-05 23:42:54,762 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbeda6d36/59d18ce54c75414ba1c5961daf138873/FLAGc4caef7fb [2022-12-05 23:42:54,773 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbeda6d36/59d18ce54c75414ba1c5961daf138873 [2022-12-05 23:42:54,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:42:54,776 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:42:54,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:54,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:42:54,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:42:54,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:54" (1/1) ... [2022-12-05 23:42:54,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1f93b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:54, skipping insertion in model container [2022-12-05 23:42:54,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:54" (1/1) ... [2022-12-05 23:42:54,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:42:54,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:42:54,949 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_33-traces-v-matters_true.i[1093,1106] [2022-12-05 23:42:55,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:55,097 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:42:55,107 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_33-traces-v-matters_true.i[1093,1106] [2022-12-05 23:42:55,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:55,160 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:42:55,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55 WrapperNode [2022-12-05 23:42:55,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:55,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:55,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:42:55,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:42:55,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,205 INFO L138 Inliner]: procedures = 162, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-12-05 23:42:55,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:55,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:42:55,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:42:55,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:42:55,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,232 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:42:55,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:42:55,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:42:55,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:42:55,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (1/1) ... [2022-12-05 23:42:55,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:55,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:42:55,269 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) [2022-12-05 23:42:55,290 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 [2022-12-05 23:42:55,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:42:55,301 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:42:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:42:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:42:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:42:55,302 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:42:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:42:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:42:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:42:55,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:42:55,303 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:42:55,446 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:42:55,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:42:55,587 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:42:55,591 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:42:55,592 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:42:55,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:55 BoogieIcfgContainer [2022-12-05 23:42:55,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:42:55,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:42:55,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:42:55,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:42:55,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:42:54" (1/3) ... [2022-12-05 23:42:55,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4be07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:55, skipping insertion in model container [2022-12-05 23:42:55,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:55" (2/3) ... [2022-12-05 23:42:55,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4be07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:55, skipping insertion in model container [2022-12-05 23:42:55,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:55" (3/3) ... [2022-12-05 23:42:55,601 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_33-traces-v-matters_true.i [2022-12-05 23:42:55,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:42:55,613 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:42:55,613 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:42:55,652 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:42:55,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 73 transitions, 151 flow [2022-12-05 23:42:55,704 INFO L130 PetriNetUnfolder]: 1/72 cut-off events. [2022-12-05 23:42:55,704 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:55,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 72 events. 1/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2022-12-05 23:42:55,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 73 transitions, 151 flow [2022-12-05 23:42:55,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 64 transitions, 131 flow [2022-12-05 23:42:55,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:55,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 131 flow [2022-12-05 23:42:55,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 64 transitions, 131 flow [2022-12-05 23:42:55,738 INFO L130 PetriNetUnfolder]: 0/64 cut-off events. [2022-12-05 23:42:55,738 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:55,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 64 events. 0/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 26 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:42:55,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 64 transitions, 131 flow [2022-12-05 23:42:55,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-05 23:42:58,520 INFO L203 LiptonReduction]: Total number of compositions: 49 [2022-12-05 23:42:58,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:42:58,535 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@3bd3e9fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:42:58,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-05 23:42:58,538 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-05 23:42:58,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:58,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:58,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:58,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:42:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash -356251018, now seen corresponding path program 1 times [2022-12-05 23:42:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:58,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061141754] [2022-12-05 23:42:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:58,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:58,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061141754] [2022-12-05 23:42:58,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061141754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:58,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:58,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713882382] [2022-12-05 23:42:58,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:58,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:58,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 16 [2022-12-05 23:42:58,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 35 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-05 23:42:58,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:58,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 16 [2022-12-05 23:42:58,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:58,812 INFO L130 PetriNetUnfolder]: 23/80 cut-off events. [2022-12-05 23:42:58,812 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:58,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 80 events. 23/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 256 event pairs, 12 based on Foata normal form. 6/86 useless extension candidates. Maximal degree in co-relation 139. Up to 44 conditions per place. [2022-12-05 23:42:58,814 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 13 selfloop transitions, 2 changer transitions 4/22 dead transitions. [2022-12-05 23:42:58,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 83 flow [2022-12-05 23:42:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-05 23:42:58,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-05 23:42:58,823 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 35 flow. Second operand 3 states and 31 transitions. [2022-12-05 23:42:58,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 83 flow [2022-12-05 23:42:58,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 22 transitions, 82 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:58,827 INFO L231 Difference]: Finished difference. Result has 22 places, 15 transitions, 40 flow [2022-12-05 23:42:58,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=22, PETRI_TRANSITIONS=15} [2022-12-05 23:42:58,831 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2022-12-05 23:42:58,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:58,831 INFO L89 Accepts]: Start accepts. Operand has 22 places, 15 transitions, 40 flow [2022-12-05 23:42:58,834 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:58,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:58,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 15 transitions, 40 flow [2022-12-05 23:42:58,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 40 flow [2022-12-05 23:42:58,842 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:42:58,843 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:42:58,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 0/15 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:42:58,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 40 flow [2022-12-05 23:42:58,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-05 23:42:58,942 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:42:58,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-05 23:42:58,946 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 13 transitions, 36 flow [2022-12-05 23:42:58,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-05 23:42:58,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:58,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:58,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:42:58,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:42:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash 277332042, now seen corresponding path program 1 times [2022-12-05 23:42:58,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:58,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923665873] [2022-12-05 23:42:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:59,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:59,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923665873] [2022-12-05 23:42:59,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923665873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:59,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:59,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49519201] [2022-12-05 23:42:59,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:59,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:59,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:59,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:59,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 13 [2022-12-05 23:42:59,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 13 transitions, 36 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-12-05 23:42:59,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:59,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 13 [2022-12-05 23:42:59,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:59,178 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2022-12-05 23:42:59,178 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:42:59,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 36 events. 10/36 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 4 based on Foata normal form. 3/39 useless extension candidates. Maximal degree in co-relation 76. Up to 20 conditions per place. [2022-12-05 23:42:59,179 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 9 selfloop transitions, 5 changer transitions 0/15 dead transitions. [2022-12-05 23:42:59,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 15 transitions, 70 flow [2022-12-05 23:42:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-12-05 23:42:59,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-05 23:42:59,184 INFO L175 Difference]: Start difference. First operand has 19 places, 13 transitions, 36 flow. Second operand 4 states and 20 transitions. [2022-12-05 23:42:59,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 15 transitions, 70 flow [2022-12-05 23:42:59,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 15 transitions, 68 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:59,186 INFO L231 Difference]: Finished difference. Result has 21 places, 13 transitions, 44 flow [2022-12-05 23:42:59,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=44, PETRI_PLACES=21, PETRI_TRANSITIONS=13} [2022-12-05 23:42:59,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2022-12-05 23:42:59,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:59,187 INFO L89 Accepts]: Start accepts. Operand has 21 places, 13 transitions, 44 flow [2022-12-05 23:42:59,187 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:59,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:59,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 13 transitions, 44 flow [2022-12-05 23:42:59,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 13 transitions, 44 flow [2022-12-05 23:42:59,194 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:42:59,194 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:42:59,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 15 events. 0/15 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:42:59,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 13 transitions, 44 flow [2022-12-05 23:42:59,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-05 23:42:59,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [221] L697-3-->L702: Formula: (let ((.cse3 (select |v_#pthreadsMutex_579| |v_~#C~0.base_147|))) (let ((.cse1 (store |v_#pthreadsMutex_579| |v_~#C~0.base_147| (store .cse3 |v_~#C~0.offset_147| 1)))) (let ((.cse2 (select .cse1 |v_~#D~0.base_125|))) (and (= (let ((.cse0 (store .cse1 |v_~#D~0.base_125| (store .cse2 |v_~#D~0.offset_125| 1)))) (store .cse0 |v_~#C~0.base_147| (store (select .cse0 |v_~#C~0.base_147|) |v_~#C~0.offset_147| 0))) |v_#pthreadsMutex_577|) (= v_~g~0_61 2) (= (select .cse2 |v_~#D~0.offset_125|) 0) (= (select .cse3 |v_~#C~0.offset_147|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_579|, ~#C~0.base=|v_~#C~0.base_147|, ~#C~0.offset=|v_~#C~0.offset_147|, ~#D~0.base=|v_~#D~0.base_125|, ~#D~0.offset=|v_~#D~0.offset_125|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_577|, ~#C~0.base=|v_~#C~0.base_147|, ~g~0=v_~g~0_61, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_41|, ~#C~0.offset=|v_~#C~0.offset_147|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_60|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_76|, ~#D~0.base=|v_~#D~0.base_125|, ~#D~0.offset=|v_~#D~0.offset_125|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_49|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre4#1] and [219] $Ultimate##0-->L689: Formula: (let ((.cse2 (select |v_#pthreadsMutex_561| |v_~#C~0.base_145|))) (let ((.cse1 (store |v_#pthreadsMutex_561| |v_~#C~0.base_145| (store .cse2 |v_~#C~0.offset_145| 1)))) (let ((.cse0 (select .cse1 |v_~#E~0.base_144|))) (and (= (select .cse0 |v_~#E~0.offset_142|) 0) (= (store .cse1 |v_~#E~0.base_144| (store .cse0 |v_~#E~0.offset_142| 1)) |v_#pthreadsMutex_559|) (= v_t_funThread1of1ForFork0_~arg.base_27 |v_t_funThread1of1ForFork0_#in~arg.base_27|) (= (select .cse2 |v_~#C~0.offset_145|) 0) (= v_~g~0_59 42) (= |v_t_funThread1of1ForFork0_#in~arg.offset_27| v_t_funThread1of1ForFork0_~arg.offset_27))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_561|, ~#E~0.offset=|v_~#E~0.offset_142|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#C~0.base=|v_~#C~0.base_145|, ~#C~0.offset=|v_~#C~0.offset_145|, ~#E~0.base=|v_~#E~0.base_144|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_559|, ~#E~0.offset=|v_~#E~0.offset_142|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~g~0=v_~g~0_59, ~#C~0.base=|v_~#C~0.base_145|, ~#C~0.offset=|v_~#C~0.offset_145|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_27, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_47|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_53|, ~#E~0.base=|v_~#E~0.base_144|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_27} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-05 23:42:59,480 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 23:42:59,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-05 23:42:59,481 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 7 transitions, 32 flow [2022-12-05 23:42:59,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-12-05 23:42:59,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:59,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:42:59,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:42:59,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:42:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash 7464465, now seen corresponding path program 1 times [2022-12-05 23:42:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:59,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727463531] [2022-12-05 23:42:59,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:59,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:59,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727463531] [2022-12-05 23:42:59,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727463531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:59,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:59,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304748735] [2022-12-05 23:42:59,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:59,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:59,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:59,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:59,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 7 [2022-12-05 23:42:59,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 7 transitions, 32 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2022-12-05 23:42:59,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:59,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 7 [2022-12-05 23:42:59,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:59,547 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-05 23:42:59,547 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 23:42:59,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 9 events. 0/9 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 1/10 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-12-05 23:42:59,548 INFO L137 encePairwiseOnDemand]: 3/7 looper letters, 3 selfloop transitions, 4 changer transitions 1/8 dead transitions. [2022-12-05 23:42:59,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 8 transitions, 52 flow [2022-12-05 23:42:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-12-05 23:42:59,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-05 23:42:59,549 INFO L175 Difference]: Start difference. First operand has 15 places, 7 transitions, 32 flow. Second operand 3 states and 9 transitions. [2022-12-05 23:42:59,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 8 transitions, 52 flow [2022-12-05 23:42:59,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 8 transitions, 38 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-05 23:42:59,549 INFO L231 Difference]: Finished difference. Result has 14 places, 7 transitions, 32 flow [2022-12-05 23:42:59,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=7, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=32, PETRI_PLACES=14, PETRI_TRANSITIONS=7} [2022-12-05 23:42:59,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -6 predicate places. [2022-12-05 23:42:59,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:59,550 INFO L89 Accepts]: Start accepts. Operand has 14 places, 7 transitions, 32 flow [2022-12-05 23:42:59,550 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:59,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:59,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 14 places, 7 transitions, 32 flow [2022-12-05 23:42:59,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 7 transitions, 32 flow [2022-12-05 23:42:59,552 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:42:59,552 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 23:42:59,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 8 events. 0/8 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 0/8 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-05 23:42:59,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 7 transitions, 32 flow [2022-12-05 23:42:59,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:59,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [226] L697-3-->t_funEXIT: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_632|, ~g~0=v_~g~0_78, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_82|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_33, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_55|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_47|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_33, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_66|, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_53|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_35|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_59|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_65|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, ULTIMATE.start_main_#t~nondet6#1, t_funThread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~pre4#1, t_funThread1of1ForFork0_#res.offset, ULTIMATE.start_main_#t~nondet5#1, t_funThread1of1ForFork0_~arg.offset, ULTIMATE.start_main_#t~nondet7#1, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#t~nondet3] and [223] L702-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_596| |v_~#E~0.base_154|))) (and (= (store |v_#pthreadsMutex_596| |v_~#E~0.base_154| (store .cse0 |v_~#E~0.offset_152| 1)) |v_#pthreadsMutex_595|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_19| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_19| (ite (= v_~g~0_67 2) 1 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_19| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_19|) (= (select .cse0 |v_~#E~0.offset_152|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_596|, ~#E~0.offset=|v_~#E~0.offset_152|, ~g~0=v_~g~0_67, ~#E~0.base=|v_~#E~0.base_154|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_595|, ~#E~0.offset=|v_~#E~0.offset_152|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_19|, ~g~0=v_~g~0_67, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_82|, ~#E~0.base=|v_~#E~0.base_154|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-05 23:42:59,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [223] L702-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_596| |v_~#E~0.base_154|))) (and (= (store |v_#pthreadsMutex_596| |v_~#E~0.base_154| (store .cse0 |v_~#E~0.offset_152| 1)) |v_#pthreadsMutex_595|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_19| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_19| (ite (= v_~g~0_67 2) 1 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_19| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_19|) (= (select .cse0 |v_~#E~0.offset_152|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_596|, ~#E~0.offset=|v_~#E~0.offset_152|, ~g~0=v_~g~0_67, ~#E~0.base=|v_~#E~0.base_154|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_595|, ~#E~0.offset=|v_~#E~0.offset_152|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_19|, ~g~0=v_~g~0_67, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_82|, ~#E~0.base=|v_~#E~0.base_154|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start___VERIFIER_assert_~cond#1] and [218] L691-->t_funEXIT: Formula: (and (= (let ((.cse0 (store |v_#pthreadsMutex_546| |v_~#C~0.base_139| (store (select |v_#pthreadsMutex_546| |v_~#C~0.base_139|) |v_~#C~0.offset_139| 0)))) (store .cse0 |v_~#D~0.base_116| (store (select .cse0 |v_~#D~0.base_116|) |v_~#D~0.offset_116| 0))) |v_#pthreadsMutex_544|) (= |v_t_funThread1of1ForFork0_#res.offset_25| 0) (= |v_t_funThread1of1ForFork0_#res.base_25| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_546|, ~#C~0.base=|v_~#C~0.base_139|, ~#C~0.offset=|v_~#C~0.offset_139|, ~#D~0.base=|v_~#D~0.base_116|, ~#D~0.offset=|v_~#D~0.offset_116|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_544|, ~#C~0.base=|v_~#C~0.base_139|, ~#C~0.offset=|v_~#C~0.offset_139|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_25|, ~#D~0.base=|v_~#D~0.base_116|, ~#D~0.offset=|v_~#D~0.offset_116|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-05 23:42:59,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [225] L697-3-->L691: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_626|, ~g~0=v_~g~0_76, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_80|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_31, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_53|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_45|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_31, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_64|, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_51|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_57|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_63|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, t_funThread1of1ForFork0_~arg.offset, ULTIMATE.start_main_#t~nondet7#1, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, ULTIMATE.start_main_#t~pre4#1] and [228] L702-->t_funEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_644| |v_~#E~0.base_172|))) (and (= |v_t_funThread1of1ForFork0_#res.base_39| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_30| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_30|) (= |v_t_funThread1of1ForFork0_#res.offset_39| 0) (= (select .cse0 |v_~#E~0.offset_169|) 0) (= (let ((.cse1 (let ((.cse2 (store |v_#pthreadsMutex_644| |v_~#E~0.base_172| (store .cse0 |v_~#E~0.offset_169| 1)))) (store .cse2 |v_~#C~0.base_161| (store (select .cse2 |v_~#C~0.base_161|) |v_~#C~0.offset_161| 0))))) (store .cse1 |v_~#D~0.base_144| (store (select .cse1 |v_~#D~0.base_144|) |v_~#D~0.offset_144| 0))) |v_#pthreadsMutex_642|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_30| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_30| (ite (= v_~g~0_82 2) 1 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_644|, ~#E~0.offset=|v_~#E~0.offset_169|, ~#C~0.base=|v_~#C~0.base_161|, ~g~0=v_~g~0_82, ~#C~0.offset=|v_~#C~0.offset_161|, ~#E~0.base=|v_~#E~0.base_172|, ~#D~0.base=|v_~#D~0.base_144|, ~#D~0.offset=|v_~#D~0.offset_144|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_642|, ~#E~0.offset=|v_~#E~0.offset_169|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_30|, ~#C~0.base=|v_~#C~0.base_161|, ~g~0=v_~g~0_82, ~#E~0.base=|v_~#E~0.base_172|, ~#D~0.base=|v_~#D~0.base_144|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_93|, ~#C~0.offset=|v_~#C~0.offset_161|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_39|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_30|, ~#D~0.offset=|v_~#D~0.offset_144|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet8#1, t_funThread1of1ForFork0_#res.base, ULTIMATE.start___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#res.offset] [2022-12-05 23:42:59,671 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:42:59,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-05 23:42:59,672 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 6 transitions, 36 flow [2022-12-05 23:42:59,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2022-12-05 23:42:59,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:59,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:42:59,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:42:59,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:42:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash 7464558, now seen corresponding path program 1 times [2022-12-05 23:42:59,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:59,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165981909] [2022-12-05 23:42:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:59,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:59,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165981909] [2022-12-05 23:42:59,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165981909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:59,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:59,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:59,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659070143] [2022-12-05 23:42:59,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:59,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:42:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:59,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:42:59,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:42:59,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 6 [2022-12-05 23:42:59,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 6 transitions, 36 flow. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2022-12-05 23:42:59,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:59,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 6 [2022-12-05 23:42:59,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:59,695 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:42:59,696 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:42:59,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10 conditions, 2 events. 0/2 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 2/4 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:42:59,697 INFO L137 encePairwiseOnDemand]: 3/6 looper letters, 0 selfloop transitions, 0 changer transitions 2/2 dead transitions. [2022-12-05 23:42:59,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 8 places, 2 transitions, 9 flow [2022-12-05 23:42:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:42:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:42:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2022-12-05 23:42:59,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 23:42:59,698 INFO L175 Difference]: Start difference. First operand has 12 places, 6 transitions, 36 flow. Second operand 2 states and 5 transitions. [2022-12-05 23:42:59,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 8 places, 2 transitions, 9 flow [2022-12-05 23:42:59,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 8 places, 2 transitions, 9 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:42:59,698 INFO L231 Difference]: Finished difference. Result has 8 places, 0 transitions, 0 flow [2022-12-05 23:42:59,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=6, PETRI_DIFFERENCE_MINUEND_FLOW=5, PETRI_DIFFERENCE_MINUEND_PLACES=7, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=8, PETRI_TRANSITIONS=0} [2022-12-05 23:42:59,699 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -12 predicate places. [2022-12-05 23:42:59,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:59,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 8 places, 0 transitions, 0 flow [2022-12-05 23:42:59,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:59,700 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:42:59,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:59,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 23:42:59,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:59,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:59,700 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:59,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 23:42:59,706 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:59,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2022-12-05 23:42:59,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-05 23:42:59,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-05 23:42:59,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:42:59,712 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-12-05 23:42:59,715 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:42:59,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:42:59,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:42:59 BasicIcfg [2022-12-05 23:42:59,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:42:59,721 INFO L158 Benchmark]: Toolchain (without parser) took 4944.37ms. Allocated memory was 209.7MB in the beginning and 298.8MB in the end (delta: 89.1MB). Free memory was 185.1MB in the beginning and 217.9MB in the end (delta: -32.8MB). Peak memory consumption was 57.3MB. Max. memory is 8.0GB. [2022-12-05 23:42:59,721 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 186.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:42:59,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.95ms. Allocated memory is still 209.7MB. Free memory was 185.1MB in the beginning and 166.1MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-05 23:42:59,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.28ms. Allocated memory is still 209.7MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:59,721 INFO L158 Benchmark]: Boogie Preprocessor took 27.85ms. Allocated memory is still 209.7MB. Free memory was 164.0MB in the beginning and 162.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:59,722 INFO L158 Benchmark]: RCFGBuilder took 359.08ms. Allocated memory is still 209.7MB. Free memory was 162.4MB in the beginning and 148.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 23:42:59,722 INFO L158 Benchmark]: TraceAbstraction took 4125.25ms. Allocated memory was 209.7MB in the beginning and 298.8MB in the end (delta: 89.1MB). Free memory was 147.8MB in the beginning and 217.9MB in the end (delta: -70.1MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2022-12-05 23:42:59,723 INFO L339 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 209.7MB. Free memory is still 186.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 383.95ms. Allocated memory is still 209.7MB. Free memory was 185.1MB in the beginning and 166.1MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.28ms. Allocated memory is still 209.7MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.85ms. Allocated memory is still 209.7MB. Free memory was 164.0MB in the beginning and 162.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 359.08ms. Allocated memory is still 209.7MB. Free memory was 162.4MB in the beginning and 148.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4125.25ms. Allocated memory was 209.7MB in the beginning and 298.8MB in the end (delta: 89.1MB). Free memory was 147.8MB in the beginning and 217.9MB in the end (delta: -70.1MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 68 PlacesBefore, 20 PlacesAfterwards, 64 TransitionsBefore, 16 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 15 ConcurrentYvCompositions, 0 ChoiceCompositions, 49 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 291, independent conditional: 291, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 340, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 340, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 340, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 265, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 265, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 340, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 265, unknown conditional: 0, unknown unconditional: 265] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 332, Positive conditional cache size: 0, Positive unconditional cache size: 332, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 13 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 38, independent conditional: 4, independent unconditional: 34, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 21 PlacesBefore, 15 PlacesAfterwards, 13 TransitionsBefore, 7 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 12, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 37, Positive conditional cache size: 4, Positive unconditional cache size: 33, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 13 PlacesBefore, 12 PlacesAfterwards, 7 TransitionsBefore, 6 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 4 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 37, Positive conditional cache size: 4, Positive unconditional cache size: 33, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 37, Positive conditional cache size: 4, Positive unconditional cache size: 33, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 88 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 2 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, InterpolantAutomatonStates: 12, 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.3s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:42:59,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...