/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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:29:11,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:29:11,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:29:11,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:29:11,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:29:11,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:29:11,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:29:11,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:29:11,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:29:11,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:29:11,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:29:11,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:29:11,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:29:11,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:29:11,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:29:11,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:29:11,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:29:11,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:29:11,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:29:11,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:29:11,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:29:11,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:29:11,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:29:11,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:29:11,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:29:11,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:29:11,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:29:11,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:29:11,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:29:11,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:29:11,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:29:11,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:29:11,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:29:11,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:29:11,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:29:11,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:29:11,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:29:11,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:29:11,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:29:11,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:29:11,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:29:11,097 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:29:11,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:29:11,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:29:11,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:29:11,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:29:11,127 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:29:11,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:29:11,128 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:29:11,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:29:11,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:29:11,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:29:11,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:29:11,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:29:11,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:29:11,129 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:29:11,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:29:11,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:29:11,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:29:11,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:29:11,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:29:11,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:29:11,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:29:11,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:29:11,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:29:11,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:29:11,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:29:11,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:29:11,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:29:11,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:29:11,131 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:29:11,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:29:11,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:29:11,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:29:11,434 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:29:11,435 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:29:11,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-12-13 12:29:12,368 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:29:12,602 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:29:12,602 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-12-13 12:29:12,624 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1ba01db/65c1315f69e64be3b22c3f897e360cc9/FLAG30d1b3fd2 [2022-12-13 12:29:12,637 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1ba01db/65c1315f69e64be3b22c3f897e360cc9 [2022-12-13 12:29:12,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:29:12,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:29:12,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:29:12,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:29:12,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:29:12,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:29:12" (1/1) ... [2022-12-13 12:29:12,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb3ed44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:12, skipping insertion in model container [2022-12-13 12:29:12,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:29:12" (1/1) ... [2022-12-13 12:29:12,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:29:12,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:29:12,827 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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2022-12-13 12:29:12,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:29:12,976 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:29:12,984 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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2022-12-13 12:29:13,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:29:13,046 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:29:13,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13 WrapperNode [2022-12-13 12:29:13,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:29:13,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:29:13,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:29:13,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:29:13,054 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:29:13" (1/1) ... [2022-12-13 12:29:13,066 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:29:13" (1/1) ... [2022-12-13 12:29:13,082 INFO L138 Inliner]: procedures = 165, calls = 42, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 139 [2022-12-13 12:29:13,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:29:13,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:29:13,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:29:13,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:29:13,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,120 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:29:13,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:29:13,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:29:13,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:29:13,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (1/1) ... [2022-12-13 12:29:13,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:29:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:29:13,146 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:29:13,171 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:29:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:29:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 12:29:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:29:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:29:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 12:29:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 12:29:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:29:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:29:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:29:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:29:13,199 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:29:13,288 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:29:13,289 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:29:13,497 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:29:13,503 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:29:13,503 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:29:13,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:29:13 BoogieIcfgContainer [2022-12-13 12:29:13,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:29:13,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:29:13,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:29:13,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:29:13,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:29:12" (1/3) ... [2022-12-13 12:29:13,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b784f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:29:13, skipping insertion in model container [2022-12-13 12:29:13,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:29:13" (2/3) ... [2022-12-13 12:29:13,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b784f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:29:13, skipping insertion in model container [2022-12-13 12:29:13,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:29:13" (3/3) ... [2022-12-13 12:29:13,511 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-12-13 12:29:13,525 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:29:13,525 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 12:29:13,525 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:29:13,592 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:29:13,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 162 transitions, 329 flow [2022-12-13 12:29:13,698 INFO L130 PetriNetUnfolder]: 8/164 cut-off events. [2022-12-13 12:29:13,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:29:13,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 164 events. 8/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 149 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2022-12-13 12:29:13,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 162 transitions, 329 flow [2022-12-13 12:29:13,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 160 transitions, 323 flow [2022-12-13 12:29:13,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:13,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 160 transitions, 323 flow [2022-12-13 12:29:13,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 160 transitions, 323 flow [2022-12-13 12:29:13,822 INFO L130 PetriNetUnfolder]: 8/160 cut-off events. [2022-12-13 12:29:13,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:29:13,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 160 events. 8/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 141 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2022-12-13 12:29:13,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 160 transitions, 323 flow [2022-12-13 12:29:13,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 6570 [2022-12-13 12:29:20,143 INFO L241 LiptonReduction]: Total number of compositions: 149 [2022-12-13 12:29:20,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:29:20,159 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;@e345ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:29:20,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 12:29:20,161 INFO L130 PetriNetUnfolder]: 1/12 cut-off events. [2022-12-13 12:29:20,161 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:29:20,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:20,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 12:29:20,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:20,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash 20760731, now seen corresponding path program 1 times [2022-12-13 12:29:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:20,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817533914] [2022-12-13 12:29:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:20,344 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:29:20,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:20,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817533914] [2022-12-13 12:29:20,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817533914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:20,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:20,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:29:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580824485] [2022-12-13 12:29:20,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:20,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:29:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:29:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:29:20,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 61 [2022-12-13 12:29:20,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 125 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:29:20,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:20,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 61 [2022-12-13 12:29:20,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:20,548 INFO L130 PetriNetUnfolder]: 430/962 cut-off events. [2022-12-13 12:29:20,548 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:29:20,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 962 events. 430/962 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5961 event pairs, 396 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 1831. Up to 874 conditions per place. [2022-12-13 12:29:20,553 INFO L137 encePairwiseOnDemand]: 58/61 looper letters, 45 selfloop transitions, 0 changer transitions 4/58 dead transitions. [2022-12-13 12:29:20,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 215 flow [2022-12-13 12:29:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:29:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:29:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2022-12-13 12:29:20,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5819672131147541 [2022-12-13 12:29:20,564 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 125 flow. Second operand 2 states and 71 transitions. [2022-12-13 12:29:20,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 215 flow [2022-12-13 12:29:20,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:29:20,568 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 110 flow [2022-12-13 12:29:20,569 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=110, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2022-12-13 12:29:20,572 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2022-12-13 12:29:20,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:20,573 INFO L89 Accepts]: Start accepts. Operand has 61 places, 54 transitions, 110 flow [2022-12-13 12:29:20,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:20,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:20,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 54 transitions, 110 flow [2022-12-13 12:29:20,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 54 transitions, 110 flow [2022-12-13 12:29:20,581 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-12-13 12:29:20,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:29:20,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 54 events. 0/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 173 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 12:29:20,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 54 transitions, 110 flow [2022-12-13 12:29:20,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 840 [2022-12-13 12:29:20,739 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:29:20,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 12:29:20,744 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 110 flow [2022-12-13 12:29:20,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:29:20,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:20,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:29:20,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:29:20,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1525135956, now seen corresponding path program 1 times [2022-12-13 12:29:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:20,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542412612] [2022-12-13 12:29:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:20,948 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:29:20,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:20,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542412612] [2022-12-13 12:29:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542412612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:20,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:20,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:29:20,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972635448] [2022-12-13 12:29:20,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:20,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:29:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:20,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:29:20,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:29:20,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2022-12-13 12:29:20,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:29:20,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:20,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2022-12-13 12:29:20,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:21,147 INFO L130 PetriNetUnfolder]: 313/882 cut-off events. [2022-12-13 12:29:21,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:29:21,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 882 events. 313/882 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5890 event pairs, 19 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 1697. Up to 480 conditions per place. [2022-12-13 12:29:21,166 INFO L137 encePairwiseOnDemand]: 31/54 looper letters, 46 selfloop transitions, 40 changer transitions 0/94 dead transitions. [2022-12-13 12:29:21,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 362 flow [2022-12-13 12:29:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:29:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:29:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2022-12-13 12:29:21,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-13 12:29:21,168 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 110 flow. Second operand 5 states and 128 transitions. [2022-12-13 12:29:21,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 362 flow [2022-12-13 12:29:21,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:29:21,170 INFO L231 Difference]: Finished difference. Result has 64 places, 75 transitions, 301 flow [2022-12-13 12:29:21,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=64, PETRI_TRANSITIONS=75} [2022-12-13 12:29:21,170 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2022-12-13 12:29:21,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:21,171 INFO L89 Accepts]: Start accepts. Operand has 64 places, 75 transitions, 301 flow [2022-12-13 12:29:21,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:21,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:21,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 75 transitions, 301 flow [2022-12-13 12:29:21,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 75 transitions, 301 flow [2022-12-13 12:29:21,183 INFO L130 PetriNetUnfolder]: 4/238 cut-off events. [2022-12-13 12:29:21,183 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 12:29:21,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 238 events. 4/238 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1885 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 380. Up to 41 conditions per place. [2022-12-13 12:29:21,184 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 75 transitions, 301 flow [2022-12-13 12:29:21,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-13 12:29:21,242 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:29:21,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 12:29:21,243 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 75 transitions, 301 flow [2022-12-13 12:29:21,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:29:21,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:21,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:21,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:29:21,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash -34574041, now seen corresponding path program 1 times [2022-12-13 12:29:21,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:21,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797351384] [2022-12-13 12:29:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:21,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:21,364 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:29:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:21,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797351384] [2022-12-13 12:29:21,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797351384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:21,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:21,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:29:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058874273] [2022-12-13 12:29:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:21,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:29:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:29:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:29:21,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2022-12-13 12:29:21,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 75 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:29:21,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:21,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2022-12-13 12:29:21,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:21,631 INFO L130 PetriNetUnfolder]: 322/916 cut-off events. [2022-12-13 12:29:21,632 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-13 12:29:21,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 916 events. 322/916 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6279 event pairs, 73 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 2240. Up to 468 conditions per place. [2022-12-13 12:29:21,635 INFO L137 encePairwiseOnDemand]: 30/54 looper letters, 60 selfloop transitions, 62 changer transitions 0/130 dead transitions. [2022-12-13 12:29:21,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 130 transitions, 733 flow [2022-12-13 12:29:21,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:29:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:29:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2022-12-13 12:29:21,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 12:29:21,637 INFO L175 Difference]: Start difference. First operand has 64 places, 75 transitions, 301 flow. Second operand 8 states and 189 transitions. [2022-12-13 12:29:21,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 130 transitions, 733 flow [2022-12-13 12:29:21,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 130 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:29:21,641 INFO L231 Difference]: Finished difference. Result has 73 places, 97 transitions, 574 flow [2022-12-13 12:29:21,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=574, PETRI_PLACES=73, PETRI_TRANSITIONS=97} [2022-12-13 12:29:21,641 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2022-12-13 12:29:21,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:21,641 INFO L89 Accepts]: Start accepts. Operand has 73 places, 97 transitions, 574 flow [2022-12-13 12:29:21,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:21,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:21,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 97 transitions, 574 flow [2022-12-13 12:29:21,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 97 transitions, 574 flow [2022-12-13 12:29:21,657 INFO L130 PetriNetUnfolder]: 22/302 cut-off events. [2022-12-13 12:29:21,657 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-13 12:29:21,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 302 events. 22/302 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2407 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 640. Up to 59 conditions per place. [2022-12-13 12:29:21,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 97 transitions, 574 flow [2022-12-13 12:29:21,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 680 [2022-12-13 12:29:21,663 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [638] L738-->L739-1: Formula: (and (= |v_ULTIMATE.start_plus_#in~a#1_77| |v_ULTIMATE.start_main_~x~1#1_94|) (= |v_ULTIMATE.start_main_~x~1#1_94| v_~g~0_43) (= (+ |v_ULTIMATE.start_plus_#in~b#1_77| 17) 0)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_94|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_77|, ~g~0=v_~g~0_43, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_77|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_94|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ~g~0, ULTIMATE.start_plus_#in~a#1] [2022-12-13 12:29:21,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [639] L738-->L752-1: Formula: (and (= |v_ULTIMATE.start_main_~x~1#1_96| v_~g~0_45) (= |v_ULTIMATE.start_plus_#in~a#1_79| |v_ULTIMATE.start_main_~x~1#1_96|) (= |v_ULTIMATE.start_plus_#in~a#1_79| |v_ULTIMATE.start_plus_~a#1_98|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (ite (or (<= 0 (+ |v_ULTIMATE.start_plus_~b#1_100| |v_ULTIMATE.start_plus_~a#1_98| 2147483648)) (<= 0 |v_ULTIMATE.start_plus_~b#1_100|)) 1 0)) (= (+ |v_ULTIMATE.start_plus_#in~b#1_79| 17) 0) (= |v_ULTIMATE.start_plus_#in~b#1_79| |v_ULTIMATE.start_plus_~b#1_100|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_96|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_79|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_58|, ~g~0=v_~g~0_45, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_98|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_100|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_79|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_96|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:21,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [641] L738-->L21: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_117| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_127|) (= |v_ULTIMATE.start_plus_#in~a#1_83| |v_ULTIMATE.start_main_~x~1#1_100|) (= |v_ULTIMATE.start_plus_~a#1_102| |v_ULTIMATE.start_plus_#in~a#1_83|) (= |v_ULTIMATE.start_plus_#in~b#1_83| |v_ULTIMATE.start_plus_~b#1_104|) (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_104|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_102| |v_ULTIMATE.start_plus_~b#1_104| 2147483648))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_117|) (= v_~g~0_49 |v_ULTIMATE.start_main_~x~1#1_100|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_83| 17) 0)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_100|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_127|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_62|, ~g~0=v_~g~0_49, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_102|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_104|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_83|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_100|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_117|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:21,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [670] L738-->L739-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_plus_~a#1_154| |v_ULTIMATE.start_plus_~b#1_156|))) (and (= .cse0 |v_ULTIMATE.start_plus_#res#1_118|) (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_127|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_151| (ite (or (<= .cse0 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_156| 0)) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_151| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_171|) (= |v_ULTIMATE.start_plus_~a#1_154| |v_ULTIMATE.start_plus_#in~a#1_127|) (= |v_ULTIMATE.start_main_~x~1#1_148| |v_ULTIMATE.start_plus_#in~a#1_127|) (not (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_156|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_154| |v_ULTIMATE.start_plus_~b#1_156| 2147483648))) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~ret13#1_98| |v_ULTIMATE.start_plus_#res#1_118|) (= |v_ULTIMATE.start_plus_~b#1_156| |v_ULTIMATE.start_plus_#in~b#1_127|) (= v_~g~0_113 |v_ULTIMATE.start_main_~x~1#1_148|))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_148|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_127|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_118|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_171|, ~g~0=v_~g~0_113, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_98|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_154|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_156|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_127|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_148|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_151|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~g~0, ULTIMATE.start_main_#t~ret13#1, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:21,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [671] L738-->L739-4: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_plus_~a#1_156| |v_ULTIMATE.start_plus_~b#1_158|))) (and (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_129|) 0) (<= |v_ULTIMATE.start_main_#t~ret13#1_100| 2147483647) (= |v_ULTIMATE.start_plus_~a#1_156| |v_ULTIMATE.start_plus_#in~a#1_129|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_153| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= |v_ULTIMATE.start_plus_#res#1_122| |v_ULTIMATE.start_main_#t~ret13#1_100|) (= |v_ULTIMATE.start_main_~x~1#1_150| |v_ULTIMATE.start_plus_#in~a#1_129|) (= v_~g~0_115 |v_ULTIMATE.start_main_~x~1#1_150|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_153| (ite (or (<= .cse0 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_158| 0)) 1 0)) (= .cse0 |v_ULTIMATE.start_plus_#res#1_122|) (= |v_ULTIMATE.start_plus_~b#1_158| |v_ULTIMATE.start_plus_#in~b#1_129|) (<= 0 (+ 2147483648 |v_ULTIMATE.start_main_#t~ret13#1_100|)))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_150|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_129|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_122|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ~g~0=v_~g~0_115, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_100|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_156|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_158|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_129|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_150|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_153|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~g~0, ULTIMATE.start_main_#t~ret13#1, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:21,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [643] L738-->L21-1: Formula: (and (= |v_ULTIMATE.start_plus_#in~a#1_87| |v_ULTIMATE.start_main_~x~1#1_104|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_121| (ite (or (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_106| |v_ULTIMATE.start_plus_~b#1_108| 2147483648)) (<= 0 |v_ULTIMATE.start_plus_~b#1_108|)) 1 0)) (= |v_ULTIMATE.start_plus_#in~b#1_87| |v_ULTIMATE.start_plus_~b#1_108|) (= v_~g~0_53 |v_ULTIMATE.start_main_~x~1#1_104|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_121| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_131|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_131| 0) (= |v_ULTIMATE.start_plus_~a#1_106| |v_ULTIMATE.start_plus_#in~a#1_87|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_87| 17) 0)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_104|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_87|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_131|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_66|, ~g~0=v_~g~0_53, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_106|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_108|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_87|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_104|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_121|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:21,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [673] L738-->L20-3: Formula: (and (= v_~g~0_119 |v_ULTIMATE.start_main_~x~1#1_154|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_157| (ite (or (<= (+ |v_ULTIMATE.start_plus_~a#1_160| |v_ULTIMATE.start_plus_~b#1_162|) 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_162| 0)) 1 0)) (= |v_ULTIMATE.start_plus_~b#1_162| |v_ULTIMATE.start_plus_#in~b#1_133|) (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_133|) 0) (= |v_ULTIMATE.start_main_~x~1#1_154| |v_ULTIMATE.start_plus_#in~a#1_133|) (not (= (ite (or (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_160| |v_ULTIMATE.start_plus_~b#1_162| 2147483648)) (<= 0 |v_ULTIMATE.start_plus_~b#1_162|)) 1 0) 0)) (= |v_ULTIMATE.start_plus_~a#1_160| |v_ULTIMATE.start_plus_#in~a#1_133|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_157| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_177|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_154|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_133|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_177|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_128|, ~g~0=v_~g~0_119, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_160|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_162|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_133|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_154|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_157|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:21,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [674] L738-->plus_returnLabel#1: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_plus_~a#1_162| |v_ULTIMATE.start_plus_~b#1_164|))) (and (= |v_ULTIMATE.start_plus_~a#1_162| |v_ULTIMATE.start_plus_#in~a#1_135|) (= v_~g~0_121 |v_ULTIMATE.start_main_~x~1#1_156|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_179|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159| (ite (or (<= .cse0 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_164| 0)) 1 0)) (= .cse0 |v_ULTIMATE.start_plus_#res#1_130|) (= |v_ULTIMATE.start_main_~x~1#1_156| |v_ULTIMATE.start_plus_#in~a#1_135|) (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_135|) 0) (not (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_164|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_162| |v_ULTIMATE.start_plus_~b#1_164| 2147483648))) 1 0) 0)) (= |v_ULTIMATE.start_plus_~b#1_164| |v_ULTIMATE.start_plus_#in~b#1_135|))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_156|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_135|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_130|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_179|, ~g~0=v_~g~0_121, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_162|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_164|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_135|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_156|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:22,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [653] L738-->L753: Formula: (and (= |v_ULTIMATE.start_plus_#in~a#1_Out_6| |v_ULTIMATE.start_plus_~a#1_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (or (<= |v_ULTIMATE.start_plus_~b#1_Out_6| 0) (<= (+ |v_ULTIMATE.start_plus_~b#1_Out_6| |v_ULTIMATE.start_plus_~a#1_Out_6|) 2147483647)) 1 0)) (= |v_ULTIMATE.start_main_~x~1#1_In_3| |v_ULTIMATE.start_plus_#in~a#1_Out_6|) (= |v_ULTIMATE.start_plus_#in~b#1_Out_6| |v_ULTIMATE.start_plus_~b#1_Out_6|) (= |v_ULTIMATE.start_main_~x~1#1_In_3| v_~g~0_Out_6) (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_Out_6|) (<= 0 (+ |v_ULTIMATE.start_plus_~b#1_Out_6| 2147483648 |v_ULTIMATE.start_plus_~a#1_Out_6|))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_Out_6| 17) 0)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_3|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_Out_6|, ~g~0=v_~g~0_Out_6, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_Out_6|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_Out_6|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_Out_6|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:22,083 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [654] L738-->L21-3: Formula: (and (= v_~g~0_Out_10 |v_ULTIMATE.start_main_~x~1#1_In_5|) (not (= (ite (or (<= 0 (+ |v_ULTIMATE.start_plus_~b#1_Out_10| |v_ULTIMATE.start_plus_~a#1_Out_10| 2147483648)) (<= 0 |v_ULTIMATE.start_plus_~b#1_Out_10|)) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (or (<= (+ |v_ULTIMATE.start_plus_~b#1_Out_10| |v_ULTIMATE.start_plus_~a#1_Out_10|) 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_Out_10| 0)) 1 0)) (= |v_ULTIMATE.start_plus_~b#1_Out_10| |v_ULTIMATE.start_plus_#in~b#1_Out_10|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_Out_10|) 0) (= |v_ULTIMATE.start_plus_~a#1_Out_10| |v_ULTIMATE.start_plus_#in~a#1_Out_10|) (= |v_ULTIMATE.start_main_~x~1#1_In_5| |v_ULTIMATE.start_plus_#in~a#1_Out_10|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_5|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_Out_10|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_Out_10|, ~g~0=v_~g~0_Out_10, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_Out_10|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_Out_10|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_Out_10|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:22,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [655] L738-->L20-2: Formula: (and (= |v_ULTIMATE.start_main_~x~1#1_In_7| |v_ULTIMATE.start_plus_#in~a#1_Out_14|) (= |v_ULTIMATE.start_plus_~a#1_Out_14| |v_ULTIMATE.start_plus_#in~a#1_Out_14|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (or (<= |v_ULTIMATE.start_plus_~b#1_Out_14| 0) (<= (+ |v_ULTIMATE.start_plus_~b#1_Out_14| |v_ULTIMATE.start_plus_~a#1_Out_14|) 2147483647)) 1 0)) (= v_~g~0_Out_14 |v_ULTIMATE.start_main_~x~1#1_In_7|) (= |v_ULTIMATE.start_plus_~b#1_Out_14| |v_ULTIMATE.start_plus_#in~b#1_Out_14|) (not (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_Out_14|) (<= 0 (+ |v_ULTIMATE.start_plus_~b#1_Out_14| |v_ULTIMATE.start_plus_~a#1_Out_14| 2147483648))) 1 0) 0)) (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_Out_14|) 0)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_7|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_Out_14|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_Out_14|, ~g~0=v_~g~0_Out_14, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_Out_14|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_Out_14|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_Out_14|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:22,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [271] L738-->L739: Formula: (= |v_ULTIMATE.start_main_~x~1#1_4| v_~g~0_2) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_4|} OutVars{ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_4|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] [2022-12-13 12:29:22,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [652] L738-->L20-1: Formula: (and (= |v_ULTIMATE.start_plus_#in~a#1_Out_2| |v_ULTIMATE.start_plus_~a#1_Out_2|) (= |v_ULTIMATE.start_main_~x~1#1_In_1| |v_ULTIMATE.start_plus_#in~a#1_Out_2|) (= 0 (+ |v_ULTIMATE.start_plus_#in~b#1_Out_2| 17)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_Out_2|) (<= 0 (+ |v_ULTIMATE.start_plus_~b#1_Out_2| 2147483648 |v_ULTIMATE.start_plus_~a#1_Out_2|))) 1 0)) (= |v_ULTIMATE.start_plus_#in~b#1_Out_2| |v_ULTIMATE.start_plus_~b#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_main_~x~1#1_In_1| v_~g~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_1|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_Out_2|, ~g~0=v_~g~0_Out_2, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_Out_2|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_Out_2|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_Out_2|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:22,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [633] L738-->L20: Formula: (and (= (+ |v_ULTIMATE.start_plus_#in~b#1_67| 17) 0) (= |v_ULTIMATE.start_plus_#in~a#1_67| |v_ULTIMATE.start_plus_~a#1_88|) (= |v_ULTIMATE.start_plus_#in~b#1_67| |v_ULTIMATE.start_plus_~b#1_90|) (= |v_ULTIMATE.start_main_~x~1#1_84| v_~g~0_33) (= |v_ULTIMATE.start_plus_#in~a#1_67| |v_ULTIMATE.start_main_~x~1#1_84|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_90|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_88| |v_ULTIMATE.start_plus_~b#1_90| 2147483648))) 1 0))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_84|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_67|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_121|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_48|, ~g~0=v_~g~0_33, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_88|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_90|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_67|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_84|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:22,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [630] L738-->L739-2: Formula: (and (= |v_ULTIMATE.start_main_~x~1#1_78| v_~g~0_27) (= (+ |v_ULTIMATE.start_plus_#in~b#1_61| 17) 0) (= |v_ULTIMATE.start_plus_#in~a#1_61| |v_ULTIMATE.start_main_~x~1#1_78|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_78|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_61|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_42|, ~g~0=v_~g~0_27, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_61|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_78|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_#in~a#1] [2022-12-13 12:29:22,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [634] L738-->L751: Formula: (and (= |v_ULTIMATE.start_main_~x~1#1_86| v_~g~0_35) (= |v_ULTIMATE.start_plus_#in~a#1_69| |v_ULTIMATE.start_main_~x~1#1_86|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_69| 17) 0)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_86|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_69|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_50|, ~g~0=v_~g~0_35, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_90|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_92|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_69|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_86|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1] [2022-12-13 12:29:22,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [635] L738-->L751-1: Formula: (and (= |v_ULTIMATE.start_plus_#in~a#1_71| |v_ULTIMATE.start_plus_~a#1_92|) (= |v_ULTIMATE.start_main_~x~1#1_88| v_~g~0_37) (= |v_ULTIMATE.start_plus_#in~a#1_71| |v_ULTIMATE.start_main_~x~1#1_88|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_71| 17) 0)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_88|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_71|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_52|, ~g~0=v_~g~0_37, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_92|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_71|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_94|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_88|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_plus_~b#1] [2022-12-13 12:29:22,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [636] L738-->L752: Formula: (and (= |v_ULTIMATE.start_plus_#in~a#1_73| |v_ULTIMATE.start_main_~x~1#1_90|) (= |v_ULTIMATE.start_plus_#in~b#1_73| |v_ULTIMATE.start_plus_~b#1_96|) (= |v_ULTIMATE.start_main_~x~1#1_90| v_~g~0_39) (= |v_ULTIMATE.start_plus_#in~a#1_73| |v_ULTIMATE.start_plus_~a#1_94|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_73| 17) 0)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_90|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_73|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_54|, ~g~0=v_~g~0_39, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_94|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_96|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_73|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_90|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1] [2022-12-13 12:29:22,402 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:29:22,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 762 [2022-12-13 12:29:22,403 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 96 transitions, 642 flow [2022-12-13 12:29:22,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:29:22,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:22,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:22,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:29:22,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:22,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1415096597, now seen corresponding path program 1 times [2022-12-13 12:29:22,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:22,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385100299] [2022-12-13 12:29:22,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:22,478 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:29:22,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:22,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385100299] [2022-12-13 12:29:22,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385100299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:22,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:22,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:29:22,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136082337] [2022-12-13 12:29:22,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:22,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:29:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:22,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:29:22,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:29:22,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 73 [2022-12-13 12:29:22,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 96 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:29:22,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:22,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 73 [2022-12-13 12:29:22,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:22,586 INFO L130 PetriNetUnfolder]: 264/659 cut-off events. [2022-12-13 12:29:22,586 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2022-12-13 12:29:22,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 659 events. 264/659 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3557 event pairs, 75 based on Foata normal form. 33/458 useless extension candidates. Maximal degree in co-relation 1751. Up to 329 conditions per place. [2022-12-13 12:29:22,589 INFO L137 encePairwiseOnDemand]: 58/73 looper letters, 59 selfloop transitions, 15 changer transitions 17/96 dead transitions. [2022-12-13 12:29:22,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 647 flow [2022-12-13 12:29:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:29:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:29:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-12-13 12:29:22,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4063926940639269 [2022-12-13 12:29:22,590 INFO L175 Difference]: Start difference. First operand has 72 places, 96 transitions, 642 flow. Second operand 3 states and 89 transitions. [2022-12-13 12:29:22,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 647 flow [2022-12-13 12:29:22,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 508 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-13 12:29:22,594 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 289 flow [2022-12-13 12:29:22,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2022-12-13 12:29:22,594 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2022-12-13 12:29:22,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:22,595 INFO L89 Accepts]: Start accepts. Operand has 67 places, 66 transitions, 289 flow [2022-12-13 12:29:22,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:22,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:22,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 66 transitions, 289 flow [2022-12-13 12:29:22,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 66 transitions, 289 flow [2022-12-13 12:29:22,630 INFO L130 PetriNetUnfolder]: 21/174 cut-off events. [2022-12-13 12:29:22,631 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 12:29:22,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 174 events. 21/174 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 968 event pairs, 8 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 333. Up to 57 conditions per place. [2022-12-13 12:29:22,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 66 transitions, 289 flow [2022-12-13 12:29:22,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-13 12:29:22,849 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 12:29:22,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-13 12:29:22,850 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 285 flow [2022-12-13 12:29:22,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:29:22,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:22,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:22,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:29:22,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash -839367769, now seen corresponding path program 1 times [2022-12-13 12:29:22,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:22,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337008631] [2022-12-13 12:29:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:22,965 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:29:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:22,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337008631] [2022-12-13 12:29:22,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337008631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:22,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:22,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:29:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230099767] [2022-12-13 12:29:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:22,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:29:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:22,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:29:22,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:29:22,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 12:29:22,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:29:22,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:22,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 12:29:22,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:23,138 INFO L130 PetriNetUnfolder]: 196/522 cut-off events. [2022-12-13 12:29:23,139 INFO L131 PetriNetUnfolder]: For 92/94 co-relation queries the response was YES. [2022-12-13 12:29:23,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 522 events. 196/522 cut-off events. For 92/94 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3028 event pairs, 79 based on Foata normal form. 35/364 useless extension candidates. Maximal degree in co-relation 1490. Up to 257 conditions per place. [2022-12-13 12:29:23,141 INFO L137 encePairwiseOnDemand]: 26/51 looper letters, 50 selfloop transitions, 27 changer transitions 38/120 dead transitions. [2022-12-13 12:29:23,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 120 transitions, 764 flow [2022-12-13 12:29:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:29:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:29:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2022-12-13 12:29:23,142 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3480392156862745 [2022-12-13 12:29:23,143 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 285 flow. Second operand 8 states and 142 transitions. [2022-12-13 12:29:23,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 120 transitions, 764 flow [2022-12-13 12:29:23,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 734 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 12:29:23,147 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 348 flow [2022-12-13 12:29:23,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=348, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2022-12-13 12:29:23,149 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2022-12-13 12:29:23,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:23,149 INFO L89 Accepts]: Start accepts. Operand has 71 places, 62 transitions, 348 flow [2022-12-13 12:29:23,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:23,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:23,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 62 transitions, 348 flow [2022-12-13 12:29:23,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 348 flow [2022-12-13 12:29:23,162 INFO L130 PetriNetUnfolder]: 25/215 cut-off events. [2022-12-13 12:29:23,162 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-13 12:29:23,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 215 events. 25/215 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1525 event pairs, 10 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 511. Up to 69 conditions per place. [2022-12-13 12:29:23,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 348 flow [2022-12-13 12:29:23,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 12:29:23,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] L21-->L723: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_101| |v_t_funThread1of1ForFork0_plus_~b#1_103|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59| |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_81|) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_82| 0)) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_95| 2147483648)) (= |v_t_funThread1of1ForFork0_plus_#res#1_95| .cse0) (<= |v_t_funThread1of1ForFork0_plus_#res#1_95| 2147483647) (= |v_t_funThread1of1ForFork0_plus_#res#1_95| v_~i~0_75) (= (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_103| 0)) 1 0) |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_101|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_103|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_82|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_95|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_101|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~i~0=v_~i~0_75, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_103|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_81|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_37|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] and [700] L735-1-->L738: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2020| |v_~#A~0.base_371|))) (and (= (select .cse0 |v_~#A~0.offset_371|) 0) (= (store |v_#pthreadsMutex_2020| |v_~#A~0.base_371| (store .cse0 |v_~#A~0.offset_371| 1)) |v_#pthreadsMutex_2019|) (= v_~i~0_195 11))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2020|, ~#A~0.offset=|v_~#A~0.offset_371|, ~#A~0.base=|v_~#A~0.base_371|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2019|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_196|, ~#A~0.offset=|v_~#A~0.offset_371|, ~i~0=v_~i~0_195, ~#A~0.base=|v_~#A~0.base_371|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_130|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ~i~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 12:29:23,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] L21-->L723: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_101| |v_t_funThread1of1ForFork0_plus_~b#1_103|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59| |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_81|) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_82| 0)) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_95| 2147483648)) (= |v_t_funThread1of1ForFork0_plus_#res#1_95| .cse0) (<= |v_t_funThread1of1ForFork0_plus_#res#1_95| 2147483647) (= |v_t_funThread1of1ForFork0_plus_#res#1_95| v_~i~0_75) (= (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_103| 0)) 1 0) |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_101|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_103|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_82|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_95|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_101|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~i~0=v_~i~0_75, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_103|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_81|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_37|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] and [654] L738-->L21-3: Formula: (and (= v_~g~0_Out_10 |v_ULTIMATE.start_main_~x~1#1_In_5|) (not (= (ite (or (<= 0 (+ |v_ULTIMATE.start_plus_~b#1_Out_10| |v_ULTIMATE.start_plus_~a#1_Out_10| 2147483648)) (<= 0 |v_ULTIMATE.start_plus_~b#1_Out_10|)) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (or (<= (+ |v_ULTIMATE.start_plus_~b#1_Out_10| |v_ULTIMATE.start_plus_~a#1_Out_10|) 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_Out_10| 0)) 1 0)) (= |v_ULTIMATE.start_plus_~b#1_Out_10| |v_ULTIMATE.start_plus_#in~b#1_Out_10|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_Out_10|) 0) (= |v_ULTIMATE.start_plus_~a#1_Out_10| |v_ULTIMATE.start_plus_#in~a#1_Out_10|) (= |v_ULTIMATE.start_main_~x~1#1_In_5| |v_ULTIMATE.start_plus_#in~a#1_Out_10|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_5|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_Out_10|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_Out_10|, ~g~0=v_~g~0_Out_10, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_Out_10|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_Out_10|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_Out_10|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:23,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [298] L746-->L747: Formula: (= 3 v_~i~0_3) InVars {} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[~i~0] and [662] L21-->L723: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_101| |v_t_funThread1of1ForFork0_plus_~b#1_103|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59| |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_81|) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_82| 0)) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_95| 2147483648)) (= |v_t_funThread1of1ForFork0_plus_#res#1_95| .cse0) (<= |v_t_funThread1of1ForFork0_plus_#res#1_95| 2147483647) (= |v_t_funThread1of1ForFork0_plus_#res#1_95| v_~i~0_75) (= (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_103| 0)) 1 0) |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_101|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_103|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_82|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_95|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_101|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~i~0=v_~i~0_75, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_103|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_81|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_37|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] [2022-12-13 12:29:23,540 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:29:23,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 392 [2022-12-13 12:29:23,541 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 354 flow [2022-12-13 12:29:23,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:29:23,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:23,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:23,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:29:23,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:23,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 446135339, now seen corresponding path program 1 times [2022-12-13 12:29:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:23,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175061066] [2022-12-13 12:29:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:23,627 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:29:23,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:23,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175061066] [2022-12-13 12:29:23,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175061066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:23,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:23,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:29:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643639067] [2022-12-13 12:29:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:23,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:29:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:29:23,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:29:23,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2022-12-13 12:29:23,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:29:23,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:23,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2022-12-13 12:29:23,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:23,727 INFO L130 PetriNetUnfolder]: 135/409 cut-off events. [2022-12-13 12:29:23,728 INFO L131 PetriNetUnfolder]: For 215/219 co-relation queries the response was YES. [2022-12-13 12:29:23,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 409 events. 135/409 cut-off events. For 215/219 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2526 event pairs, 50 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 1311. Up to 290 conditions per place. [2022-12-13 12:29:23,729 INFO L137 encePairwiseOnDemand]: 31/50 looper letters, 45 selfloop transitions, 18 changer transitions 3/72 dead transitions. [2022-12-13 12:29:23,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 72 transitions, 522 flow [2022-12-13 12:29:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:29:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:29:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 12:29:23,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-13 12:29:23,730 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 354 flow. Second operand 4 states and 76 transitions. [2022-12-13 12:29:23,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 72 transitions, 522 flow [2022-12-13 12:29:23,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:29:23,733 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 346 flow [2022-12-13 12:29:23,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2022-12-13 12:29:23,733 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2022-12-13 12:29:23,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:23,734 INFO L89 Accepts]: Start accepts. Operand has 69 places, 58 transitions, 346 flow [2022-12-13 12:29:23,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:23,734 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:23,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 58 transitions, 346 flow [2022-12-13 12:29:23,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 58 transitions, 346 flow [2022-12-13 12:29:23,744 INFO L130 PetriNetUnfolder]: 23/184 cut-off events. [2022-12-13 12:29:23,744 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-13 12:29:23,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 184 events. 23/184 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1204 event pairs, 10 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 492. Up to 66 conditions per place. [2022-12-13 12:29:23,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 58 transitions, 346 flow [2022-12-13 12:29:23,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 12:29:23,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L21-3-->L740: Formula: (and (= v_~h~0_71 |v_ULTIMATE.start_plus_#res#1_106|) (<= 0 (+ 2147483648 |v_ULTIMATE.start_plus_#res#1_106|)) (<= |v_ULTIMATE.start_plus_#res#1_106| 2147483647) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_159| 0)) (= (+ |v_ULTIMATE.start_plus_~a#1_142| |v_ULTIMATE.start_plus_~b#1_144|) |v_ULTIMATE.start_plus_#res#1_106|)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_159|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_142|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_144|} OutVars{~h~0=v_~h~0_71, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_106|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_159|, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_84|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_142|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_144|} AuxVars[] AssignedVars[~h~0, ULTIMATE.start_plus_#res#1, ULTIMATE.start_main_#t~ret13#1] and [702] L741-->L744: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2029| |v_~#A~0.base_375|))) (and (= |v_#pthreadsMutex_2027| (store |v_#pthreadsMutex_2029| |v_~#A~0.base_375| (store .cse0 |v_~#A~0.offset_375| 0))) (= (select .cse0 |v_~#A~0.offset_375|) 0) (= v_~h~0_133 |v_ULTIMATE.start_main_~x~1#1_252|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2029|, ~#A~0.offset=|v_~#A~0.offset_375|, ~#A~0.base=|v_~#A~0.base_375|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_252|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2027|, ~#A~0.offset=|v_~#A~0.offset_375|, ~h~0=v_~h~0_133, ~#A~0.base=|v_~#A~0.base_375|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_252|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_134|} AuxVars[] AssignedVars[#pthreadsMutex, ~h~0, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 12:29:23,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:29:23,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 12:29:23,883 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 370 flow [2022-12-13 12:29:23,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:29:23,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:23,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:23,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:29:23,884 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash 449461443, now seen corresponding path program 1 times [2022-12-13 12:29:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:23,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159151397] [2022-12-13 12:29:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:23,943 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:29:23,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:23,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159151397] [2022-12-13 12:29:23,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159151397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:23,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:23,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:29:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322512670] [2022-12-13 12:29:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:23,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:29:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:23,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:29:23,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:29:23,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 50 [2022-12-13 12:29:23,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 370 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:29:23,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:23,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 50 [2022-12-13 12:29:23,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:24,051 INFO L130 PetriNetUnfolder]: 127/371 cut-off events. [2022-12-13 12:29:24,051 INFO L131 PetriNetUnfolder]: For 229/232 co-relation queries the response was YES. [2022-12-13 12:29:24,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 371 events. 127/371 cut-off events. For 229/232 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2059 event pairs, 74 based on Foata normal form. 24/287 useless extension candidates. Maximal degree in co-relation 1209. Up to 253 conditions per place. [2022-12-13 12:29:24,053 INFO L137 encePairwiseOnDemand]: 26/50 looper letters, 40 selfloop transitions, 6 changer transitions 22/73 dead transitions. [2022-12-13 12:29:24,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 545 flow [2022-12-13 12:29:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:29:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:29:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-13 12:29:24,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24285714285714285 [2022-12-13 12:29:24,055 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 370 flow. Second operand 7 states and 85 transitions. [2022-12-13 12:29:24,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 545 flow [2022-12-13 12:29:24,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 499 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 12:29:24,058 INFO L231 Difference]: Finished difference. Result has 74 places, 41 transitions, 210 flow [2022-12-13 12:29:24,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=74, PETRI_TRANSITIONS=41} [2022-12-13 12:29:24,058 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2022-12-13 12:29:24,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:24,058 INFO L89 Accepts]: Start accepts. Operand has 74 places, 41 transitions, 210 flow [2022-12-13 12:29:24,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:24,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:24,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 41 transitions, 210 flow [2022-12-13 12:29:24,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 210 flow [2022-12-13 12:29:24,067 INFO L130 PetriNetUnfolder]: 22/129 cut-off events. [2022-12-13 12:29:24,067 INFO L131 PetriNetUnfolder]: For 53/55 co-relation queries the response was YES. [2022-12-13 12:29:24,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 129 events. 22/129 cut-off events. For 53/55 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 719 event pairs, 9 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 285. Up to 56 conditions per place. [2022-12-13 12:29:24,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 41 transitions, 210 flow [2022-12-13 12:29:24,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-13 12:29:24,704 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:29:24,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 647 [2022-12-13 12:29:24,705 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 192 flow [2022-12-13 12:29:24,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:29:24,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:24,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:24,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:29:24,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash 153483784, now seen corresponding path program 1 times [2022-12-13 12:29:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:24,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019734924] [2022-12-13 12:29:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:24,759 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:29:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:24,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019734924] [2022-12-13 12:29:24,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019734924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:24,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:24,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:29:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401892645] [2022-12-13 12:29:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:24,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:29:24,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:24,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:29:24,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:29:24,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 12:29:24,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:29:24,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:24,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 12:29:24,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:24,803 INFO L130 PetriNetUnfolder]: 96/256 cut-off events. [2022-12-13 12:29:24,803 INFO L131 PetriNetUnfolder]: For 235/240 co-relation queries the response was YES. [2022-12-13 12:29:24,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 256 events. 96/256 cut-off events. For 235/240 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1313 event pairs, 58 based on Foata normal form. 15/206 useless extension candidates. Maximal degree in co-relation 768. Up to 212 conditions per place. [2022-12-13 12:29:24,804 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 28 selfloop transitions, 3 changer transitions 1/39 dead transitions. [2022-12-13 12:29:24,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 258 flow [2022-12-13 12:29:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:29:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:29:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 12:29:24,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2022-12-13 12:29:24,805 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 192 flow. Second operand 4 states and 43 transitions. [2022-12-13 12:29:24,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 258 flow [2022-12-13 12:29:24,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 227 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-12-13 12:29:24,806 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 161 flow [2022-12-13 12:29:24,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-13 12:29:24,807 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, -18 predicate places. [2022-12-13 12:29:24,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:24,807 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 161 flow [2022-12-13 12:29:24,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:24,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:24,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 161 flow [2022-12-13 12:29:24,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 161 flow [2022-12-13 12:29:24,814 INFO L130 PetriNetUnfolder]: 22/117 cut-off events. [2022-12-13 12:29:24,814 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 12:29:24,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 117 events. 22/117 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 628 event pairs, 9 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 232. Up to 55 conditions per place. [2022-12-13 12:29:24,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 161 flow [2022-12-13 12:29:24,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-13 12:29:24,818 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:29:24,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 12:29:24,818 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 161 flow [2022-12-13 12:29:24,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:29:24,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:24,819 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:24,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:29:24,819 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash 153253183, now seen corresponding path program 1 times [2022-12-13 12:29:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:24,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222652932] [2022-12-13 12:29:24,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:24,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:24,930 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:29:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:24,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222652932] [2022-12-13 12:29:24,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222652932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:24,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:24,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:29:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040247561] [2022-12-13 12:29:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:24,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:29:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:29:24,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:29:24,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 12:29:24,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:29:24,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:24,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 12:29:24,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:25,004 INFO L130 PetriNetUnfolder]: 112/275 cut-off events. [2022-12-13 12:29:25,005 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-13 12:29:25,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 275 events. 112/275 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1396 event pairs, 50 based on Foata normal form. 6/189 useless extension candidates. Maximal degree in co-relation 773. Up to 177 conditions per place. [2022-12-13 12:29:25,006 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 41 selfloop transitions, 9 changer transitions 2/54 dead transitions. [2022-12-13 12:29:25,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 336 flow [2022-12-13 12:29:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:29:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:29:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 12:29:25,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-13 12:29:25,007 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 161 flow. Second operand 4 states and 44 transitions. [2022-12-13 12:29:25,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 336 flow [2022-12-13 12:29:25,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:29:25,009 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 171 flow [2022-12-13 12:29:25,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 12:29:25,009 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, -17 predicate places. [2022-12-13 12:29:25,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:25,009 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 171 flow [2022-12-13 12:29:25,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:25,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:25,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 171 flow [2022-12-13 12:29:25,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 171 flow [2022-12-13 12:29:25,019 INFO L130 PetriNetUnfolder]: 26/125 cut-off events. [2022-12-13 12:29:25,019 INFO L131 PetriNetUnfolder]: For 34/40 co-relation queries the response was YES. [2022-12-13 12:29:25,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 125 events. 26/125 cut-off events. For 34/40 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 616 event pairs, 13 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 285. Up to 57 conditions per place. [2022-12-13 12:29:25,020 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 171 flow [2022-12-13 12:29:25,020 INFO L226 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-13 12:29:25,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L734-3-->L735-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_227| |v_~#B~0.base_55|))) (and (= |v_ULTIMATE.start_main_#t~nondet11#1_10| 0) (= (select .cse0 |v_~#B~0.offset_55|) 0) (= |v_#pthreadsMutex_226| (store |v_#pthreadsMutex_227| |v_~#B~0.base_55| (store .cse0 |v_~#B~0.offset_55| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_227|, ~#B~0.base=|v_~#B~0.base_55|, ~#B~0.offset=|v_~#B~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_226|, ~#B~0.base=|v_~#B~0.base_55|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_13|, ~#B~0.offset=|v_~#B~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1] and [715] L21-->L744: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_198| |v_t_funThread1of1ForFork0_plus_~b#1_200|)) (.cse1 (select |v_#pthreadsMutex_2162| |v_~#A~0.base_420|)) (.cse2 (+ |v_ULTIMATE.start_plus_~a#1_308| |v_ULTIMATE.start_plus_~b#1_310|))) (and (<= |v_ULTIMATE.start_plus_#res#1_281| 2147483647) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_240| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_182|) (= v_~g~0_317 |v_ULTIMATE.start_main_~x~1#1_264|) (= v_~i~0_222 11) (= v_~h~0_161 |v_ULTIMATE.start_main_~x~1#1_264|) (= .cse0 |v_t_funThread1of1ForFork0_plus_#res#1_218|) (= |v_ULTIMATE.start_main_~x~1#1_264| |v_ULTIMATE.start_plus_#in~a#1_251|) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_241| 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_182| (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_200| 0)) 1 0)) (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_251|) 0) (= |v_ULTIMATE.start_plus_~b#1_310| |v_ULTIMATE.start_plus_#in~b#1_251|) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_218| 2147483648)) (= (store |v_#pthreadsMutex_2162| |v_~#A~0.base_420| (store .cse1 |v_~#A~0.offset_420| 0)) |v_#pthreadsMutex_2160|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_255| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_308|) (= |v_ULTIMATE.start_plus_~a#1_308| |v_ULTIMATE.start_plus_#in~a#1_251|) (<= |v_t_funThread1of1ForFork0_plus_#res#1_218| 2147483647) (= .cse2 |v_ULTIMATE.start_plus_#res#1_281|) (= (select .cse1 |v_~#A~0.offset_420|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_255| (ite (or (<= |v_ULTIMATE.start_plus_~b#1_310| 0) (<= .cse2 2147483647)) 1 0)) (<= 0 (+ 2147483648 |v_ULTIMATE.start_plus_#res#1_281|)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2162|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_198|, ~#A~0.offset=|v_~#A~0.offset_420|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_200|, ~#A~0.base=|v_~#A~0.base_420|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_241|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_264|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2160|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_198|, ~h~0=v_~h~0_161, ~i~0=v_~i~0_222, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_281|, ~g~0=v_~g~0_317, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_174|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_308|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_251|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_264|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_142|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_142|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_218|, ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_251|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_214|, ~#A~0.offset=|v_~#A~0.offset_420|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_182|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_308|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_200|, ~#A~0.base=|v_~#A~0.base_420|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_310|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_240|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_99|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_255|} AuxVars[] AssignedVars[#pthreadsMutex, ~h~0, ~i~0, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_main_#t~ret13#1, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet14#1, t_funThread1of1ForFork0_plus_#res#1, ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_main_#t~nondet11#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_~b#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:26,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [723] L714-1-->L21: Formula: (let ((.cse2 (select |v_#pthreadsMutex_2308| |v_~#A~0.base_452|))) (let ((.cse0 (store |v_#pthreadsMutex_2308| |v_~#A~0.base_452| (store .cse2 |v_~#A~0.offset_438| 1)))) (let ((.cse1 (select .cse0 |v_~#B~0.base_402|))) (and (= |v_#pthreadsMutex_2306| (store .cse0 |v_~#B~0.base_402| (store .cse1 |v_~#B~0.offset_396| 0))) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_798| 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_169| 31) (= v_~g~0_332 |v_t_funThread1of1ForFork0_~x~0#1_701|) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_165| |v_t_funThread1of1ForFork0_~x~0#1_701|) (= (select .cse1 |v_~#B~0.offset_396|) 0) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_165| |v_t_funThread1of1ForFork0_plus_~a#1_215|) (= (ite (or (<= 0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_215| |v_t_funThread1of1ForFork0_plus_~b#1_217| 2147483648)) (<= 0 |v_t_funThread1of1ForFork0_plus_~b#1_217|)) 1 0) |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_199|) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_259| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_199|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_532| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_414| |v_t_funThread1of1ForFork0_~x~0#1_701|) 1 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_169| |v_t_funThread1of1ForFork0_plus_~b#1_217|) (= |v_t_funThread1of1ForFork0_~y~0#1_414| v_~h~0_174) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_798| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_532|) (= (select .cse2 |v_~#A~0.offset_438|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2308|, ~#B~0.base=|v_~#B~0.base_402|, ~#A~0.offset=|v_~#A~0.offset_438|, ~h~0=v_~h~0_174, ~g~0=v_~g~0_332, ~#A~0.base=|v_~#A~0.base_452|, ~#B~0.offset=|v_~#B~0.offset_396|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_327|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_215|, #pthreadsMutex=|v_#pthreadsMutex_2306|, ~#B~0.base=|v_~#B~0.base_402|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_701|, ~h~0=v_~h~0_174, ~g~0=v_~g~0_332, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_414|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_165|, ~#B~0.offset=|v_~#B~0.offset_396|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_187|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_235|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_532|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_199|, ~#A~0.offset=|v_~#A~0.offset_438|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_217|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_798|, ~#A~0.base=|v_~#A~0.base_452|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_259|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_169|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_267|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_plus_~a#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_plus_~b#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~nondet5#1] and [725] L734-3-->L744: Formula: (let ((.cse4 (select |v_#pthreadsMutex_2320| |v_~#B~0.base_406|))) (let ((.cse1 (store |v_#pthreadsMutex_2320| |v_~#B~0.base_406| (store .cse4 |v_~#B~0.offset_400| 1)))) (let ((.cse3 (+ |v_t_funThread1of1ForFork0_plus_~a#1_217| |v_t_funThread1of1ForFork0_plus_~b#1_219|)) (.cse2 (select .cse1 |v_~#A~0.base_456|)) (.cse0 (+ |v_ULTIMATE.start_plus_~a#1_323| |v_ULTIMATE.start_plus_~b#1_325|))) (and (= |v_ULTIMATE.start_plus_~a#1_323| |v_ULTIMATE.start_plus_#in~a#1_266|) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_262| 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_261| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|) (= |v_ULTIMATE.start_main_~x~1#1_279| |v_ULTIMATE.start_plus_#in~a#1_266|) (= |v_ULTIMATE.start_plus_~b#1_325| |v_ULTIMATE.start_plus_#in~b#1_266|) (<= 0 (+ 2147483648 |v_ULTIMATE.start_plus_#res#1_300|)) (<= |v_ULTIMATE.start_plus_#res#1_300| 2147483647) (= .cse0 |v_ULTIMATE.start_plus_#res#1_300|) (= v_~h~0_178 |v_ULTIMATE.start_main_~x~1#1_279|) (= |v_#pthreadsMutex_2318| (store .cse1 |v_~#A~0.base_456| (store .cse2 |v_~#A~0.offset_442| 0))) (= (+ 17 |v_ULTIMATE.start_plus_#in~b#1_266|) 0) (= |v_t_funThread1of1ForFork0_plus_#res#1_237| .cse3) (= v_~i~0_234 11) (<= |v_t_funThread1of1ForFork0_plus_#res#1_237| 2147483647) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_237| 2147483648)) (= (ite (or (<= |v_t_funThread1of1ForFork0_plus_~b#1_219| 0) (<= .cse3 2147483647)) 1 0) |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|) (= (select .cse2 |v_~#A~0.offset_442|) 0) (= (select .cse4 |v_~#B~0.offset_400|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_270| (ite (or (<= |v_ULTIMATE.start_plus_~b#1_325| 0) (<= .cse0 2147483647)) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_270| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_323|) (= v_~g~0_336 |v_ULTIMATE.start_main_~x~1#1_279|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2320|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_217|, ~#B~0.base=|v_~#B~0.base_406|, ~#A~0.offset=|v_~#A~0.offset_442|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_219|, ~#A~0.base=|v_~#A~0.base_456|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_262|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_279|, ~#B~0.offset=|v_~#B~0.offset_400|} OutVars{~#B~0.base=|v_~#B~0.base_406|, ~h~0=v_~h~0_178, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_123|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_300|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_323|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_279|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_150|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_237|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_323|, ~#A~0.base=|v_~#A~0.base_456|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_325|, #pthreadsMutex=|v_#pthreadsMutex_2318|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_217|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_113|, ~i~0=v_~i~0_234, ~g~0=v_~g~0_336, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_189|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_266|, ~#B~0.offset=|v_~#B~0.offset_400|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_144|, ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_266|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_230|, ~#A~0.offset=|v_~#A~0.offset_442|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_219|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_261|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_101|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_270|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1, ~h~0, ULTIMATE.start_main_#t~pre9#1, ~i~0, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_main_#t~ret13#1, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet14#1, t_funThread1of1ForFork0_plus_#res#1, ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_main_#t~nondet11#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_~b#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:29:26,105 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 12:29:26,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1097 [2022-12-13 12:29:26,106 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 174 flow [2022-12-13 12:29:26,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:29:26,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:26,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:26,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:29:26,106 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1521465614, now seen corresponding path program 1 times [2022-12-13 12:29:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:26,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991109862] [2022-12-13 12:29:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:26,186 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:29:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:26,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991109862] [2022-12-13 12:29:26,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991109862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:26,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:26,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:29:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594112606] [2022-12-13 12:29:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:26,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:29:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:29:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:29:26,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-13 12:29:26,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:29:26,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:26,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-13 12:29:26,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:26,236 INFO L130 PetriNetUnfolder]: 56/139 cut-off events. [2022-12-13 12:29:26,236 INFO L131 PetriNetUnfolder]: For 127/133 co-relation queries the response was YES. [2022-12-13 12:29:26,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 139 events. 56/139 cut-off events. For 127/133 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 540 event pairs, 11 based on Foata normal form. 18/120 useless extension candidates. Maximal degree in co-relation 434. Up to 80 conditions per place. [2022-12-13 12:29:26,236 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 30 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2022-12-13 12:29:26,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 264 flow [2022-12-13 12:29:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:29:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:29:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 12:29:26,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 12:29:26,237 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 174 flow. Second operand 4 states and 40 transitions. [2022-12-13 12:29:26,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 264 flow [2022-12-13 12:29:26,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 254 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 12:29:26,238 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 119 flow [2022-12-13 12:29:26,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-13 12:29:26,239 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, -26 predicate places. [2022-12-13 12:29:26,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:26,239 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 119 flow [2022-12-13 12:29:26,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:26,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:26,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 119 flow [2022-12-13 12:29:26,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 119 flow [2022-12-13 12:29:26,245 INFO L130 PetriNetUnfolder]: 26/87 cut-off events. [2022-12-13 12:29:26,245 INFO L131 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2022-12-13 12:29:26,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 87 events. 26/87 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 376 event pairs, 13 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 201. Up to 48 conditions per place. [2022-12-13 12:29:26,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 119 flow [2022-12-13 12:29:26,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 12:29:26,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L714-1-->L715-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_139| |v_~#A~0.base_31|))) (and (= (select .cse0 |v_~#A~0.offset_31|) 0) (= (store |v_#pthreadsMutex_139| |v_~#A~0.base_31| (store .cse0 |v_~#A~0.offset_31| 1)) |v_#pthreadsMutex_138|) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_7| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_139|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_138|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_7|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [220] L747-->L733-2: Formula: (= (store |v_#pthreadsMutex_16| |v_~#C~0.base_8| (store (select |v_#pthreadsMutex_16| |v_~#C~0.base_8|) |v_~#C~0.offset_8| 0)) |v_#pthreadsMutex_15|) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 12:29:26,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L714-1-->L715-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_139| |v_~#A~0.base_31|))) (and (= (select .cse0 |v_~#A~0.offset_31|) 0) (= (store |v_#pthreadsMutex_139| |v_~#A~0.base_31| (store .cse0 |v_~#A~0.offset_31| 1)) |v_#pthreadsMutex_138|) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_7| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_139|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_138|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_7|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [551] L747-->ULTIMATE.startFINAL: Formula: (and (= |v_ULTIMATE.start_main_#res#1_18| 0) (= (store |v_#valid_80| |v_ULTIMATE.start_main_~#id~0#1.base_53| 0) |v_#valid_79|) (= (store |v_#pthreadsMutex_427| |v_~#C~0.base_93| (store (select |v_#pthreadsMutex_427| |v_~#C~0.base_93|) |v_~#C~0.offset_93| 0)) |v_#pthreadsMutex_426|) (= |v_ULTIMATE.start_main_#res#1_18| |v_ULTIMATE.start_#t~ret16#1_4|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_427|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_53|, ~#C~0.base=|v_~#C~0.base_93|, #valid=|v_#valid_80|, ~#C~0.offset=|v_~#C~0.offset_93|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_426|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_18|, ~#C~0.base=|v_~#C~0.base_93|, #valid=|v_#valid_79|, ~#C~0.offset=|v_~#C~0.offset_93|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_32|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_4|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#res#1, #valid, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_#t~ret16#1] [2022-12-13 12:29:26,690 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L714-1-->L715-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_139| |v_~#A~0.base_31|))) (and (= (select .cse0 |v_~#A~0.offset_31|) 0) (= (store |v_#pthreadsMutex_139| |v_~#A~0.base_31| (store .cse0 |v_~#A~0.offset_31| 1)) |v_#pthreadsMutex_138|) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_7| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_139|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_138|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_7|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [552] L747-->ULTIMATE.startEXIT: Formula: (and (= |v_ULTIMATE.start_main_#res#1_20| |v_ULTIMATE.start_#t~ret16#1_6|) (= (store |v_#valid_84| |v_ULTIMATE.start_main_~#id~0#1.base_57| 0) |v_#valid_83|) (= |v_ULTIMATE.start_main_#res#1_20| 0) (= (store |v_#pthreadsMutex_431| |v_~#C~0.base_95| (store (select |v_#pthreadsMutex_431| |v_~#C~0.base_95|) |v_~#C~0.offset_95| 0)) |v_#pthreadsMutex_430|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_431|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_57|, ~#C~0.base=|v_~#C~0.base_95|, #valid=|v_#valid_84|, ~#C~0.offset=|v_~#C~0.offset_95|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_430|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, ~#C~0.base=|v_~#C~0.base_95|, #valid=|v_#valid_83|, ~#C~0.offset=|v_~#C~0.offset_95|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_34|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_6|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#res#1, #valid, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_#t~ret16#1] [2022-12-13 12:29:26,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L714-1-->L715-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_139| |v_~#A~0.base_31|))) (and (= (select .cse0 |v_~#A~0.offset_31|) 0) (= (store |v_#pthreadsMutex_139| |v_~#A~0.base_31| (store .cse0 |v_~#A~0.offset_31| 1)) |v_#pthreadsMutex_138|) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_7| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_139|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_138|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_7|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [541] L747-->L733-3: Formula: (and (= (store |v_#valid_50| |v_ULTIMATE.start_main_~#id~0#1.base_26| 0) |v_#valid_49|) (= (store |v_#pthreadsMutex_314| |v_~#C~0.base_69| (store (select |v_#pthreadsMutex_314| |v_~#C~0.base_69|) |v_~#C~0.offset_69| 0)) |v_#pthreadsMutex_313|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_314|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_26|, ~#C~0.base=|v_~#C~0.base_69|, #valid=|v_#valid_50|, ~#C~0.offset=|v_~#C~0.offset_69|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_313|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_26|, ~#C~0.base=|v_~#C~0.base_69|, #valid=|v_#valid_49|, ~#C~0.offset=|v_~#C~0.offset_69|} AuxVars[] AssignedVars[#pthreadsMutex, #valid] [2022-12-13 12:29:26,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L714-1-->L715-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_139| |v_~#A~0.base_31|))) (and (= (select .cse0 |v_~#A~0.offset_31|) 0) (= (store |v_#pthreadsMutex_139| |v_~#A~0.base_31| (store .cse0 |v_~#A~0.offset_31| 1)) |v_#pthreadsMutex_138|) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_7| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_139|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_138|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_7|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [542] L747-->L732-2: Formula: (and (= |v_#valid_53| (store |v_#valid_54| |v_ULTIMATE.start_main_~#id~0#1.base_29| 0)) (= |v_#pthreadsMutex_317| (store |v_#pthreadsMutex_318| |v_~#C~0.base_71| (store (select |v_#pthreadsMutex_318| |v_~#C~0.base_71|) |v_~#C~0.offset_71| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_318|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_29|, ~#C~0.base=|v_~#C~0.base_71|, #valid=|v_#valid_54|, ~#C~0.offset=|v_~#C~0.offset_71|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_317|, ~#C~0.base=|v_~#C~0.base_71|, #valid=|v_#valid_53|, ~#C~0.offset=|v_~#C~0.offset_71|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_20|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_~#id~0#1.base, #valid, ULTIMATE.start_main_~#id~0#1.offset] [2022-12-13 12:29:26,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L714-1-->L715-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_139| |v_~#A~0.base_31|))) (and (= (select .cse0 |v_~#A~0.offset_31|) 0) (= (store |v_#pthreadsMutex_139| |v_~#A~0.base_31| (store .cse0 |v_~#A~0.offset_31| 1)) |v_#pthreadsMutex_138|) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_7| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_139|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_138|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_7|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [540] L747-->main_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_main_#res#1_8| 0) (= (store |v_#pthreadsMutex_310| |v_~#C~0.base_67| (store (select |v_#pthreadsMutex_310| |v_~#C~0.base_67|) |v_~#C~0.offset_67| 0)) |v_#pthreadsMutex_309|) (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#id~0#1.base_23| 0) |v_#valid_45|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_310|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_23|, ~#C~0.base=|v_~#C~0.base_67|, #valid=|v_#valid_46|, ~#C~0.offset=|v_~#C~0.offset_67|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_309|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_8|, ~#C~0.base=|v_~#C~0.base_67|, #valid=|v_#valid_45|, ~#C~0.offset=|v_~#C~0.offset_67|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#res#1, #valid, ULTIMATE.start_main_~#id~0#1.offset] [2022-12-13 12:29:26,835 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L714-1-->L715-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_139| |v_~#A~0.base_31|))) (and (= (select .cse0 |v_~#A~0.offset_31|) 0) (= (store |v_#pthreadsMutex_139| |v_~#A~0.base_31| (store .cse0 |v_~#A~0.offset_31| 1)) |v_#pthreadsMutex_138|) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_7| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_139|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_138|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_7|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [254] L744-->L745: Formula: (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#B~0.base_8| (store (select |v_#pthreadsMutex_12| |v_~#B~0.base_8|) |v_~#B~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 12:29:27,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] L714-1-->L732-2: Formula: (let ((.cse1 (select |v_#pthreadsMutex_2415| |v_~#A~0.base_484|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet5#1_283| 0) (= (let ((.cse0 (store |v_#pthreadsMutex_2415| |v_~#A~0.base_484| (store .cse1 |v_~#A~0.offset_466| 1)))) (store .cse0 |v_~#C~0.base_465| (store (select .cse0 |v_~#C~0.base_465|) |v_~#C~0.offset_455| 0))) |v_#pthreadsMutex_2413|) (= (select .cse1 |v_~#A~0.offset_466|) 0) (= (store |v_#valid_396| |v_ULTIMATE.start_main_~#id~0#1.base_315| 0) |v_#valid_395|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2415|, ~#A~0.offset=|v_~#A~0.offset_466|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_315|, ~#C~0.base=|v_~#C~0.base_465|, #valid=|v_#valid_396|, ~#C~0.offset=|v_~#C~0.offset_455|, ~#A~0.base=|v_~#A~0.base_484|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2413|, ~#A~0.offset=|v_~#A~0.offset_466|, ~#C~0.base=|v_~#C~0.base_465|, #valid=|v_#valid_395|, ~#C~0.offset=|v_~#C~0.offset_455|, ~#A~0.base=|v_~#A~0.base_484|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_157|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_212|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_283|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_~#id~0#1.base, #valid, ULTIMATE.start_main_~#id~0#1.offset, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [728] L715-1-->L21: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2368| |v_~#B~0.base_422|))) (and (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| 31) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|) (= v_~g~0_349 |v_t_funThread1of1ForFork0_~x~0#1_713|) (= (select .cse0 |v_~#B~0.offset_415|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| 0)) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_~x~0#1_713|) (= |v_#pthreadsMutex_2367| (store |v_#pthreadsMutex_2368| |v_~#B~0.base_422| (store .cse0 |v_~#B~0.offset_415| 0))) (= |v_t_funThread1of1ForFork0_~y~0#1_426| v_~h~0_193) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_426| |v_t_funThread1of1ForFork0_~x~0#1_713|) 1 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211| (ite (or (<= 0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_225| |v_t_funThread1of1ForFork0_plus_~b#1_227| 2147483648)) (<= 0 |v_t_funThread1of1ForFork0_plus_~b#1_227|)) 1 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| |v_t_funThread1of1ForFork0_plus_~b#1_227|) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_plus_~a#1_225|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2368|, ~#B~0.base=|v_~#B~0.base_422|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, ~#B~0.offset=|v_~#B~0.offset_415|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_331|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_225|, #pthreadsMutex=|v_#pthreadsMutex_2367|, ~#B~0.base=|v_~#B~0.base_422|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_713|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_426|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_169|, ~#B~0.offset=|v_~#B~0.offset_415|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_247|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_227|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_173|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_271|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_plus_~a#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_plus_~b#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~nondet5#1] [2022-12-13 12:29:27,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] L714-1-->main_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2421| |v_~#A~0.base_486|))) (and (= |v_#valid_399| (store |v_#valid_400| |v_ULTIMATE.start_main_~#id~0#1.base_319| 0)) (= (select .cse0 |v_~#A~0.offset_468|) 0) (= |v_ULTIMATE.start_main_#res#1_116| 0) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_285| 0) (= |v_#pthreadsMutex_2419| (let ((.cse1 (store |v_#pthreadsMutex_2421| |v_~#A~0.base_486| (store .cse0 |v_~#A~0.offset_468| 1)))) (store .cse1 |v_~#C~0.base_467| (store (select .cse1 |v_~#C~0.base_467|) |v_~#C~0.offset_457| 0)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2421|, ~#A~0.offset=|v_~#A~0.offset_468|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_319|, ~#C~0.base=|v_~#C~0.base_467|, #valid=|v_#valid_400|, ~#C~0.offset=|v_~#C~0.offset_457|, ~#A~0.base=|v_~#A~0.base_486|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2419|, ~#A~0.offset=|v_~#A~0.offset_468|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_116|, ~#C~0.base=|v_~#C~0.base_467|, #valid=|v_#valid_399|, ~#C~0.offset=|v_~#C~0.offset_457|, ~#A~0.base=|v_~#A~0.base_486|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_159|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_214|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_285|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#res#1, #valid, ULTIMATE.start_main_~#id~0#1.offset, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [728] L715-1-->L21: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2368| |v_~#B~0.base_422|))) (and (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| 31) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|) (= v_~g~0_349 |v_t_funThread1of1ForFork0_~x~0#1_713|) (= (select .cse0 |v_~#B~0.offset_415|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| 0)) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_~x~0#1_713|) (= |v_#pthreadsMutex_2367| (store |v_#pthreadsMutex_2368| |v_~#B~0.base_422| (store .cse0 |v_~#B~0.offset_415| 0))) (= |v_t_funThread1of1ForFork0_~y~0#1_426| v_~h~0_193) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_426| |v_t_funThread1of1ForFork0_~x~0#1_713|) 1 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211| (ite (or (<= 0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_225| |v_t_funThread1of1ForFork0_plus_~b#1_227| 2147483648)) (<= 0 |v_t_funThread1of1ForFork0_plus_~b#1_227|)) 1 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| |v_t_funThread1of1ForFork0_plus_~b#1_227|) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_plus_~a#1_225|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2368|, ~#B~0.base=|v_~#B~0.base_422|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, ~#B~0.offset=|v_~#B~0.offset_415|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_331|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_225|, #pthreadsMutex=|v_#pthreadsMutex_2367|, ~#B~0.base=|v_~#B~0.base_422|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_713|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_426|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_169|, ~#B~0.offset=|v_~#B~0.offset_415|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_247|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_227|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_173|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_271|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_plus_~a#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_plus_~b#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~nondet5#1] [2022-12-13 12:29:27,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L714-1-->L745: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2427| |v_~#A~0.base_488|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet5#1_287| 0) (= (select .cse0 |v_~#A~0.offset_470|) 0) (= (let ((.cse1 (store |v_#pthreadsMutex_2427| |v_~#A~0.base_488| (store .cse0 |v_~#A~0.offset_470| 1)))) (store .cse1 |v_~#B~0.base_432| (store (select .cse1 |v_~#B~0.base_432|) |v_~#B~0.offset_424| 0))) |v_#pthreadsMutex_2425|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2427|, ~#B~0.base=|v_~#B~0.base_432|, ~#A~0.offset=|v_~#A~0.offset_470|, ~#A~0.base=|v_~#A~0.base_488|, ~#B~0.offset=|v_~#B~0.offset_424|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2425|, ~#B~0.base=|v_~#B~0.base_432|, ~#A~0.offset=|v_~#A~0.offset_470|, ~#A~0.base=|v_~#A~0.base_488|, ~#B~0.offset=|v_~#B~0.offset_424|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_216|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_287|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [728] L715-1-->L21: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2368| |v_~#B~0.base_422|))) (and (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| 31) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|) (= v_~g~0_349 |v_t_funThread1of1ForFork0_~x~0#1_713|) (= (select .cse0 |v_~#B~0.offset_415|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| 0)) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_~x~0#1_713|) (= |v_#pthreadsMutex_2367| (store |v_#pthreadsMutex_2368| |v_~#B~0.base_422| (store .cse0 |v_~#B~0.offset_415| 0))) (= |v_t_funThread1of1ForFork0_~y~0#1_426| v_~h~0_193) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_426| |v_t_funThread1of1ForFork0_~x~0#1_713|) 1 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211| (ite (or (<= 0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_225| |v_t_funThread1of1ForFork0_plus_~b#1_227| 2147483648)) (<= 0 |v_t_funThread1of1ForFork0_plus_~b#1_227|)) 1 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| |v_t_funThread1of1ForFork0_plus_~b#1_227|) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_plus_~a#1_225|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2368|, ~#B~0.base=|v_~#B~0.base_422|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, ~#B~0.offset=|v_~#B~0.offset_415|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_331|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_225|, #pthreadsMutex=|v_#pthreadsMutex_2367|, ~#B~0.base=|v_~#B~0.base_422|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_713|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_426|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_169|, ~#B~0.offset=|v_~#B~0.offset_415|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_247|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_227|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_173|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_271|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_plus_~a#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_plus_~b#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~nondet5#1] [2022-12-13 12:29:27,544 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [730] L714-1-->L733-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2391| |v_~#A~0.base_476|))) (and (= (select .cse0 |v_~#A~0.offset_458|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_275| 0) (= |v_#pthreadsMutex_2389| (let ((.cse1 (store |v_#pthreadsMutex_2391| |v_~#A~0.base_476| (store .cse0 |v_~#A~0.offset_458| 1)))) (store .cse1 |v_~#C~0.base_457| (store (select .cse1 |v_~#C~0.base_457|) |v_~#C~0.offset_447| 0)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2391|, ~#A~0.offset=|v_~#A~0.offset_458|, ~#C~0.base=|v_~#C~0.base_457|, ~#C~0.offset=|v_~#C~0.offset_447|, ~#A~0.base=|v_~#A~0.base_476|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2389|, ~#A~0.offset=|v_~#A~0.offset_458|, ~#C~0.base=|v_~#C~0.base_457|, ~#C~0.offset=|v_~#C~0.offset_447|, ~#A~0.base=|v_~#A~0.base_476|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_204|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_275|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [728] L715-1-->L21: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2368| |v_~#B~0.base_422|))) (and (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| 31) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|) (= v_~g~0_349 |v_t_funThread1of1ForFork0_~x~0#1_713|) (= (select .cse0 |v_~#B~0.offset_415|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| 0)) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_~x~0#1_713|) (= |v_#pthreadsMutex_2367| (store |v_#pthreadsMutex_2368| |v_~#B~0.base_422| (store .cse0 |v_~#B~0.offset_415| 0))) (= |v_t_funThread1of1ForFork0_~y~0#1_426| v_~h~0_193) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_426| |v_t_funThread1of1ForFork0_~x~0#1_713|) 1 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211| (ite (or (<= 0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_225| |v_t_funThread1of1ForFork0_plus_~b#1_227| 2147483648)) (<= 0 |v_t_funThread1of1ForFork0_plus_~b#1_227|)) 1 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| |v_t_funThread1of1ForFork0_plus_~b#1_227|) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_plus_~a#1_225|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2368|, ~#B~0.base=|v_~#B~0.base_422|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, ~#B~0.offset=|v_~#B~0.offset_415|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_331|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_225|, #pthreadsMutex=|v_#pthreadsMutex_2367|, ~#B~0.base=|v_~#B~0.base_422|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_713|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_426|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_169|, ~#B~0.offset=|v_~#B~0.offset_415|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_247|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_227|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_173|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_271|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_plus_~a#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_plus_~b#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~nondet5#1] [2022-12-13 12:29:27,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [731] L714-1-->ULTIMATE.startFINAL: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2397| |v_~#A~0.base_478|))) (and (= (select .cse0 |v_~#A~0.offset_460|) 0) (= |v_#pthreadsMutex_2395| (let ((.cse1 (store |v_#pthreadsMutex_2397| |v_~#A~0.base_478| (store .cse0 |v_~#A~0.offset_460| 1)))) (store .cse1 |v_~#C~0.base_459| (store (select .cse1 |v_~#C~0.base_459|) |v_~#C~0.offset_449| 0)))) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_277| 0) (= |v_#valid_383| (store |v_#valid_384| |v_ULTIMATE.start_main_~#id~0#1.base_305| 0)) (= |v_ULTIMATE.start_#t~ret16#1_61| |v_ULTIMATE.start_main_#res#1_112|) (= |v_ULTIMATE.start_main_#res#1_112| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2397|, ~#A~0.offset=|v_~#A~0.offset_460|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_305|, ~#C~0.base=|v_~#C~0.base_459|, #valid=|v_#valid_384|, ~#C~0.offset=|v_~#C~0.offset_449|, ~#A~0.base=|v_~#A~0.base_478|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2395|, ~#A~0.offset=|v_~#A~0.offset_460|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_112|, ~#C~0.base=|v_~#C~0.base_459|, #valid=|v_#valid_383|, ~#C~0.offset=|v_~#C~0.offset_449|, ~#A~0.base=|v_~#A~0.base_478|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_153|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_61|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_206|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_277|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#res#1, #valid, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_#t~ret16#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [728] L715-1-->L21: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2368| |v_~#B~0.base_422|))) (and (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| 31) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|) (= v_~g~0_349 |v_t_funThread1of1ForFork0_~x~0#1_713|) (= (select .cse0 |v_~#B~0.offset_415|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| 0)) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_~x~0#1_713|) (= |v_#pthreadsMutex_2367| (store |v_#pthreadsMutex_2368| |v_~#B~0.base_422| (store .cse0 |v_~#B~0.offset_415| 0))) (= |v_t_funThread1of1ForFork0_~y~0#1_426| v_~h~0_193) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_426| |v_t_funThread1of1ForFork0_~x~0#1_713|) 1 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211| (ite (or (<= 0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_225| |v_t_funThread1of1ForFork0_plus_~b#1_227| 2147483648)) (<= 0 |v_t_funThread1of1ForFork0_plus_~b#1_227|)) 1 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| |v_t_funThread1of1ForFork0_plus_~b#1_227|) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_plus_~a#1_225|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2368|, ~#B~0.base=|v_~#B~0.base_422|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, ~#B~0.offset=|v_~#B~0.offset_415|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_331|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_225|, #pthreadsMutex=|v_#pthreadsMutex_2367|, ~#B~0.base=|v_~#B~0.base_422|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_713|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_426|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_169|, ~#B~0.offset=|v_~#B~0.offset_415|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_247|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_227|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_173|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_271|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_plus_~a#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_plus_~b#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~nondet5#1] [2022-12-13 12:29:27,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [732] L714-1-->ULTIMATE.startEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2403| |v_~#A~0.base_480|))) (and (= |v_ULTIMATE.start_main_#res#1_114| 0) (= (select .cse0 |v_~#A~0.offset_462|) 0) (= (store |v_#valid_388| |v_ULTIMATE.start_main_~#id~0#1.base_309| 0) |v_#valid_387|) (= |v_#pthreadsMutex_2401| (let ((.cse1 (store |v_#pthreadsMutex_2403| |v_~#A~0.base_480| (store .cse0 |v_~#A~0.offset_462| 1)))) (store .cse1 |v_~#C~0.base_461| (store (select .cse1 |v_~#C~0.base_461|) |v_~#C~0.offset_451| 0)))) (= |v_ULTIMATE.start_#t~ret16#1_63| |v_ULTIMATE.start_main_#res#1_114|) (= |v_t_funThread1of1ForFork0_#t~nondet5#1_279| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2403|, ~#A~0.offset=|v_~#A~0.offset_462|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_309|, ~#C~0.base=|v_~#C~0.base_461|, #valid=|v_#valid_388|, ~#C~0.offset=|v_~#C~0.offset_451|, ~#A~0.base=|v_~#A~0.base_480|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2401|, ~#A~0.offset=|v_~#A~0.offset_462|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_114|, ~#C~0.base=|v_~#C~0.base_461|, #valid=|v_#valid_387|, ~#C~0.offset=|v_~#C~0.offset_451|, ~#A~0.base=|v_~#A~0.base_480|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_155|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_63|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_208|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_279|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#res#1, #valid, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_#t~ret16#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [728] L715-1-->L21: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2368| |v_~#B~0.base_422|))) (and (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| 31) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|) (= v_~g~0_349 |v_t_funThread1of1ForFork0_~x~0#1_713|) (= (select .cse0 |v_~#B~0.offset_415|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| 0)) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_~x~0#1_713|) (= |v_#pthreadsMutex_2367| (store |v_#pthreadsMutex_2368| |v_~#B~0.base_422| (store .cse0 |v_~#B~0.offset_415| 0))) (= |v_t_funThread1of1ForFork0_~y~0#1_426| v_~h~0_193) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_426| |v_t_funThread1of1ForFork0_~x~0#1_713|) 1 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211| (ite (or (<= 0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_225| |v_t_funThread1of1ForFork0_plus_~b#1_227| 2147483648)) (<= 0 |v_t_funThread1of1ForFork0_plus_~b#1_227|)) 1 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| |v_t_funThread1of1ForFork0_plus_~b#1_227|) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_plus_~a#1_225|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2368|, ~#B~0.base=|v_~#B~0.base_422|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, ~#B~0.offset=|v_~#B~0.offset_415|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_331|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_225|, #pthreadsMutex=|v_#pthreadsMutex_2367|, ~#B~0.base=|v_~#B~0.base_422|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_713|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_426|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_169|, ~#B~0.offset=|v_~#B~0.offset_415|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_247|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_227|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_173|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_271|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_plus_~a#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_plus_~b#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~nondet5#1] [2022-12-13 12:29:27,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] L714-1-->L733-3: Formula: (let ((.cse1 (select |v_#pthreadsMutex_2409| |v_~#A~0.base_482|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet5#1_281| 0) (= (let ((.cse0 (store |v_#pthreadsMutex_2409| |v_~#A~0.base_482| (store .cse1 |v_~#A~0.offset_464| 1)))) (store .cse0 |v_~#C~0.base_463| (store (select .cse0 |v_~#C~0.base_463|) |v_~#C~0.offset_453| 0))) |v_#pthreadsMutex_2407|) (= (select .cse1 |v_~#A~0.offset_464|) 0) (= (store |v_#valid_392| |v_ULTIMATE.start_main_~#id~0#1.base_312| 0) |v_#valid_391|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2409|, ~#A~0.offset=|v_~#A~0.offset_464|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_312|, ~#C~0.base=|v_~#C~0.base_463|, #valid=|v_#valid_392|, ~#C~0.offset=|v_~#C~0.offset_453|, ~#A~0.base=|v_~#A~0.base_482|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2407|, ~#A~0.offset=|v_~#A~0.offset_464|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_312|, ~#C~0.base=|v_~#C~0.base_463|, #valid=|v_#valid_391|, ~#C~0.offset=|v_~#C~0.offset_453|, ~#A~0.base=|v_~#A~0.base_482|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_210|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_281|} AuxVars[] AssignedVars[#pthreadsMutex, #valid, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet5#1] and [728] L715-1-->L21: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2368| |v_~#B~0.base_422|))) (and (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| 31) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|) (= v_~g~0_349 |v_t_funThread1of1ForFork0_~x~0#1_713|) (= (select .cse0 |v_~#B~0.offset_415|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804| 0)) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_~x~0#1_713|) (= |v_#pthreadsMutex_2367| (store |v_#pthreadsMutex_2368| |v_~#B~0.base_422| (store .cse0 |v_~#B~0.offset_415| 0))) (= |v_t_funThread1of1ForFork0_~y~0#1_426| v_~h~0_193) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_426| |v_t_funThread1of1ForFork0_~x~0#1_713|) 1 0)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211| (ite (or (<= 0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_225| |v_t_funThread1of1ForFork0_plus_~b#1_227| 2147483648)) (<= 0 |v_t_funThread1of1ForFork0_plus_~b#1_227|)) 1 0)) (= |v_t_funThread1of1ForFork0_plus_#in~b#1_173| |v_t_funThread1of1ForFork0_plus_~b#1_227|) (= |v_t_funThread1of1ForFork0_plus_#in~a#1_169| |v_t_funThread1of1ForFork0_plus_~a#1_225|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2368|, ~#B~0.base=|v_~#B~0.base_422|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, ~#B~0.offset=|v_~#B~0.offset_415|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_331|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_225|, #pthreadsMutex=|v_#pthreadsMutex_2367|, ~#B~0.base=|v_~#B~0.base_422|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_713|, ~h~0=v_~h~0_193, ~g~0=v_~g~0_349, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_426|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_169|, ~#B~0.offset=|v_~#B~0.offset_415|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_247|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_538|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_227|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_804|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_277|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_173|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_271|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_plus_~a#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_plus_~b#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~nondet5#1] [2022-12-13 12:29:28,068 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:29:28,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1830 [2022-12-13 12:29:28,069 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 204 flow [2022-12-13 12:29:28,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:29:28,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:28,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:28,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:29:28,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1521736195, now seen corresponding path program 1 times [2022-12-13 12:29:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:28,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240254143] [2022-12-13 12:29:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:28,140 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:29:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240254143] [2022-12-13 12:29:28,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240254143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:28,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:28,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:29:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54412481] [2022-12-13 12:29:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:28,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:29:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:28,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:29:28,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:29:28,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 12:29:28,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:29:28,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:28,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 12:29:28,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:28,207 INFO L130 PetriNetUnfolder]: 37/96 cut-off events. [2022-12-13 12:29:28,207 INFO L131 PetriNetUnfolder]: For 124/127 co-relation queries the response was YES. [2022-12-13 12:29:28,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 96 events. 37/96 cut-off events. For 124/127 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 368 event pairs, 12 based on Foata normal form. 8/65 useless extension candidates. Maximal degree in co-relation 338. Up to 65 conditions per place. [2022-12-13 12:29:28,207 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 10 selfloop transitions, 4 changer transitions 25/42 dead transitions. [2022-12-13 12:29:28,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 330 flow [2022-12-13 12:29:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:29:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:29:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 12:29:28,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 12:29:28,208 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 204 flow. Second operand 4 states and 52 transitions. [2022-12-13 12:29:28,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 330 flow [2022-12-13 12:29:28,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 296 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 12:29:28,209 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 79 flow [2022-12-13 12:29:28,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2022-12-13 12:29:28,209 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, -32 predicate places. [2022-12-13 12:29:28,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:29:28,210 INFO L89 Accepts]: Start accepts. Operand has 30 places, 17 transitions, 79 flow [2022-12-13 12:29:28,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:29:28,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:28,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 17 transitions, 79 flow [2022-12-13 12:29:28,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 17 transitions, 79 flow [2022-12-13 12:29:28,212 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-13 12:29:28,212 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-13 12:29:28,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 18 events. 1/18 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 26 event pairs, 0 based on Foata normal form. 1/14 useless extension candidates. Maximal degree in co-relation 41. Up to 8 conditions per place. [2022-12-13 12:29:28,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 17 transitions, 79 flow [2022-12-13 12:29:28,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 12:29:28,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] L745-->L747: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2233| |v_~#C~0.base_409|))) (and (= (store |v_#pthreadsMutex_2233| |v_~#C~0.base_409| (store .cse0 |v_~#C~0.offset_408| 1)) |v_#pthreadsMutex_2232|) (= 3 v_~i~0_228) (= 0 (select .cse0 |v_~#C~0.offset_408|)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2233|, ~#C~0.base=|v_~#C~0.base_409|, ~#C~0.offset=|v_~#C~0.offset_408|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2232|, ~i~0=v_~i~0_228, ~#C~0.base=|v_~#C~0.base_409|, ~#C~0.offset=|v_~#C~0.offset_408|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_108|} AuxVars[] AssignedVars[#pthreadsMutex, ~i~0, ULTIMATE.start_main_#t~nondet15#1] and [662] L21-->L723: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_101| |v_t_funThread1of1ForFork0_plus_~b#1_103|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59| |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_81|) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_82| 0)) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_95| 2147483648)) (= |v_t_funThread1of1ForFork0_plus_#res#1_95| .cse0) (<= |v_t_funThread1of1ForFork0_plus_#res#1_95| 2147483647) (= |v_t_funThread1of1ForFork0_plus_#res#1_95| v_~i~0_75) (= (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_103| 0)) 1 0) |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_101|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_103|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_82|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_95|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_101|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~i~0=v_~i~0_75, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_103|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_81|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_37|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] [2022-12-13 12:29:28,692 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:29:28,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 483 [2022-12-13 12:29:28,693 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 82 flow [2022-12-13 12:29:28,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:29:28,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:29:28,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:28,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:29:28,694 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 12:29:28,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash 60370695, now seen corresponding path program 1 times [2022-12-13 12:29:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:28,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614206151] [2022-12-13 12:29:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:28,813 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:29:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:28,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614206151] [2022-12-13 12:29:28,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614206151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:28,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:28,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:29:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994512604] [2022-12-13 12:29:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:28,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:29:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:29:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:29:28,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 12:29:28,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:29:28,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:29:28,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 12:29:28,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:29:28,832 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-13 12:29:28,832 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 12:29:28,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 12 events. 3/12 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 4/16 useless extension candidates. Maximal degree in co-relation 42. Up to 8 conditions per place. [2022-12-13 12:29:28,832 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2022-12-13 12:29:28,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 10 transitions, 69 flow [2022-12-13 12:29:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:29:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:29:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-12-13 12:29:28,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19117647058823528 [2022-12-13 12:29:28,833 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 82 flow. Second operand 4 states and 13 transitions. [2022-12-13 12:29:28,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 10 transitions, 69 flow [2022-12-13 12:29:28,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 10 transitions, 63 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 12:29:28,833 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2022-12-13 12:29:28,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2022-12-13 12:29:28,834 INFO L295 CegarLoopForPetriNet]: 62 programPoint places, -43 predicate places. [2022-12-13 12:29:28,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:29:28,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 0 transitions, 0 flow [2022-12-13 12:29:28,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:29:28,835 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:29:28,835 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:29:28,835 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:29:28,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:29:28,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:29:28,835 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:29:28,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 12:29:28,836 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:29:28,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:29:28,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-12-13 12:29:28,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 12:29:28,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-12-13 12:29:28,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-12-13 12:29:28,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-12-13 12:29:28,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-13 12:29:28,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 12:29:28,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:29:28,842 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:28,845 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:29:28,845 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:29:28,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:29:28 BasicIcfg [2022-12-13 12:29:28,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:29:28,847 INFO L158 Benchmark]: Toolchain (without parser) took 16207.46ms. Allocated memory was 232.8MB in the beginning and 502.3MB in the end (delta: 269.5MB). Free memory was 208.6MB in the beginning and 227.5MB in the end (delta: -18.9MB). Peak memory consumption was 252.2MB. Max. memory is 8.0GB. [2022-12-13 12:29:28,848 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 232.8MB. Free memory is still 209.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:29:28,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.96ms. Allocated memory is still 232.8MB. Free memory was 208.1MB in the beginning and 188.2MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 12:29:28,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.36ms. Allocated memory is still 232.8MB. Free memory was 188.2MB in the beginning and 186.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:29:28,848 INFO L158 Benchmark]: Boogie Preprocessor took 39.94ms. Allocated memory is still 232.8MB. Free memory was 186.1MB in the beginning and 184.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 12:29:28,848 INFO L158 Benchmark]: RCFGBuilder took 381.09ms. Allocated memory is still 232.8MB. Free memory was 184.5MB in the beginning and 167.2MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-13 12:29:28,848 INFO L158 Benchmark]: TraceAbstraction took 15340.91ms. Allocated memory was 232.8MB in the beginning and 502.3MB in the end (delta: 269.5MB). Free memory was 165.6MB in the beginning and 227.5MB in the end (delta: -61.9MB). Peak memory consumption was 209.2MB. Max. memory is 8.0GB. [2022-12-13 12:29:28,849 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.09ms. Allocated memory is still 232.8MB. Free memory is still 209.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.96ms. Allocated memory is still 232.8MB. Free memory was 208.1MB in the beginning and 188.2MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.36ms. Allocated memory is still 232.8MB. Free memory was 188.2MB in the beginning and 186.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.94ms. Allocated memory is still 232.8MB. Free memory was 186.1MB in the beginning and 184.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 381.09ms. Allocated memory is still 232.8MB. Free memory was 184.5MB in the beginning and 167.2MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 15340.91ms. Allocated memory was 232.8MB in the beginning and 502.3MB in the end (delta: 269.5MB). Free memory was 165.6MB in the beginning and 227.5MB in the end (delta: -61.9MB). Peak memory consumption was 209.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 156 PlacesBefore, 62 PlacesAfterwards, 160 TransitionsBefore, 61 TransitionsAfterwards, 6570 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 84 ConcurrentYvCompositions, 10 ChoiceCompositions, 149 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10876, independent: 10405, independent conditional: 10405, independent unconditional: 0, dependent: 471, dependent conditional: 471, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10876, independent: 10405, independent conditional: 0, independent unconditional: 10405, dependent: 471, dependent conditional: 0, dependent unconditional: 471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10876, independent: 10405, independent conditional: 0, independent unconditional: 10405, dependent: 471, dependent conditional: 0, dependent unconditional: 471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10876, independent: 10405, independent conditional: 0, independent unconditional: 10405, dependent: 471, dependent conditional: 0, dependent unconditional: 471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5885, independent: 5783, independent conditional: 0, independent unconditional: 5783, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5885, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 296, dependent conditional: 0, dependent unconditional: 296, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 296, independent: 194, independent conditional: 0, independent unconditional: 194, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 286, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10876, independent: 4622, independent conditional: 0, independent unconditional: 4622, dependent: 369, dependent conditional: 0, dependent unconditional: 369, unknown: 5885, unknown conditional: 0, unknown unconditional: 5885] , Statistics on independence cache: Total cache size (in pairs): 17365, Positive cache size: 17263, Positive conditional cache size: 0, Positive unconditional cache size: 17263, Negative cache size: 102, Negative conditional cache size: 0, Negative unconditional cache size: 102, 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, 57 PlacesBefore, 57 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1458, independent: 1269, independent conditional: 1269, independent unconditional: 0, dependent: 189, dependent conditional: 189, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1458, independent: 1269, independent conditional: 0, independent unconditional: 1269, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1458, independent: 1269, independent conditional: 0, independent unconditional: 1269, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1458, independent: 1269, independent conditional: 0, independent unconditional: 1269, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 497, independent: 437, independent conditional: 0, independent unconditional: 437, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 497, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1458, independent: 832, independent conditional: 0, independent unconditional: 832, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 497, unknown conditional: 0, unknown unconditional: 497] , Statistics on independence cache: Total cache size (in pairs): 523, Positive cache size: 463, Positive conditional cache size: 0, Positive unconditional cache size: 463, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 558, independent: 472, independent conditional: 472, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 558, independent: 472, independent conditional: 73, independent unconditional: 399, dependent: 86, dependent conditional: 2, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 558, independent: 472, independent conditional: 73, independent unconditional: 399, dependent: 86, dependent conditional: 2, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 558, independent: 472, independent conditional: 73, independent unconditional: 399, dependent: 86, dependent conditional: 2, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 27, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 558, independent: 412, independent conditional: 73, independent unconditional: 339, dependent: 67, dependent conditional: 1, dependent unconditional: 66, unknown: 79, unknown conditional: 1, unknown unconditional: 78] , Statistics on independence cache: Total cache size (in pairs): 602, Positive cache size: 523, Positive conditional cache size: 0, Positive unconditional cache size: 523, Negative cache size: 79, Negative conditional cache size: 1, Negative unconditional cache size: 78, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 73 PlacesBefore, 72 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 680 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1137, independent: 899, independent conditional: 899, independent unconditional: 0, dependent: 238, dependent conditional: 238, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1137, independent: 899, independent conditional: 233, independent unconditional: 666, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1137, independent: 899, independent conditional: 217, independent unconditional: 682, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1137, independent: 899, independent conditional: 217, independent unconditional: 682, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 40, independent conditional: 6, independent unconditional: 34, 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: 42, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1137, independent: 859, independent conditional: 211, independent unconditional: 648, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 42, unknown conditional: 6, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 660, Positive cache size: 579, Positive conditional cache size: 6, Positive unconditional cache size: 573, Negative cache size: 81, Negative conditional cache size: 1, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 67 PlacesBefore, 62 PlacesAfterwards, 66 TransitionsBefore, 61 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 366, independent: 278, independent conditional: 278, independent unconditional: 0, dependent: 88, dependent conditional: 88, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 366, independent: 278, independent conditional: 46, independent unconditional: 232, dependent: 88, dependent conditional: 10, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 366, independent: 278, independent conditional: 46, independent unconditional: 232, dependent: 88, dependent conditional: 10, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 366, independent: 278, independent conditional: 46, independent unconditional: 232, dependent: 88, dependent conditional: 10, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 9, independent unconditional: 14, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 366, independent: 255, independent conditional: 37, independent unconditional: 218, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 29, unknown conditional: 12, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 790, Positive cache size: 703, Positive conditional cache size: 15, Positive unconditional cache size: 688, Negative cache size: 87, Negative conditional cache size: 4, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 67 PlacesBefore, 67 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 187, independent: 169, independent conditional: 69, independent unconditional: 100, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191, independent: 169, independent conditional: 63, independent unconditional: 106, dependent: 22, dependent conditional: 14, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191, independent: 169, independent conditional: 63, independent unconditional: 106, dependent: 22, dependent conditional: 14, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 33, independent conditional: 25, independent unconditional: 8, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 191, independent: 136, independent conditional: 38, independent unconditional: 98, dependent: 20, dependent conditional: 12, dependent unconditional: 8, unknown: 35, unknown conditional: 27, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 825, Positive cache size: 736, Positive conditional cache size: 40, Positive unconditional cache size: 696, Negative cache size: 89, Negative conditional cache size: 6, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 67 PlacesBefore, 68 PlacesAfterwards, 58 TransitionsBefore, 60 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 116, independent conditional: 22, independent unconditional: 94, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 116, independent conditional: 8, independent unconditional: 108, dependent: 36, dependent conditional: 18, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 116, independent conditional: 8, independent unconditional: 108, dependent: 36, dependent conditional: 18, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 114, independent conditional: 8, independent unconditional: 106, dependent: 35, dependent conditional: 17, dependent unconditional: 18, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 837, Positive cache size: 747, Positive conditional cache size: 40, Positive unconditional cache size: 707, Negative cache size: 90, Negative conditional cache size: 7, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 55 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 37 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 67, independent conditional: 19, independent unconditional: 48, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 67, independent conditional: 8, independent unconditional: 59, dependent: 44, dependent conditional: 25, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 67, independent conditional: 8, independent unconditional: 59, dependent: 44, dependent conditional: 25, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 8, dependent conditional: 5, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 65, independent conditional: 7, independent unconditional: 58, dependent: 40, dependent conditional: 22, dependent unconditional: 18, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 754, Positive conditional cache size: 41, Positive unconditional cache size: 713, Negative cache size: 94, Negative conditional cache size: 10, Negative unconditional cache size: 84, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 22, independent conditional: 4, independent unconditional: 18, dependent: 11, dependent conditional: 8, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 849, Positive cache size: 754, Positive conditional cache size: 41, Positive unconditional cache size: 713, Negative cache size: 95, Negative conditional cache size: 11, Negative unconditional cache size: 84, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 44 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 32 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 163, independent: 144, independent conditional: 90, independent unconditional: 54, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 144, independent conditional: 90, independent unconditional: 54, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 144, independent conditional: 90, independent unconditional: 54, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 8, independent unconditional: 6, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 130, independent conditional: 82, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 18, unknown conditional: 9, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 912, Positive conditional cache size: 49, Positive unconditional cache size: 863, Negative cache size: 99, Negative conditional cache size: 12, Negative unconditional cache size: 87, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 33 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 30 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 228, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 228, independent: 154, independent conditional: 98, independent unconditional: 56, dependent: 74, dependent conditional: 2, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 230, independent: 154, independent conditional: 98, independent unconditional: 56, dependent: 76, dependent conditional: 2, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 154, independent conditional: 98, independent unconditional: 56, dependent: 76, dependent conditional: 2, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 8, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 150, independent conditional: 94, independent unconditional: 56, dependent: 74, dependent conditional: 1, dependent unconditional: 73, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1041, Positive cache size: 940, Positive conditional cache size: 53, Positive unconditional cache size: 887, Negative cache size: 101, Negative conditional cache size: 13, Negative unconditional cache size: 88, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 29 PlacesBefore, 29 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1046, Positive cache size: 945, Positive conditional cache size: 54, Positive unconditional cache size: 891, Negative cache size: 101, Negative conditional cache size: 13, Negative unconditional cache size: 88, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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): 1046, Positive cache size: 945, Positive conditional cache size: 54, Positive unconditional cache size: 891, Negative cache size: 101, Negative conditional cache size: 13, Negative unconditional cache size: 88, 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 - 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, 223 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1449 IncrementalHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 19 mSDtfsCounter, 1449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=642occurred in iteration=3, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 12:29:28,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...