/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/goblint-regression/13-privatized_30-traces-oplus-vs-meet_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:27:53,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:27:53,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:27:53,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:27:53,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:27:53,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:27:53,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:27:53,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:27:53,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:27:53,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:27:53,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:27:53,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:27:53,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:27:53,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:27:53,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:27:53,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:27:53,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:27:53,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:27:53,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:27:53,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:27:53,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:27:53,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:27:53,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:27:53,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:27:53,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:27:53,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:27:53,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:27:53,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:27:53,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:27:53,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:27:53,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:27:53,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:27:53,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:27:53,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:27:53,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:27:53,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:27:53,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:27:53,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:27:53,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:27:53,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:27:53,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:27:53,383 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-13 12:27:53,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:27:53,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:27:53,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:27:53,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:27:53,409 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:27:53,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:27:53,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:27:53,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:27:53,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:27:53,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:27:53,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:27:53,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:27:53,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:27:53,411 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:27:53,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:27:53,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:27:53,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:27:53,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:27:53,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:27:53,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:27:53,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:27:53,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:27:53,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:27:53,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:27:53,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:27:53,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:27:53,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:27:53,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:27:53,412 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-13 12:27:53,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:27:53,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:27:53,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:27:53,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:27:53,667 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:27:53,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_30-traces-oplus-vs-meet_true.i [2022-12-13 12:27:54,549 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:27:54,758 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:27:54,758 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_30-traces-oplus-vs-meet_true.i [2022-12-13 12:27:54,766 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f71b149b/ed72f8d2b6f7434a8f62b38a8138f84c/FLAG458916083 [2022-12-13 12:27:54,776 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f71b149b/ed72f8d2b6f7434a8f62b38a8138f84c [2022-12-13 12:27:54,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:27:54,778 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:27:54,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:27:54,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:27:54,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:27:54,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:27:54" (1/1) ... [2022-12-13 12:27:54,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7c523a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:54, skipping insertion in model container [2022-12-13 12:27:54,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:27:54" (1/1) ... [2022-12-13 12:27:54,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:27:54,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:27:54,907 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_30-traces-oplus-vs-meet_true.i[1097,1110] [2022-12-13 12:27:54,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:27:54,994 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:27:55,001 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_30-traces-oplus-vs-meet_true.i[1097,1110] [2022-12-13 12:27:55,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:27:55,043 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:27:55,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55 WrapperNode [2022-12-13 12:27:55,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:27:55,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:27:55,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:27:55,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:27:55,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,073 INFO L138 Inliner]: procedures = 162, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2022-12-13 12:27:55,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:27:55,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:27:55,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:27:55,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:27:55,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,091 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:27:55,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:27:55,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:27:55,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:27:55,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (1/1) ... [2022-12-13 12:27:55,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:27:55,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:27:55,123 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-13 12:27:55,137 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-13 12:27:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:27:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:27:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 12:27:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:27:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:27:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 12:27:55,167 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 12:27:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:27:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:27:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:27:55,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:27:55,169 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:27:55,255 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:27:55,256 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:27:55,381 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:27:55,386 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:27:55,386 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:27:55,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:27:55 BoogieIcfgContainer [2022-12-13 12:27:55,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:27:55,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:27:55,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:27:55,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:27:55,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:27:54" (1/3) ... [2022-12-13 12:27:55,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4514e5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:27:55, skipping insertion in model container [2022-12-13 12:27:55,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:55" (2/3) ... [2022-12-13 12:27:55,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4514e5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:27:55, skipping insertion in model container [2022-12-13 12:27:55,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:27:55" (3/3) ... [2022-12-13 12:27:55,403 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_30-traces-oplus-vs-meet_true.i [2022-12-13 12:27:55,415 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:27:55,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:27:55,417 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:27:55,465 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 12:27:55,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 76 transitions, 160 flow [2022-12-13 12:27:55,533 INFO L130 PetriNetUnfolder]: 2/75 cut-off events. [2022-12-13 12:27:55,534 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 12:27:55,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 75 events. 2/75 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2022-12-13 12:27:55,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 76 transitions, 160 flow [2022-12-13 12:27:55,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 62 transitions, 127 flow [2022-12-13 12:27:55,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:55,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 62 transitions, 127 flow [2022-12-13 12:27:55,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 62 transitions, 127 flow [2022-12-13 12:27:55,568 INFO L130 PetriNetUnfolder]: 1/62 cut-off events. [2022-12-13 12:27:55,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:55,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 1/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2022-12-13 12:27:55,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 62 transitions, 127 flow [2022-12-13 12:27:55,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-13 12:27:58,223 INFO L241 LiptonReduction]: Total number of compositions: 53 [2022-12-13 12:27:58,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:27:58,239 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;@157d3e6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:27:58,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 12:27:58,240 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:27:58,240 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:58,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:58,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:27:58,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:27:58,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 269, now seen corresponding path program 1 times [2022-12-13 12:27:58,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:58,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142607910] [2022-12-13 12:27:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:58,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:58,327 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-13 12:27:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:58,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142607910] [2022-12-13 12:27:58,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142607910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:58,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:58,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:27:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850137694] [2022-12-13 12:27:58,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:58,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:27:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:27:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:27:58,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2022-12-13 12:27:58,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 43 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-13 12:27:58,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:58,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2022-12-13 12:27:58,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:58,388 INFO L130 PetriNetUnfolder]: 22/70 cut-off events. [2022-12-13 12:27:58,389 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:58,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 70 events. 22/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 287 event pairs, 22 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 125. Up to 60 conditions per place. [2022-12-13 12:27:58,390 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 15 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-13 12:27:58,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 19 transitions, 71 flow [2022-12-13 12:27:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:27:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:27:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2022-12-13 12:27:58,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 12:27:58,399 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 43 flow. Second operand 2 states and 24 transitions. [2022-12-13 12:27:58,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 19 transitions, 71 flow [2022-12-13 12:27:58,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:27:58,402 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 40 flow [2022-12-13 12:27:58,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 12:27:58,409 INFO L295 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2022-12-13 12:27:58,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:58,410 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 40 flow [2022-12-13 12:27:58,411 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:58,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:58,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 40 flow [2022-12-13 12:27:58,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 40 flow [2022-12-13 12:27:58,419 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 12:27:58,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:58,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 48 event pairs, 0 based on Foata normal form. 0/8 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 12:27:58,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 40 flow [2022-12-13 12:27:58,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-13 12:27:58,461 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:27:58,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 12:27:58,465 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 40 flow [2022-12-13 12:27:58,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-13 12:27:58,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:58,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:27:58,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:27:58,466 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:27:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash 260372518, now seen corresponding path program 1 times [2022-12-13 12:27:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:58,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618064489] [2022-12-13 12:27:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:58,616 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-13 12:27:58,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618064489] [2022-12-13 12:27:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618064489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:58,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:58,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:27:58,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940294834] [2022-12-13 12:27:58,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:58,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:27:58,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:58,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:27:58,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:27:58,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2022-12-13 12:27:58,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 40 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-13 12:27:58,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:58,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2022-12-13 12:27:58,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:58,641 INFO L130 PetriNetUnfolder]: 13/57 cut-off events. [2022-12-13 12:27:58,641 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:58,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 57 events. 13/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 219 event pairs, 10 based on Foata normal form. 9/46 useless extension candidates. Maximal degree in co-relation 98. Up to 31 conditions per place. [2022-12-13 12:27:58,641 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 8 selfloop transitions, 4 changer transitions 5/20 dead transitions. [2022-12-13 12:27:58,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 74 flow [2022-12-13 12:27:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:27:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:27:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-13 12:27:58,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2022-12-13 12:27:58,642 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 40 flow. Second operand 3 states and 29 transitions. [2022-12-13 12:27:58,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 74 flow [2022-12-13 12:27:58,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 74 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:27:58,644 INFO L231 Difference]: Finished difference. Result has 25 places, 14 transitions, 44 flow [2022-12-13 12:27:58,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=14} [2022-12-13 12:27:58,644 INFO L295 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2022-12-13 12:27:58,644 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:58,644 INFO L89 Accepts]: Start accepts. Operand has 25 places, 14 transitions, 44 flow [2022-12-13 12:27:58,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:58,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:58,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 14 transitions, 44 flow [2022-12-13 12:27:58,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 14 transitions, 44 flow [2022-12-13 12:27:58,647 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 12:27:58,647 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 12:27:58,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 38 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-13 12:27:58,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 14 transitions, 44 flow [2022-12-13 12:27:58,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 12:27:58,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [223] L688-->L691: Formula: (and (= v_~g~0_39 0) (= |v_#pthreadsMutex_187| (store |v_#pthreadsMutex_188| |v_~#B~0.base_83| (store (select |v_#pthreadsMutex_188| |v_~#B~0.base_83|) |v_~#B~0.offset_83| 1)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_188|, ~#B~0.base=|v_~#B~0.base_83|, ~#B~0.offset=|v_~#B~0.offset_83|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_187|, ~#B~0.base=|v_~#B~0.base_83|, ~g~0=v_~g~0_39, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_25|, ~#B~0.offset=|v_~#B~0.offset_83|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [244] $Ultimate##0-->L688: Formula: (let ((.cse1 (select |v_#pthreadsMutex_248| |v_~#A~0.base_93|))) (let ((.cse2 (store |v_#pthreadsMutex_248| |v_~#A~0.base_93| (store .cse1 |v_~#A~0.offset_93| 1)))) (let ((.cse0 (select .cse2 |v_~#B~0.base_119|))) (and (= 0 (select .cse0 |v_~#B~0.offset_119|)) (= v_~g~0_67 5) (= v_t_funThread1of1ForFork0_~arg.base_13 |v_t_funThread1of1ForFork0_#in~arg.base_13|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_13| v_t_funThread1of1ForFork0_~arg.offset_13) (= (select .cse1 |v_~#A~0.offset_93|) 0) (= (store .cse2 |v_~#B~0.base_119| (store .cse0 |v_~#B~0.offset_119| 1)) |v_#pthreadsMutex_247|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_248|, ~#B~0.base=|v_~#B~0.base_119|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_13|, ~#A~0.offset=|v_~#A~0.offset_93|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_13|, ~#A~0.base=|v_~#A~0.base_93|, ~#B~0.offset=|v_~#B~0.offset_119|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_247|, ~#B~0.base=|v_~#B~0.base_119|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_13|, ~#A~0.offset=|v_~#A~0.offset_93|, ~g~0=v_~g~0_67, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_13, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_43|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_43|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_13|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_13, ~#A~0.base=|v_~#A~0.base_93|, ~#B~0.offset=|v_~#B~0.offset_119|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-13 12:27:58,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [239] L688-->L692: Formula: (and (= (store |v_#pthreadsMutex_227| |v_~#B~0.base_113| (store (select |v_#pthreadsMutex_227| |v_~#B~0.base_113|) |v_~#B~0.offset_113| 0)) |v_#pthreadsMutex_225|) (= v_~g~0_65 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_227|, ~#B~0.base=|v_~#B~0.base_113|, ~#B~0.offset=|v_~#B~0.offset_113|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_225|, ~#B~0.base=|v_~#B~0.base_113|, ~g~0=v_~g~0_65, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_33|, ~#B~0.offset=|v_~#B~0.offset_113|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [244] $Ultimate##0-->L688: Formula: (let ((.cse1 (select |v_#pthreadsMutex_248| |v_~#A~0.base_93|))) (let ((.cse2 (store |v_#pthreadsMutex_248| |v_~#A~0.base_93| (store .cse1 |v_~#A~0.offset_93| 1)))) (let ((.cse0 (select .cse2 |v_~#B~0.base_119|))) (and (= 0 (select .cse0 |v_~#B~0.offset_119|)) (= v_~g~0_67 5) (= v_t_funThread1of1ForFork0_~arg.base_13 |v_t_funThread1of1ForFork0_#in~arg.base_13|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_13| v_t_funThread1of1ForFork0_~arg.offset_13) (= (select .cse1 |v_~#A~0.offset_93|) 0) (= (store .cse2 |v_~#B~0.base_119| (store .cse0 |v_~#B~0.offset_119| 1)) |v_#pthreadsMutex_247|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_248|, ~#B~0.base=|v_~#B~0.base_119|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_13|, ~#A~0.offset=|v_~#A~0.offset_93|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_13|, ~#A~0.base=|v_~#A~0.base_93|, ~#B~0.offset=|v_~#B~0.offset_119|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_247|, ~#B~0.base=|v_~#B~0.base_119|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_13|, ~#A~0.offset=|v_~#A~0.offset_93|, ~g~0=v_~g~0_67, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_13, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_43|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_43|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_13|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_13, ~#A~0.base=|v_~#A~0.base_93|, ~#B~0.offset=|v_~#B~0.offset_119|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-13 12:27:58,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [247] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_493| |v_~#B~0.base_197| (store (select |v_#pthreadsMutex_493| |v_~#B~0.base_197|) |v_~#B~0.offset_197| 0)))) (let ((.cse1 (select .cse3 |v_~#A~0.base_151|))) (let ((.cse2 (store .cse3 |v_~#A~0.base_151| (store .cse1 |v_~#A~0.offset_151| 1)))) (let ((.cse0 (select .cse2 |v_~#B~0.base_197|))) (and (= (select .cse0 |v_~#B~0.offset_197|) 0) (= 5 v_~g~0_111) (= (select .cse1 |v_~#A~0.offset_151|) 0) (= v_t_funThread1of1ForFork0_~arg.base_53 |v_t_funThread1of1ForFork0_#in~arg.base_53|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_53| v_t_funThread1of1ForFork0_~arg.offset_53) (= (store .cse2 |v_~#B~0.base_197| (store .cse0 |v_~#B~0.offset_197| 1)) |v_#pthreadsMutex_491|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_493|, ~#B~0.base=|v_~#B~0.base_197|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_53|, ~#A~0.offset=|v_~#A~0.offset_151|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_53|, ~#A~0.base=|v_~#A~0.base_151|, ~#B~0.offset=|v_~#B~0.offset_197|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_491|, ~#B~0.base=|v_~#B~0.base_197|, ~g~0=v_~g~0_111, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_53|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_53, ~#B~0.offset=|v_~#B~0.offset_197|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_53|, ~#A~0.offset=|v_~#A~0.offset_151|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_53, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_83|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_71|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_65|, ~#A~0.base=|v_~#A~0.base_151|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [173] L692-->L693: Formula: (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#A~0.base_10| (store (select |v_#pthreadsMutex_20| |v_~#A~0.base_10|) |v_~#A~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 12:27:58,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [247] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_493| |v_~#B~0.base_197| (store (select |v_#pthreadsMutex_493| |v_~#B~0.base_197|) |v_~#B~0.offset_197| 0)))) (let ((.cse1 (select .cse3 |v_~#A~0.base_151|))) (let ((.cse2 (store .cse3 |v_~#A~0.base_151| (store .cse1 |v_~#A~0.offset_151| 1)))) (let ((.cse0 (select .cse2 |v_~#B~0.base_197|))) (and (= (select .cse0 |v_~#B~0.offset_197|) 0) (= 5 v_~g~0_111) (= (select .cse1 |v_~#A~0.offset_151|) 0) (= v_t_funThread1of1ForFork0_~arg.base_53 |v_t_funThread1of1ForFork0_#in~arg.base_53|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_53| v_t_funThread1of1ForFork0_~arg.offset_53) (= (store .cse2 |v_~#B~0.base_197| (store .cse0 |v_~#B~0.offset_197| 1)) |v_#pthreadsMutex_491|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_493|, ~#B~0.base=|v_~#B~0.base_197|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_53|, ~#A~0.offset=|v_~#A~0.offset_151|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_53|, ~#A~0.base=|v_~#A~0.base_151|, ~#B~0.offset=|v_~#B~0.offset_197|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_491|, ~#B~0.base=|v_~#B~0.base_197|, ~g~0=v_~g~0_111, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_53|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_53, ~#B~0.offset=|v_~#B~0.offset_197|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_53|, ~#A~0.offset=|v_~#A~0.offset_151|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_53, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_83|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_71|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_65|, ~#A~0.base=|v_~#A~0.base_151|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [230] L692-->t_funFINAL: Formula: (and (= (store |v_#pthreadsMutex_198| |v_~#A~0.base_67| (store (select |v_#pthreadsMutex_198| |v_~#A~0.base_67|) |v_~#A~0.offset_67| 0)) |v_#pthreadsMutex_197|) (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#A~0.offset=|v_~#A~0.offset_67|, ~#A~0.base=|v_~#A~0.base_67|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ~#A~0.offset=|v_~#A~0.offset_67|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#A~0.base=|v_~#A~0.base_67|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 12:27:58,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [247] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_493| |v_~#B~0.base_197| (store (select |v_#pthreadsMutex_493| |v_~#B~0.base_197|) |v_~#B~0.offset_197| 0)))) (let ((.cse1 (select .cse3 |v_~#A~0.base_151|))) (let ((.cse2 (store .cse3 |v_~#A~0.base_151| (store .cse1 |v_~#A~0.offset_151| 1)))) (let ((.cse0 (select .cse2 |v_~#B~0.base_197|))) (and (= (select .cse0 |v_~#B~0.offset_197|) 0) (= 5 v_~g~0_111) (= (select .cse1 |v_~#A~0.offset_151|) 0) (= v_t_funThread1of1ForFork0_~arg.base_53 |v_t_funThread1of1ForFork0_#in~arg.base_53|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_53| v_t_funThread1of1ForFork0_~arg.offset_53) (= (store .cse2 |v_~#B~0.base_197| (store .cse0 |v_~#B~0.offset_197| 1)) |v_#pthreadsMutex_491|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_493|, ~#B~0.base=|v_~#B~0.base_197|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_53|, ~#A~0.offset=|v_~#A~0.offset_151|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_53|, ~#A~0.base=|v_~#A~0.base_151|, ~#B~0.offset=|v_~#B~0.offset_197|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_491|, ~#B~0.base=|v_~#B~0.base_197|, ~g~0=v_~g~0_111, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_53|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_53, ~#B~0.offset=|v_~#B~0.offset_197|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_53|, ~#A~0.offset=|v_~#A~0.offset_151|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_53, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_83|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_71|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_65|, ~#A~0.base=|v_~#A~0.base_151|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [231] L692-->t_funEXIT: Formula: (and (= (store |v_#pthreadsMutex_202| |v_~#A~0.base_69| (store (select |v_#pthreadsMutex_202| |v_~#A~0.base_69|) |v_~#A~0.offset_69| 0)) |v_#pthreadsMutex_201|) (= |v_t_funThread1of1ForFork0_#res.offset_9| 0) (= |v_t_funThread1of1ForFork0_#res.base_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_202|, ~#A~0.offset=|v_~#A~0.offset_69|, ~#A~0.base=|v_~#A~0.base_69|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_201|, ~#A~0.offset=|v_~#A~0.offset_69|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_9|, ~#A~0.base=|v_~#A~0.base_69|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 12:27:58,887 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:27:58,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 12:27:58,888 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 13 transitions, 60 flow [2022-12-13 12:27:58,888 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-13 12:27:58,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:58,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:27:58,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:27:58,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:27:58,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash -518300370, now seen corresponding path program 1 times [2022-12-13 12:27:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:58,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358413163] [2022-12-13 12:27:58,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:58,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:59,113 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-13 12:27:59,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:59,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358413163] [2022-12-13 12:27:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358413163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:59,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:59,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:27:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325245266] [2022-12-13 12:27:59,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:59,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:27:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:27:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:27:59,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:27:59,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 13 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-13 12:27:59,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:59,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:27:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:59,141 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 12:27:59,141 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:27:59,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 11 events. 0/11 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 13 event pairs, 0 based on Foata normal form. 5/14 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-13 12:27:59,142 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 3 selfloop transitions, 4 changer transitions 2/9 dead transitions. [2022-12-13 12:27:59,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 9 transitions, 46 flow [2022-12-13 12:27:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:27:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:27:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-12-13 12:27:59,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21153846153846154 [2022-12-13 12:27:59,144 INFO L175 Difference]: Start difference. First operand has 19 places, 13 transitions, 60 flow. Second operand 4 states and 11 transitions. [2022-12-13 12:27:59,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 9 transitions, 46 flow [2022-12-13 12:27:59,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 9 transitions, 42 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:27:59,145 INFO L231 Difference]: Finished difference. Result has 16 places, 7 transitions, 28 flow [2022-12-13 12:27:59,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=28, PETRI_PLACES=16, PETRI_TRANSITIONS=7} [2022-12-13 12:27:59,146 INFO L295 CegarLoopForPetriNet]: 24 programPoint places, -8 predicate places. [2022-12-13 12:27:59,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:59,146 INFO L89 Accepts]: Start accepts. Operand has 16 places, 7 transitions, 28 flow [2022-12-13 12:27:59,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:59,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:59,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 7 transitions, 28 flow [2022-12-13 12:27:59,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 7 transitions, 28 flow [2022-12-13 12:27:59,157 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 12:27:59,157 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:59,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 9 events. 0/9 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:27:59,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 14 places, 7 transitions, 28 flow [2022-12-13 12:27:59,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:27:59,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L698-3-->L700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#B~0.base_59|))) (and (= (store |v_#pthreadsMutex_116| |v_~#B~0.base_59| (store .cse0 |v_~#B~0.offset_59| 1)) |v_#pthreadsMutex_115|) (= (select .cse0 |v_~#B~0.offset_59|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#B~0.base=|v_~#B~0.base_59|, ~#B~0.offset=|v_~#B~0.offset_59|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#B~0.base=|v_~#B~0.base_59|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_16|, ~#B~0.offset=|v_~#B~0.offset_59|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre4#1] and [168] L688-->L689: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#B~0.base_10| (store (select |v_#pthreadsMutex_14| |v_~#B~0.base_10|) |v_~#B~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#B~0.base=|v_~#B~0.base_10|, ~#B~0.offset=|v_~#B~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#B~0.base=|v_~#B~0.base_10|, ~#B~0.offset=|v_~#B~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 12:27:59,213 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 12:27:59,249 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L698-3-->L689: Formula: (let ((.cse0 (select |v_#pthreadsMutex_565| |v_~#B~0.base_221|))) (and (= (select .cse0 |v_~#B~0.offset_221|) 0) (= |v_#pthreadsMutex_563| (store |v_#pthreadsMutex_565| |v_~#B~0.base_221| (store .cse0 |v_~#B~0.offset_221| 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_565|, ~#B~0.base=|v_~#B~0.base_221|, ~#B~0.offset=|v_~#B~0.offset_221|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_563|, ~#B~0.base=|v_~#B~0.base_221|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_89|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_98|, ~#B~0.offset=|v_~#B~0.offset_221|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_107|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre4#1] and [253] L700-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_570| |v_~#A~0.base_175|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_49| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_53|) (= |v_#pthreadsMutex_569| (store |v_#pthreadsMutex_570| |v_~#A~0.base_175| (store .cse0 |v_~#A~0.offset_175| 1))) (= (ite (= v_~g~0_137 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_49|) (= (select .cse0 |v_~#A~0.offset_175|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_53| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_570|, ~#A~0.offset=|v_~#A~0.offset_175|, ~g~0=v_~g~0_137, ~#A~0.base=|v_~#A~0.base_175|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_569|, ~#A~0.offset=|v_~#A~0.offset_175|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_49|, ~g~0=v_~g~0_137, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_112|, ~#A~0.base=|v_~#A~0.base_175|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_53|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 12:27:59,283 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:27:59,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 12:27:59,284 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 5 transitions, 28 flow [2022-12-13 12:27:59,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-13 12:27:59,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:59,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:27:59,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:27:59,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:27:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash -517388453, now seen corresponding path program 1 times [2022-12-13 12:27:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:59,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243475508] [2022-12-13 12:27:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:59,365 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-13 12:27:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:59,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243475508] [2022-12-13 12:27:59,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243475508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:59,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:59,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:27:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300067022] [2022-12-13 12:27:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:59,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:27:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:59,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:27:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:27:59,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 5 [2022-12-13 12:27:59,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 5 transitions, 28 flow. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-13 12:27:59,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:59,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 5 [2022-12-13 12:27:59,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:59,373 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 12:27:59,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:59,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15 conditions, 3 events. 0/3 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/3 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 12:27:59,374 INFO L137 encePairwiseOnDemand]: 3/5 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-13 12:27:59,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 3 transitions, 20 flow [2022-12-13 12:27:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:27:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:27:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 3 states and 3 transitions. [2022-12-13 12:27:59,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-13 12:27:59,374 INFO L175 Difference]: Start difference. First operand has 12 places, 5 transitions, 28 flow. Second operand 3 states and 3 transitions. [2022-12-13 12:27:59,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 3 transitions, 20 flow [2022-12-13 12:27:59,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 9 places, 3 transitions, 14 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 12:27:59,375 INFO L231 Difference]: Finished difference. Result has 9 places, 0 transitions, 0 flow [2022-12-13 12:27:59,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=5, PETRI_DIFFERENCE_MINUEND_FLOW=8, PETRI_DIFFERENCE_MINUEND_PLACES=6, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=9, PETRI_TRANSITIONS=0} [2022-12-13 12:27:59,375 INFO L295 CegarLoopForPetriNet]: 24 programPoint places, -15 predicate places. [2022-12-13 12:27:59,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:59,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 9 places, 0 transitions, 0 flow [2022-12-13 12:27:59,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:27:59,376 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:27:59,376 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:59,376 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-13 12:27:59,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:27:59,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:27:59,376 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:27:59,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 12:27:59,377 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:27:59,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-13 12:27:59,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 12:27:59,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-12-13 12:27:59,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 12:27:59,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:27:59,379 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-12-13 12:27:59,381 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:27:59,382 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:27:59,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:27:59 BasicIcfg [2022-12-13 12:27:59,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:27:59,384 INFO L158 Benchmark]: Toolchain (without parser) took 4605.94ms. Allocated memory was 198.2MB in the beginning and 243.3MB in the end (delta: 45.1MB). Free memory was 173.8MB in the beginning and 146.6MB in the end (delta: 27.2MB). Peak memory consumption was 73.8MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,384 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:27:59,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.02ms. Allocated memory is still 198.2MB. Free memory was 173.7MB in the beginning and 154.4MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.25ms. Allocated memory is still 198.2MB. Free memory was 154.4MB in the beginning and 152.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,385 INFO L158 Benchmark]: Boogie Preprocessor took 18.60ms. Allocated memory is still 198.2MB. Free memory was 152.5MB in the beginning and 151.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,385 INFO L158 Benchmark]: RCFGBuilder took 298.30ms. Allocated memory is still 198.2MB. Free memory was 150.8MB in the beginning and 138.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,385 INFO L158 Benchmark]: TraceAbstraction took 3990.57ms. Allocated memory was 198.2MB in the beginning and 243.3MB in the end (delta: 45.1MB). Free memory was 137.0MB in the beginning and 146.6MB in the end (delta: -9.6MB). Peak memory consumption was 37.1MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,386 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.10ms. Allocated memory is still 198.2MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.02ms. Allocated memory is still 198.2MB. Free memory was 173.7MB in the beginning and 154.4MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.25ms. Allocated memory is still 198.2MB. Free memory was 154.4MB in the beginning and 152.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.60ms. Allocated memory is still 198.2MB. Free memory was 152.5MB in the beginning and 151.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 298.30ms. Allocated memory is still 198.2MB. Free memory was 150.8MB in the beginning and 138.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3990.57ms. Allocated memory was 198.2MB in the beginning and 243.3MB in the end (delta: 45.1MB). Free memory was 137.0MB in the beginning and 146.6MB in the end (delta: -9.6MB). Peak memory consumption was 37.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 65 PlacesBefore, 24 PlacesAfterwards, 62 TransitionsBefore, 20 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 19 ConcurrentYvCompositions, 1 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 291, independent: 257, independent conditional: 257, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 291, independent: 257, independent conditional: 0, independent unconditional: 257, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 291, independent: 257, independent conditional: 0, independent unconditional: 257, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 291, independent: 257, independent conditional: 0, independent unconditional: 257, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 195, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 195, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 291, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 195, unknown conditional: 0, unknown unconditional: 195] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 423, Positive conditional cache size: 0, Positive unconditional cache size: 423, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 42, unknown conditional: 0, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 20 PlacesBefore, 19 PlacesAfterwards, 14 TransitionsBefore, 13 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 21, independent conditional: 7, independent unconditional: 14, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 14 PlacesBefore, 12 PlacesAfterwards, 7 TransitionsBefore, 5 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 57, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 91 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 12:27:59,403 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...