/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/time_var_mutex.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:16:10,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:16:10,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:16:10,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:16:10,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:16:10,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:16:10,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:16:10,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:16:10,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:16:10,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:16:10,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:16:10,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:16:10,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:16:10,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:16:10,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:16:10,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:16:10,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:16:10,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:16:10,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:16:10,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:16:10,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:16:10,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:16:10,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:16:10,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:16:10,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:16:10,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:16:10,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:16:10,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:16:10,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:16:10,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:16:10,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:16:10,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:16:10,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:16:10,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:16:10,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:16:10,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:16:10,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:16:10,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:16:10,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:16:10,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:16:10,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:16:10,226 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:16:10,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:16:10,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:16:10,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:16:10,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:16:10,270 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:16:10,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:16:10,271 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:16:10,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:16:10,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:16:10,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:16:10,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:16:10,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:16:10,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:16:10,273 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:16:10,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:16:10,273 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:16:10,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:16:10,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:16:10,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:16:10,274 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:16:10,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:16:10,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:10,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:16:10,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:16:10,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:16:10,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:16:10,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:16:10,275 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:16:10,275 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-06 06:16:10,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:16:10,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:16:10,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:16:10,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:16:10,865 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:16:10,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/time_var_mutex.i [2022-12-06 06:16:12,662 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:16:13,141 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:16:13,141 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i [2022-12-06 06:16:13,157 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df9af2c4/ce93f8b96ffa4c5faee07e3ee8bfc56d/FLAGe14791481 [2022-12-06 06:16:13,192 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df9af2c4/ce93f8b96ffa4c5faee07e3ee8bfc56d [2022-12-06 06:16:13,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:16:13,208 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:16:13,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:13,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:16:13,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:16:13,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:13" (1/1) ... [2022-12-06 06:16:13,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d6f579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:13, skipping insertion in model container [2022-12-06 06:16:13,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:13" (1/1) ... [2022-12-06 06:16:13,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:16:13,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:16:13,806 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i[30247,30260] [2022-12-06 06:16:13,818 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i[30452,30465] [2022-12-06 06:16:13,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:13,863 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:16:13,929 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i[30247,30260] [2022-12-06 06:16:13,930 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i[30452,30465] [2022-12-06 06:16:13,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:14,009 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:16:14,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14 WrapperNode [2022-12-06 06:16:14,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:14,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:14,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:16:14,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:16:14,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,097 INFO L138 Inliner]: procedures = 169, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-12-06 06:16:14,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:14,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:16:14,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:16:14,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:16:14,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,141 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:16:14,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:16:14,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:16:14,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:16:14,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (1/1) ... [2022-12-06 06:16:14,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:14,229 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-06 06:16:14,300 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-06 06:16:14,320 INFO L130 BoogieDeclarations]: Found specification of procedure allocator [2022-12-06 06:16:14,320 INFO L138 BoogieDeclarations]: Found implementation of procedure allocator [2022-12-06 06:16:14,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:16:14,320 INFO L130 BoogieDeclarations]: Found specification of procedure de_allocator [2022-12-06 06:16:14,321 INFO L138 BoogieDeclarations]: Found implementation of procedure de_allocator [2022-12-06 06:16:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:16:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:16:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:16:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:16:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:16:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:16:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:16:14,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:16:14,323 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:16:14,444 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:16:14,445 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:16:14,662 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:16:14,668 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:16:14,668 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:16:14,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:14 BoogieIcfgContainer [2022-12-06 06:16:14,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:16:14,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:16:14,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:16:14,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:16:14,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:16:13" (1/3) ... [2022-12-06 06:16:14,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6a42c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:14, skipping insertion in model container [2022-12-06 06:16:14,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:14" (2/3) ... [2022-12-06 06:16:14,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6a42c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:14, skipping insertion in model container [2022-12-06 06:16:14,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:14" (3/3) ... [2022-12-06 06:16:14,677 INFO L112 eAbstractionObserver]: Analyzing ICFG time_var_mutex.i [2022-12-06 06:16:14,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:16:14,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:16:14,694 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:16:14,751 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:16:14,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 96 transitions, 208 flow [2022-12-06 06:16:14,823 INFO L130 PetriNetUnfolder]: 5/94 cut-off events. [2022-12-06 06:16:14,824 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:16:14,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 5/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2022-12-06 06:16:14,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 96 transitions, 208 flow [2022-12-06 06:16:14,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 85 transitions, 179 flow [2022-12-06 06:16:14,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:14,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 85 transitions, 179 flow [2022-12-06 06:16:14,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 85 transitions, 179 flow [2022-12-06 06:16:14,887 INFO L130 PetriNetUnfolder]: 5/85 cut-off events. [2022-12-06 06:16:14,888 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:16:14,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 85 events. 5/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 95 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2022-12-06 06:16:14,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 85 transitions, 179 flow [2022-12-06 06:16:14,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 1042 [2022-12-06 06:16:19,372 INFO L203 LiptonReduction]: Total number of compositions: 67 [2022-12-06 06:16:19,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:16:19,390 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;@560e4eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:16:19,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:16:19,397 INFO L130 PetriNetUnfolder]: 1/14 cut-off events. [2022-12-06 06:16:19,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:19,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:19,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:16:19,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash 342936018, now seen corresponding path program 1 times [2022-12-06 06:16:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:19,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300678758] [2022-12-06 06:16:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:19,672 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-06 06:16:19,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:19,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300678758] [2022-12-06 06:16:19,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300678758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:19,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:19,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:19,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828604689] [2022-12-06 06:16:19,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:19,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:19,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:19,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:16:19,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 06:16:19,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:19,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:16:19,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:19,846 INFO L130 PetriNetUnfolder]: 179/344 cut-off events. [2022-12-06 06:16:19,846 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:16:19,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 344 events. 179/344 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1372 event pairs, 77 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 628. Up to 161 conditions per place. [2022-12-06 06:16:19,851 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 06:16:19,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 140 flow [2022-12-06 06:16:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:16:19,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2022-12-06 06:16:19,863 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 69 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:16:19,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 140 flow [2022-12-06 06:16:19,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:16:19,869 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 58 flow [2022-12-06 06:16:19,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2022-12-06 06:16:19,874 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2022-12-06 06:16:19,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:19,875 INFO L89 Accepts]: Start accepts. Operand has 30 places, 25 transitions, 58 flow [2022-12-06 06:16:19,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:19,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:19,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 25 transitions, 58 flow [2022-12-06 06:16:19,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 58 flow [2022-12-06 06:16:19,886 INFO L130 PetriNetUnfolder]: 1/25 cut-off events. [2022-12-06 06:16:19,886 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:19,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 25 events. 1/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2022-12-06 06:16:19,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 25 transitions, 58 flow [2022-12-06 06:16:19,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-06 06:16:19,927 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:19,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 06:16:19,933 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 58 flow [2022-12-06 06:16:19,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 06:16:19,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:19,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:19,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:16:19,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1157444782, now seen corresponding path program 1 times [2022-12-06 06:16:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:19,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273970420] [2022-12-06 06:16:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:20,012 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-06 06:16:20,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:20,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273970420] [2022-12-06 06:16:20,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273970420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:20,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:20,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:20,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950403392] [2022-12-06 06:16:20,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:20,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:20,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:20,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:16:20,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 06:16:20,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:20,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:16:20,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:20,130 INFO L130 PetriNetUnfolder]: 219/416 cut-off events. [2022-12-06 06:16:20,130 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 06:16:20,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 416 events. 219/416 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1658 event pairs, 113 based on Foata normal form. 22/366 useless extension candidates. Maximal degree in co-relation 637. Up to 252 conditions per place. [2022-12-06 06:16:20,135 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 27 selfloop transitions, 5 changer transitions 4/38 dead transitions. [2022-12-06 06:16:20,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 159 flow [2022-12-06 06:16:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:16:20,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 06:16:20,138 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 58 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:16:20,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 159 flow [2022-12-06 06:16:20,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:20,140 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 82 flow [2022-12-06 06:16:20,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-06 06:16:20,141 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2022-12-06 06:16:20,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:20,142 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 82 flow [2022-12-06 06:16:20,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:20,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:20,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 82 flow [2022-12-06 06:16:20,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 26 transitions, 82 flow [2022-12-06 06:16:20,148 INFO L130 PetriNetUnfolder]: 1/43 cut-off events. [2022-12-06 06:16:20,148 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:16:20,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 43 events. 1/43 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 145 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 63. Up to 9 conditions per place. [2022-12-06 06:16:20,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 26 transitions, 82 flow [2022-12-06 06:16:20,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 06:16:20,164 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:20,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:16:20,165 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 82 flow [2022-12-06 06:16:20,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 06:16:20,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:20,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:20,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:16:20,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1465912679, now seen corresponding path program 1 times [2022-12-06 06:16:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:20,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003761280] [2022-12-06 06:16:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:20,235 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-06 06:16:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:20,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003761280] [2022-12-06 06:16:20,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003761280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:20,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:20,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498566729] [2022-12-06 06:16:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:20,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:20,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:16:20,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-06 06:16:20,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:20,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:16:20,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:20,311 INFO L130 PetriNetUnfolder]: 176/342 cut-off events. [2022-12-06 06:16:20,311 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 06:16:20,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 342 events. 176/342 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1301 event pairs, 95 based on Foata normal form. 16/308 useless extension candidates. Maximal degree in co-relation 659. Up to 215 conditions per place. [2022-12-06 06:16:20,313 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 21 selfloop transitions, 4 changer transitions 9/36 dead transitions. [2022-12-06 06:16:20,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 173 flow [2022-12-06 06:16:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 06:16:20,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-06 06:16:20,314 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 82 flow. Second operand 3 states and 41 transitions. [2022-12-06 06:16:20,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 173 flow [2022-12-06 06:16:20,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:20,317 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 78 flow [2022-12-06 06:16:20,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 06:16:20,317 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2022-12-06 06:16:20,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:20,318 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 78 flow [2022-12-06 06:16:20,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:20,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:20,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 78 flow [2022-12-06 06:16:20,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 78 flow [2022-12-06 06:16:20,322 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-06 06:16:20,322 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 06:16:20,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 33 events. 0/33 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 94 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-12-06 06:16:20,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 78 flow [2022-12-06 06:16:20,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 06:16:20,625 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:16:20,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-06 06:16:20,626 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 68 flow [2022-12-06 06:16:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-06 06:16:20,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:20,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:20,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:16:20,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1521047255, now seen corresponding path program 1 times [2022-12-06 06:16:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:20,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795363671] [2022-12-06 06:16:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:20,874 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-06 06:16:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:20,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795363671] [2022-12-06 06:16:20,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795363671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:20,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:20,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:16:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290862378] [2022-12-06 06:16:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:20,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:16:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:20,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:16:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:16:20,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 06:16:20,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-06 06:16:20,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:20,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 06:16:20,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:20,944 INFO L130 PetriNetUnfolder]: 34/87 cut-off events. [2022-12-06 06:16:20,944 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 06:16:20,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 87 events. 34/87 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 289 event pairs, 4 based on Foata normal form. 4/79 useless extension candidates. Maximal degree in co-relation 202. Up to 24 conditions per place. [2022-12-06 06:16:20,945 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 11 selfloop transitions, 5 changer transitions 16/33 dead transitions. [2022-12-06 06:16:20,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 165 flow [2022-12-06 06:16:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:16:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:16:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-06 06:16:20,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2022-12-06 06:16:20,946 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 68 flow. Second operand 6 states and 45 transitions. [2022-12-06 06:16:20,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 165 flow [2022-12-06 06:16:20,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:20,948 INFO L231 Difference]: Finished difference. Result has 29 places, 11 transitions, 47 flow [2022-12-06 06:16:20,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=47, PETRI_PLACES=29, PETRI_TRANSITIONS=11} [2022-12-06 06:16:20,949 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2022-12-06 06:16:20,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:20,949 INFO L89 Accepts]: Start accepts. Operand has 29 places, 11 transitions, 47 flow [2022-12-06 06:16:20,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:20,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:20,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 11 transitions, 47 flow [2022-12-06 06:16:20,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 11 transitions, 47 flow [2022-12-06 06:16:20,952 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 06:16:20,952 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:16:20,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 12 events. 0/12 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 8 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-06 06:16:20,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 11 transitions, 47 flow [2022-12-06 06:16:20,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-06 06:16:21,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] $Ultimate##0-->L702: Formula: (let ((.cse2 (select |v_#pthreadsMutex_519| |v_~#m_inode~0.base_118|))) (let ((.cse0 (store |v_#pthreadsMutex_519| |v_~#m_inode~0.base_118| (store .cse2 |v_~#m_inode~0.offset_118| 1)))) (let ((.cse1 (select .cse0 |v_~#m_busy~0.base_202|))) (and (= |v_allocatorThread1of1ForFork1_#in~_.offset_45| v_allocatorThread1of1ForFork1_~_.offset_45) (= v_~busy~0_125 1) (= |v_allocatorThread1of1ForFork1_#in~_.base_45| v_allocatorThread1of1ForFork1_~_.base_45) (= (store .cse0 |v_~#m_busy~0.base_202| (store .cse1 |v_~#m_busy~0.offset_202| 0)) |v_#pthreadsMutex_518|) (= (select .cse2 |v_~#m_inode~0.offset_118|) 0) (= v_~inode~0_122 1) (= v_~block~0_216 1) (= v_~inode~0_123 0) (= (select .cse1 |v_~#m_busy~0.offset_202|) 0))))) InVars {~inode~0=v_~inode~0_123, #pthreadsMutex=|v_#pthreadsMutex_519|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_202|, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~#m_busy~0.base=|v_~#m_busy~0.base_202|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_118|, ~#m_inode~0.base=|v_~#m_inode~0.base_118|, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_518|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_202|, ~#m_busy~0.base=|v_~#m_busy~0.base_202|, allocatorThread1of1ForFork1_~_.base=v_allocatorThread1of1ForFork1_~_.base_45, ~#m_inode~0.offset=|v_~#m_inode~0.offset_118|, ~#m_inode~0.base=|v_~#m_inode~0.base_118|, ~inode~0=v_~inode~0_122, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~block~0=v_~block~0_216, allocatorThread1of1ForFork1_#t~nondet3=|v_allocatorThread1of1ForFork1_#t~nondet3_89|, ~busy~0=v_~busy~0_125, allocatorThread1of1ForFork1_#t~nondet4=|v_allocatorThread1of1ForFork1_#t~nondet4_71|, allocatorThread1of1ForFork1_~_.offset=v_allocatorThread1of1ForFork1_~_.offset_45, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} AuxVars[] AssignedVars[~inode~0, #pthreadsMutex, ~block~0, allocatorThread1of1ForFork1_#t~nondet3, allocatorThread1of1ForFork1_~_.base, ~busy~0, allocatorThread1of1ForFork1_#t~nondet4, allocatorThread1of1ForFork1_~_.offset] and [341] $Ultimate##0-->L710: Formula: (let ((.cse0 (select |v_#pthreadsMutex_527| |v_~#m_busy~0.base_206|))) (and (= (select .cse0 |v_~#m_busy~0.offset_206|) 0) (= v_~busy~0_129 0) (= |v_de_allocatorThread1of1ForFork0_#in~_.offset_57| v_de_allocatorThread1of1ForFork0_~_.offset_61) (= |v_de_allocatorThread1of1ForFork0_#in~_.base_57| v_de_allocatorThread1of1ForFork0_~_.base_61) (= v_~block~0_220 0) (= (store |v_#pthreadsMutex_527| |v_~#m_busy~0.base_206| (store .cse0 |v_~#m_busy~0.offset_206| 1)) |v_#pthreadsMutex_526|))) InVars {de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_57|, #pthreadsMutex=|v_#pthreadsMutex_527|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_206|, ~busy~0=v_~busy~0_129, ~#m_busy~0.base=|v_~#m_busy~0.base_206|, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_57|} OutVars{de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_57|, #pthreadsMutex=|v_#pthreadsMutex_526|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_206|, ~block~0=v_~block~0_220, ~busy~0=v_~busy~0_129, ~#m_busy~0.base=|v_~#m_busy~0.base_206|, de_allocatorThread1of1ForFork0_~_.base=v_de_allocatorThread1of1ForFork0_~_.base_61, de_allocatorThread1of1ForFork0_#t~nondet5=|v_de_allocatorThread1of1ForFork0_#t~nondet5_121|, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_57|, de_allocatorThread1of1ForFork0_~_.offset=v_de_allocatorThread1of1ForFork0_~_.offset_61} AuxVars[] AssignedVars[#pthreadsMutex, ~block~0, de_allocatorThread1of1ForFork0_~_.base, de_allocatorThread1of1ForFork0_#t~nondet5, de_allocatorThread1of1ForFork0_~_.offset] [2022-12-06 06:16:21,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] $Ultimate##0-->L702: Formula: (let ((.cse2 (select |v_#pthreadsMutex_519| |v_~#m_inode~0.base_118|))) (let ((.cse0 (store |v_#pthreadsMutex_519| |v_~#m_inode~0.base_118| (store .cse2 |v_~#m_inode~0.offset_118| 1)))) (let ((.cse1 (select .cse0 |v_~#m_busy~0.base_202|))) (and (= |v_allocatorThread1of1ForFork1_#in~_.offset_45| v_allocatorThread1of1ForFork1_~_.offset_45) (= v_~busy~0_125 1) (= |v_allocatorThread1of1ForFork1_#in~_.base_45| v_allocatorThread1of1ForFork1_~_.base_45) (= (store .cse0 |v_~#m_busy~0.base_202| (store .cse1 |v_~#m_busy~0.offset_202| 0)) |v_#pthreadsMutex_518|) (= (select .cse2 |v_~#m_inode~0.offset_118|) 0) (= v_~inode~0_122 1) (= v_~block~0_216 1) (= v_~inode~0_123 0) (= (select .cse1 |v_~#m_busy~0.offset_202|) 0))))) InVars {~inode~0=v_~inode~0_123, #pthreadsMutex=|v_#pthreadsMutex_519|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_202|, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~#m_busy~0.base=|v_~#m_busy~0.base_202|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_118|, ~#m_inode~0.base=|v_~#m_inode~0.base_118|, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_518|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_202|, ~#m_busy~0.base=|v_~#m_busy~0.base_202|, allocatorThread1of1ForFork1_~_.base=v_allocatorThread1of1ForFork1_~_.base_45, ~#m_inode~0.offset=|v_~#m_inode~0.offset_118|, ~#m_inode~0.base=|v_~#m_inode~0.base_118|, ~inode~0=v_~inode~0_122, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~block~0=v_~block~0_216, allocatorThread1of1ForFork1_#t~nondet3=|v_allocatorThread1of1ForFork1_#t~nondet3_89|, ~busy~0=v_~busy~0_125, allocatorThread1of1ForFork1_#t~nondet4=|v_allocatorThread1of1ForFork1_#t~nondet4_71|, allocatorThread1of1ForFork1_~_.offset=v_allocatorThread1of1ForFork1_~_.offset_45, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} AuxVars[] AssignedVars[~inode~0, #pthreadsMutex, ~block~0, allocatorThread1of1ForFork1_#t~nondet3, allocatorThread1of1ForFork1_~_.base, ~busy~0, allocatorThread1of1ForFork1_#t~nondet4, allocatorThread1of1ForFork1_~_.offset] and [342] $Ultimate##0-->de_allocatorEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_532| |v_~#m_busy~0.base_208|))) (and (= |v_de_allocatorThread1of1ForFork0_#res.offset_77| 0) (= |v_de_allocatorThread1of1ForFork0_#res.base_77| 0) (= (select .cse0 |v_~#m_busy~0.offset_208|) 0) (= v_~block~0_222 0) (= (store |v_#pthreadsMutex_532| |v_~#m_busy~0.base_208| (store .cse0 |v_~#m_busy~0.offset_208| 0)) |v_#pthreadsMutex_530|) (= |v_de_allocatorThread1of1ForFork0_#in~_.offset_59| v_de_allocatorThread1of1ForFork0_~_.offset_63) (= v_~busy~0_131 0) (= |v_de_allocatorThread1of1ForFork0_#in~_.base_59| v_de_allocatorThread1of1ForFork0_~_.base_63))) InVars {de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_59|, #pthreadsMutex=|v_#pthreadsMutex_532|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_208|, ~#m_busy~0.base=|v_~#m_busy~0.base_208|, ~busy~0=v_~busy~0_131, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_59|} OutVars{de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_59|, #pthreadsMutex=|v_#pthreadsMutex_530|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_208|, ~block~0=v_~block~0_222, ~#m_busy~0.base=|v_~#m_busy~0.base_208|, ~busy~0=v_~busy~0_131, de_allocatorThread1of1ForFork0_~_.base=v_de_allocatorThread1of1ForFork0_~_.base_63, de_allocatorThread1of1ForFork0_#t~nondet5=|v_de_allocatorThread1of1ForFork0_#t~nondet5_123|, de_allocatorThread1of1ForFork0_#res.base=|v_de_allocatorThread1of1ForFork0_#res.base_77|, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_59|, de_allocatorThread1of1ForFork0_#res.offset=|v_de_allocatorThread1of1ForFork0_#res.offset_77|, de_allocatorThread1of1ForFork0_~_.offset=v_de_allocatorThread1of1ForFork0_~_.offset_63} AuxVars[] AssignedVars[#pthreadsMutex, ~block~0, de_allocatorThread1of1ForFork0_~_.base, de_allocatorThread1of1ForFork0_#t~nondet5, de_allocatorThread1of1ForFork0_#res.base, de_allocatorThread1of1ForFork0_#res.offset, de_allocatorThread1of1ForFork0_~_.offset] [2022-12-06 06:16:21,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] $Ultimate##0-->L710: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_536|, allocatorThread1of1ForFork1_~_.base=v_allocatorThread1of1ForFork1_~_.base_49, de_allocatorThread1of1ForFork0_~_.offset=v_de_allocatorThread1of1ForFork0_~_.offset_65, ~inode~0=v_~inode~0_130, ~block~0=v_~block~0_224, allocatorThread1of1ForFork1_#t~nondet3=|v_allocatorThread1of1ForFork1_#t~nondet3_93|, ~busy~0=v_~busy~0_133, allocatorThread1of1ForFork1_#t~nondet4=|v_allocatorThread1of1ForFork1_#t~nondet4_75|, de_allocatorThread1of1ForFork0_~_.base=v_de_allocatorThread1of1ForFork0_~_.base_65, allocatorThread1of1ForFork1_~_.offset=v_allocatorThread1of1ForFork1_~_.offset_49, de_allocatorThread1of1ForFork0_#t~nondet5=|v_de_allocatorThread1of1ForFork0_#t~nondet5_125|} AuxVars[] AssignedVars[~inode~0, #pthreadsMutex, ~block~0, allocatorThread1of1ForFork1_#t~nondet3, allocatorThread1of1ForFork1_~_.base, ~busy~0, allocatorThread1of1ForFork1_#t~nondet4, de_allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork1_~_.offset, de_allocatorThread1of1ForFork0_#t~nondet5, de_allocatorThread1of1ForFork0_~_.offset] and [254] L702-->allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_~block~0_13 1)) InVars {~block~0=v_~block~0_13} OutVars{~block~0=v_~block~0_13} AuxVars[] AssignedVars[] [2022-12-06 06:16:21,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] $Ultimate##0-->de_allocatorEXIT: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_542|, allocatorThread1of1ForFork1_~_.base=v_allocatorThread1of1ForFork1_~_.base_51, de_allocatorThread1of1ForFork0_#res.base=|v_de_allocatorThread1of1ForFork0_#res.base_79|, de_allocatorThread1of1ForFork0_~_.offset=v_de_allocatorThread1of1ForFork0_~_.offset_67, ~inode~0=v_~inode~0_134, ~block~0=v_~block~0_228, allocatorThread1of1ForFork1_#t~nondet3=|v_allocatorThread1of1ForFork1_#t~nondet3_95|, ~busy~0=v_~busy~0_135, allocatorThread1of1ForFork1_#t~nondet4=|v_allocatorThread1of1ForFork1_#t~nondet4_77|, de_allocatorThread1of1ForFork0_~_.base=v_de_allocatorThread1of1ForFork0_~_.base_67, allocatorThread1of1ForFork1_~_.offset=v_allocatorThread1of1ForFork1_~_.offset_51, de_allocatorThread1of1ForFork0_#t~nondet5=|v_de_allocatorThread1of1ForFork0_#t~nondet5_127|, de_allocatorThread1of1ForFork0_#res.offset=|v_de_allocatorThread1of1ForFork0_#res.offset_79|} AuxVars[] AssignedVars[#pthreadsMutex, allocatorThread1of1ForFork1_~_.base, de_allocatorThread1of1ForFork0_#res.base, de_allocatorThread1of1ForFork0_~_.offset, ~inode~0, ~block~0, allocatorThread1of1ForFork1_#t~nondet3, ~busy~0, allocatorThread1of1ForFork1_#t~nondet4, de_allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork1_~_.offset, de_allocatorThread1of1ForFork0_#t~nondet5, de_allocatorThread1of1ForFork0_#res.offset] and [254] L702-->allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_~block~0_13 1)) InVars {~block~0=v_~block~0_13} OutVars{~block~0=v_~block~0_13} AuxVars[] AssignedVars[] [2022-12-06 06:16:21,066 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:16:21,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 06:16:21,067 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 10 transitions, 49 flow [2022-12-06 06:16:21,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-06 06:16:21,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:21,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:16:21,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:16:21,067 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash 342929289, now seen corresponding path program 1 times [2022-12-06 06:16:21,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:21,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334287154] [2022-12-06 06:16:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:21,083 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-06 06:16:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:21,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334287154] [2022-12-06 06:16:21,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334287154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:21,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:21,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122909712] [2022-12-06 06:16:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:21,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:16:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:16:21,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:16:21,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 10 [2022-12-06 06:16:21,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 10 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-06 06:16:21,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:21,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 10 [2022-12-06 06:16:21,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:21,094 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 06:16:21,094 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-06 06:16:21,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 14 events. 3/14 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 16 event pairs, 3 based on Foata normal form. 2/16 useless extension candidates. Maximal degree in co-relation 11. Up to 13 conditions per place. [2022-12-06 06:16:21,095 INFO L137 encePairwiseOnDemand]: 8/10 looper letters, 0 selfloop transitions, 0 changer transitions 7/7 dead transitions. [2022-12-06 06:16:21,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 7 transitions, 37 flow [2022-12-06 06:16:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:16:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:16:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-12-06 06:16:21,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:16:21,096 INFO L175 Difference]: Start difference. First operand has 21 places, 10 transitions, 49 flow. Second operand 2 states and 10 transitions. [2022-12-06 06:16:21,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 7 transitions, 37 flow [2022-12-06 06:16:21,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 7 transitions, 31 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:16:21,096 INFO L231 Difference]: Finished difference. Result has 14 places, 0 transitions, 0 flow [2022-12-06 06:16:21,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=14, PETRI_TRANSITIONS=0} [2022-12-06 06:16:21,097 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -19 predicate places. [2022-12-06 06:16:21,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:21,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 14 places, 0 transitions, 0 flow [2022-12-06 06:16:21,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 06:16:21,098 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 06:16:21,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:21,098 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-06 06:16:21,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 06:16:21,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:16:21,098 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:21,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 06:16:21,099 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 06:16:21,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-06 06:16:21,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:16:21,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:16:21,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:16:21,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:16:21,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-06 06:16:21,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:16:21,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:16:21,115 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-06 06:16:21,119 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:16:21,119 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:16:21,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:16:21 BasicIcfg [2022-12-06 06:16:21,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:16:21,121 INFO L158 Benchmark]: Toolchain (without parser) took 7913.32ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 166.8MB in the beginning and 204.4MB in the end (delta: -37.6MB). Peak memory consumption was 131.7MB. Max. memory is 8.0GB. [2022-12-06 06:16:21,122 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory was 167.7MB in the beginning and 167.6MB in the end (delta: 83.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:16:21,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 799.56ms. Allocated memory is still 191.9MB. Free memory was 166.3MB in the beginning and 146.3MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 06:16:21,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.83ms. Allocated memory is still 191.9MB. Free memory was 146.3MB in the beginning and 144.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:21,122 INFO L158 Benchmark]: Boogie Preprocessor took 64.35ms. Allocated memory is still 191.9MB. Free memory was 144.3MB in the beginning and 142.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:16:21,123 INFO L158 Benchmark]: RCFGBuilder took 507.48ms. Allocated memory is still 191.9MB. Free memory was 142.7MB in the beginning and 128.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 06:16:21,123 INFO L158 Benchmark]: TraceAbstraction took 6448.62ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 127.5MB in the beginning and 204.4MB in the end (delta: -76.9MB). Peak memory consumption was 91.9MB. Max. memory is 8.0GB. [2022-12-06 06:16:21,124 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 191.9MB. Free memory was 167.7MB in the beginning and 167.6MB in the end (delta: 83.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 799.56ms. Allocated memory is still 191.9MB. Free memory was 166.3MB in the beginning and 146.3MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.83ms. Allocated memory is still 191.9MB. Free memory was 146.3MB in the beginning and 144.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.35ms. Allocated memory is still 191.9MB. Free memory was 144.3MB in the beginning and 142.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 507.48ms. Allocated memory is still 191.9MB. Free memory was 142.7MB in the beginning and 128.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6448.62ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 127.5MB in the beginning and 204.4MB in the end (delta: -76.9MB). Peak memory consumption was 91.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 87 PlacesBefore, 33 PlacesAfterwards, 85 TransitionsBefore, 30 TransitionsAfterwards, 1042 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 22 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1105, independent: 1033, independent conditional: 1033, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1105, independent: 1033, independent conditional: 0, independent unconditional: 1033, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1105, independent: 1033, independent conditional: 0, independent unconditional: 1033, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1105, independent: 1033, independent conditional: 0, independent unconditional: 1033, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 725, independent: 700, independent conditional: 0, independent unconditional: 700, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 725, independent: 652, independent conditional: 0, independent unconditional: 652, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1105, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 725, unknown conditional: 0, unknown unconditional: 725] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1180, Positive conditional cache size: 0, Positive unconditional cache size: 1180, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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, 30 PlacesBefore, 30 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 149, independent: 125, independent conditional: 23, independent unconditional: 102, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 126, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 126, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 126, unknown conditional: 0, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 166, independent: 129, independent conditional: 6, independent unconditional: 123, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 32 PlacesBefore, 27 PlacesAfterwards, 23 TransitionsBefore, 18 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 61, independent conditional: 3, independent unconditional: 58, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 11 TransitionsBefore, 10 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 10, independent unconditional: 2, 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: 12, independent: 12, independent conditional: 10, independent unconditional: 2, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 189, Positive conditional cache size: 4, Positive unconditional cache size: 185, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - 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): 209, Positive cache size: 189, Positive conditional cache size: 4, Positive unconditional cache size: 185, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 702]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 710]: 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 5 procedures, 125 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 6 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 06:16:21,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...