/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:15:36,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:15:36,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:15:36,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:15:36,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:15:36,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:15:36,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:15:36,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:15:36,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:15:36,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:15:36,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:15:36,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:15:36,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:15:36,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:15:36,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:15:36,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:15:36,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:15:36,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:15:36,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:15:36,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:15:36,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:15:36,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:15:36,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:15:36,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:15:36,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:15:36,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:15:36,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:15:36,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:15:36,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:15:36,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:15:36,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:15:36,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:15:36,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:15:36,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:15:36,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:15:36,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:15:36,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:15:36,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:15:36,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:15:36,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:15:36,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:15:36,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:15:36,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:15:36,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:15:36,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:15:36,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:15:36,505 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:15:36,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:15:36,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:15:36,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:15:36,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:15:36,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:15:36,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:15:36,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:15:36,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:15:36,507 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:15:36,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:15:36,508 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:15:36,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:15:36,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:15:36,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:15:36,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:15:36,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:15:36,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:36,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:15:36,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:15:36,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:15:36,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:15:36,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:15:36,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:15:36,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:15:37,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:15:37,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:15:37,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:15:37,057 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:15:37,057 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:15:37,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-06 06:15:38,899 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:15:39,367 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:15:39,368 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-06 06:15:39,382 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbc82f03/0b20c205c9d24c42a736aa268dfc9faf/FLAGc1fd95597 [2022-12-06 06:15:39,398 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbc82f03/0b20c205c9d24c42a736aa268dfc9faf [2022-12-06 06:15:39,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:15:39,401 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:15:39,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:39,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:15:39,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:15:39,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:39" (1/1) ... [2022-12-06 06:15:39,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa8742b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:39, skipping insertion in model container [2022-12-06 06:15:39,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:39" (1/1) ... [2022-12-06 06:15:39,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:15:39,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:15:39,888 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-12-06 06:15:39,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:39,935 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:15:39,975 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-12-06 06:15:39,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:40,049 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:15:40,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40 WrapperNode [2022-12-06 06:15:40,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:40,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:40,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:15:40,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:15:40,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,138 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-06 06:15:40,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:40,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:15:40,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:15:40,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:15:40,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,185 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:15:40,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:15:40,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:15:40,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:15:40,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (1/1) ... [2022-12-06 06:15:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:40,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:40,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:15:40,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:15:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:15:40,305 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:15:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:15:40,306 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:15:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:15:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:15:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:15:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:15:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:15:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:15:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:15:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:15:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:15:40,309 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:15:40,499 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:15:40,501 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:15:40,747 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:15:40,755 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:15:40,755 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 06:15:40,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:40 BoogieIcfgContainer [2022-12-06 06:15:40,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:15:40,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:15:40,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:15:40,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:15:40,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:15:39" (1/3) ... [2022-12-06 06:15:40,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6653f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:40, skipping insertion in model container [2022-12-06 06:15:40,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:40" (2/3) ... [2022-12-06 06:15:40,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6653f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:40, skipping insertion in model container [2022-12-06 06:15:40,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:40" (3/3) ... [2022-12-06 06:15:40,763 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-12-06 06:15:40,780 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:15:40,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:15:40,780 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:15:40,863 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:15:40,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-06 06:15:41,031 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-06 06:15:41,032 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:15:41,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-06 06:15:41,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-06 06:15:41,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-06 06:15:41,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:41,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-06 06:15:41,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-06 06:15:41,145 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-06 06:15:41,146 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:41,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 139 events. 10/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-06 06:15:41,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-06 06:15:41,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-06 06:15:45,331 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-06 06:15:45,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:15:45,349 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;@63626c80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:15:45,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:15:45,353 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 06:15:45,353 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:45,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:45,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:15:45,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:45,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash 973860878, now seen corresponding path program 1 times [2022-12-06 06:15:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:45,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317891468] [2022-12-06 06:15:45,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:45,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:45,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317891468] [2022-12-06 06:15:45,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317891468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:45,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:45,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:45,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537996928] [2022-12-06 06:15:45,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:45,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:45,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:45,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 06:15:45,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:45,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:45,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 06:15:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:45,929 INFO L130 PetriNetUnfolder]: 828/1410 cut-off events. [2022-12-06 06:15:45,929 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 06:15:45,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1410 events. 828/1410 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5969 event pairs, 371 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 2635. Up to 880 conditions per place. [2022-12-06 06:15:45,944 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-06 06:15:45,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 253 flow [2022-12-06 06:15:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 06:15:45,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-06 06:15:45,959 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 89 flow. Second operand 3 states and 73 transitions. [2022-12-06 06:15:45,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 253 flow [2022-12-06 06:15:45,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:15:45,964 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:45,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-06 06:15:45,968 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 06:15:45,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:45,969 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:45,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:45,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:45,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:45,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:45,979 INFO L130 PetriNetUnfolder]: 9/67 cut-off events. [2022-12-06 06:15:45,979 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:15:45,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 67 events. 9/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 74. Up to 9 conditions per place. [2022-12-06 06:15:45,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:45,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 06:15:46,019 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:46,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 06:15:46,025 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:46,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:46,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:46,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:46,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:15:46,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1325177997, now seen corresponding path program 1 times [2022-12-06 06:15:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:46,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303325215] [2022-12-06 06:15:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:46,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:46,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303325215] [2022-12-06 06:15:46,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303325215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:46,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:46,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895260310] [2022-12-06 06:15:46,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:46,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:46,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:46,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:46,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-06 06:15:46,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:46,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:46,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-06 06:15:46,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:46,282 INFO L130 PetriNetUnfolder]: 686/1260 cut-off events. [2022-12-06 06:15:46,282 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 06:15:46,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 1260 events. 686/1260 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6454 event pairs, 313 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 2130. Up to 1025 conditions per place. [2022-12-06 06:15:46,289 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-06 06:15:46,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 242 flow [2022-12-06 06:15:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 06:15:46,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-06 06:15:46,291 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 3 states and 69 transitions. [2022-12-06 06:15:46,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 242 flow [2022-12-06 06:15:46,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:46,293 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:46,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-06 06:15:46,294 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 06:15:46,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:46,294 INFO L89 Accepts]: Start accepts. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:46,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:46,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:46,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:46,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:46,303 INFO L130 PetriNetUnfolder]: 12/93 cut-off events. [2022-12-06 06:15:46,303 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:15:46,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 93 events. 12/93 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 262 event pairs, 1 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 109. Up to 11 conditions per place. [2022-12-06 06:15:46,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:46,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 06:15:46,315 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:46,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:15:46,317 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:46,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:46,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:46,317 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:46,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:15:46,317 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 963601012, now seen corresponding path program 1 times [2022-12-06 06:15:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:46,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550574632] [2022-12-06 06:15:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:46,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550574632] [2022-12-06 06:15:46,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550574632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:46,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101258175] [2022-12-06 06:15:46,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:46,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:46,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:46,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:46,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 06:15:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:46,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 06:15:46,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:46,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:46,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101258175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:46,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:46,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 06:15:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665453851] [2022-12-06 06:15:46,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:46,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 06:15:46,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:46,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 06:15:46,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 06:15:46,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-06 06:15:46,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 109 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:46,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:46,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-06 06:15:46,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:47,305 INFO L130 PetriNetUnfolder]: 2004/3438 cut-off events. [2022-12-06 06:15:47,306 INFO L131 PetriNetUnfolder]: For 880/880 co-relation queries the response was YES. [2022-12-06 06:15:47,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 3438 events. 2004/3438 cut-off events. For 880/880 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17981 event pairs, 302 based on Foata normal form. 88/2886 useless extension candidates. Maximal degree in co-relation 6886. Up to 999 conditions per place. [2022-12-06 06:15:47,355 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 166 selfloop transitions, 26 changer transitions 5/200 dead transitions. [2022-12-06 06:15:47,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 913 flow [2022-12-06 06:15:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:15:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:15:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2022-12-06 06:15:47,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-06 06:15:47,358 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 12 states and 236 transitions. [2022-12-06 06:15:47,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 200 transitions, 913 flow [2022-12-06 06:15:47,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 200 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:47,365 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:47,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2022-12-06 06:15:47,366 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-06 06:15:47,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:47,366 INFO L89 Accepts]: Start accepts. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:47,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:47,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:47,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:47,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:47,388 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][22], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 114#L996-2true, Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 166#true, 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 215#(not (<= 800 ~top~0)), 174#(<= ~top~0 0), t2Thread1of1ForFork0InUse, 135#L1008-1true, 23#L1022-4true]) [2022-12-06 06:15:47,388 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 06:15:47,389 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 06:15:47,389 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:15:47,389 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 06:15:47,389 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L1008-->L973: Formula: (and (< 0 v_~top~0_114) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17| |v_~#arr~0.base_35|) (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_114, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_39|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_35|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_15|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_45|, ~top~0=v_~top~0_114, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_57|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_39|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][36], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 114#L996-2true, Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 166#true, 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 174#(<= ~top~0 0), 215#(not (<= 800 ~top~0)), 38#L973true, t2Thread1of1ForFork0InUse, 23#L1022-4true]) [2022-12-06 06:15:47,389 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 06:15:47,389 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 06:15:47,389 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:15:47,389 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 06:15:47,394 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][22], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 166#true, Black: 215#(not (<= 800 ~top~0)), 174#(<= ~top~0 0), t2Thread1of1ForFork0InUse, 123#L945-1true, 135#L1008-1true, 23#L1022-4true]) [2022-12-06 06:15:47,394 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 06:15:47,394 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 06:15:47,394 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-06 06:15:47,395 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-06 06:15:47,396 INFO L130 PetriNetUnfolder]: 72/329 cut-off events. [2022-12-06 06:15:47,397 INFO L131 PetriNetUnfolder]: For 320/331 co-relation queries the response was YES. [2022-12-06 06:15:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 329 events. 72/329 cut-off events. For 320/331 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1785 event pairs, 2 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 663. Up to 47 conditions per place. [2022-12-06 06:15:47,401 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:47,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-06 06:15:47,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[] [2022-12-06 06:15:47,437 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [463] L949-1-->L947: Formula: (= (+ v_~top~0_17 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|} OutVars{~top~0=v_~top~0_17} AuxVars[] AssignedVars[t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-06 06:15:47,452 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [567] L973-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_37| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_31|) 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15| |v_t2Thread1of1ForFork0_pop_~stack#1.base_37|) (= v_~top~0_107 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_37|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_13|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_31|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_37|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-06 06:15:47,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L973-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_37| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_31|) 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15| |v_t2Thread1of1ForFork0_pop_~stack#1.base_37|) (= v_~top~0_107 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_37|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_13|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_31|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_37|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset] and [587] L945-1-->L996-2: Formula: (and (= |v_t1Thread1of1ForFork1_push_#res#1_51| 0) (= |v_t1Thread1of1ForFork1_#t~ret41#1_69| |v_t1Thread1of1ForFork1_push_#res#1_51|) (= (+ 1 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|) v_~top~0_130)) InVars {t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|} OutVars{t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_69|, ~top~0=v_~top~0_130, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_51|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 06:15:47,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[] and [587] L945-1-->L996-2: Formula: (and (= |v_t1Thread1of1ForFork1_push_#res#1_51| 0) (= |v_t1Thread1of1ForFork1_#t~ret41#1_69| |v_t1Thread1of1ForFork1_push_#res#1_51|) (= (+ 1 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|) v_~top~0_130)) InVars {t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|} OutVars{t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_69|, ~top~0=v_~top~0_130, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_51|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 06:15:47,613 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:15:47,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-06 06:15:47,621 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 344 flow [2022-12-06 06:15:47,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:47,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:47,622 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:47,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:47,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:47,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash 657019038, now seen corresponding path program 1 times [2022-12-06 06:15:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:47,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452504105] [2022-12-06 06:15:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:47,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:47,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:47,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452504105] [2022-12-06 06:15:47,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452504105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:47,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:47,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092936338] [2022-12-06 06:15:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:47,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:15:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:15:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:15:47,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 46 [2022-12-06 06:15:47,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 344 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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-06 06:15:47,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:47,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 46 [2022-12-06 06:15:47,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:48,141 INFO L130 PetriNetUnfolder]: 1584/2898 cut-off events. [2022-12-06 06:15:48,141 INFO L131 PetriNetUnfolder]: For 2985/3014 co-relation queries the response was YES. [2022-12-06 06:15:48,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 2898 events. 1584/2898 cut-off events. For 2985/3014 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16667 event pairs, 1140 based on Foata normal form. 29/2425 useless extension candidates. Maximal degree in co-relation 6603. Up to 2596 conditions per place. [2022-12-06 06:15:48,159 INFO L137 encePairwiseOnDemand]: 45/46 looper letters, 51 selfloop transitions, 0 changer transitions 0/62 dead transitions. [2022-12-06 06:15:48,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 433 flow [2022-12-06 06:15:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:15:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:15:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-12-06 06:15:48,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 06:15:48,160 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 344 flow. Second operand 2 states and 52 transitions. [2022-12-06 06:15:48,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 433 flow [2022-12-06 06:15:48,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 406 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 06:15:48,173 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 304 flow [2022-12-06 06:15:48,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2022-12-06 06:15:48,174 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 06:15:48,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:48,175 INFO L89 Accepts]: Start accepts. Operand has 56 places, 62 transitions, 304 flow [2022-12-06 06:15:48,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:48,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:48,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 62 transitions, 304 flow [2022-12-06 06:15:48,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 62 transitions, 304 flow [2022-12-06 06:15:48,198 INFO L130 PetriNetUnfolder]: 63/316 cut-off events. [2022-12-06 06:15:48,198 INFO L131 PetriNetUnfolder]: For 246/259 co-relation queries the response was YES. [2022-12-06 06:15:48,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 316 events. 63/316 cut-off events. For 246/259 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1727 event pairs, 2 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 599. Up to 43 conditions per place. [2022-12-06 06:15:48,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 62 transitions, 304 flow [2022-12-06 06:15:48,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 06:15:48,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1008-->L973: Formula: (and (< 0 v_~top~0_114) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17| |v_~#arr~0.base_35|) (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_114, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_39|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_35|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_15|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_45|, ~top~0=v_~top~0_114, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_57|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_39|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [597] L945-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39| |v_t2Thread1of1ForFork0_pop_~stack#1.base_63|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_72|) 0) (= v_~top~0_252 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_63| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|) (= v_~top~0_252 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_225|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|, ~top~0=v_~top~0_252, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_63|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_29|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_72|, ~top~0=v_~top~0_252, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_63|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_225|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 06:15:48,220 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:48,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 06:15:48,221 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 308 flow [2022-12-06 06:15:48,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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-06 06:15:48,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:48,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:48,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:15:48,222 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1498366853, now seen corresponding path program 1 times [2022-12-06 06:15:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091571130] [2022-12-06 06:15:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:48,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:48,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091571130] [2022-12-06 06:15:48,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091571130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:48,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:48,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:15:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224576089] [2022-12-06 06:15:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:48,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:48,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-06 06:15:48,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:48,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:48,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-06 06:15:48,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:48,459 INFO L130 PetriNetUnfolder]: 552/1117 cut-off events. [2022-12-06 06:15:48,460 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-12-06 06:15:48,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 1117 events. 552/1117 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5487 event pairs, 98 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 2513. Up to 752 conditions per place. [2022-12-06 06:15:48,466 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 40 selfloop transitions, 6 changer transitions 3/60 dead transitions. [2022-12-06 06:15:48,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 327 flow [2022-12-06 06:15:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 06:15:48,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-06 06:15:48,467 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 308 flow. Second operand 3 states and 64 transitions. [2022-12-06 06:15:48,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 327 flow [2022-12-06 06:15:48,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 323 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:48,471 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 210 flow [2022-12-06 06:15:48,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-06 06:15:48,472 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-06 06:15:48,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:48,473 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 210 flow [2022-12-06 06:15:48,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:48,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:48,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 210 flow [2022-12-06 06:15:48,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 210 flow [2022-12-06 06:15:48,485 INFO L130 PetriNetUnfolder]: 17/142 cut-off events. [2022-12-06 06:15:48,485 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 06:15:48,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 142 events. 17/142 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 492 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 254. Up to 18 conditions per place. [2022-12-06 06:15:48,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 210 flow [2022-12-06 06:15:48,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 06:15:49,966 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-06 06:15:49,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1495 [2022-12-06 06:15:49,967 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 238 flow [2022-12-06 06:15:49,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:49,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:49,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:49,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:15:49,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1348600435, now seen corresponding path program 1 times [2022-12-06 06:15:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:49,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963348850] [2022-12-06 06:15:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:50,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:50,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963348850] [2022-12-06 06:15:50,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963348850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:50,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:50,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666623861] [2022-12-06 06:15:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:50,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:50,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:50,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 06:15:50,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:50,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:50,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 06:15:50,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:50,904 INFO L130 PetriNetUnfolder]: 840/1600 cut-off events. [2022-12-06 06:15:50,904 INFO L131 PetriNetUnfolder]: For 1704/1704 co-relation queries the response was YES. [2022-12-06 06:15:50,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4607 conditions, 1600 events. 840/1600 cut-off events. For 1704/1704 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8686 event pairs, 320 based on Foata normal form. 12/1515 useless extension candidates. Maximal degree in co-relation 3094. Up to 694 conditions per place. [2022-12-06 06:15:50,912 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 94 selfloop transitions, 11 changer transitions 9/118 dead transitions. [2022-12-06 06:15:50,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 118 transitions, 858 flow [2022-12-06 06:15:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:15:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:15:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2022-12-06 06:15:50,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2022-12-06 06:15:50,916 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 238 flow. Second operand 6 states and 133 transitions. [2022-12-06 06:15:50,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 118 transitions, 858 flow [2022-12-06 06:15:50,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 118 transitions, 794 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:50,923 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 326 flow [2022-12-06 06:15:50,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2022-12-06 06:15:50,925 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-06 06:15:50,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:50,926 INFO L89 Accepts]: Start accepts. Operand has 50 places, 51 transitions, 326 flow [2022-12-06 06:15:50,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:50,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:50,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 51 transitions, 326 flow [2022-12-06 06:15:50,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 326 flow [2022-12-06 06:15:50,947 INFO L130 PetriNetUnfolder]: 48/235 cut-off events. [2022-12-06 06:15:50,948 INFO L131 PetriNetUnfolder]: For 309/310 co-relation queries the response was YES. [2022-12-06 06:15:50,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 235 events. 48/235 cut-off events. For 309/310 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1236 event pairs, 0 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 395. Up to 42 conditions per place. [2022-12-06 06:15:50,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 326 flow [2022-12-06 06:15:50,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 06:15:51,349 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:15:51,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-06 06:15:51,350 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 324 flow [2022-12-06 06:15:51,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:51,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:51,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:51,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:15:51,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1603038933, now seen corresponding path program 1 times [2022-12-06 06:15:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:51,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413931251] [2022-12-06 06:15:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:51,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:51,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:51,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413931251] [2022-12-06 06:15:51,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413931251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:51,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:51,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074459342] [2022-12-06 06:15:51,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:51,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:51,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:51,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:51,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:51,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 06:15:51,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:51,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:51,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 06:15:51,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:52,125 INFO L130 PetriNetUnfolder]: 867/1668 cut-off events. [2022-12-06 06:15:52,126 INFO L131 PetriNetUnfolder]: For 2550/2550 co-relation queries the response was YES. [2022-12-06 06:15:52,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4717 conditions, 1668 events. 867/1668 cut-off events. For 2550/2550 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9405 event pairs, 219 based on Foata normal form. 30/1698 useless extension candidates. Maximal degree in co-relation 3560. Up to 496 conditions per place. [2022-12-06 06:15:52,134 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 72 selfloop transitions, 14 changer transitions 11/100 dead transitions. [2022-12-06 06:15:52,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 771 flow [2022-12-06 06:15:52,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:15:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:15:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-06 06:15:52,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2022-12-06 06:15:52,136 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 324 flow. Second operand 6 states and 117 transitions. [2022-12-06 06:15:52,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 771 flow [2022-12-06 06:15:52,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 711 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:52,142 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:52,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-06 06:15:52,143 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 06:15:52,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:52,143 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:52,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:52,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:52,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:52,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:52,167 INFO L130 PetriNetUnfolder]: 39/224 cut-off events. [2022-12-06 06:15:52,167 INFO L131 PetriNetUnfolder]: For 326/330 co-relation queries the response was YES. [2022-12-06 06:15:52,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 224 events. 39/224 cut-off events. For 326/330 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1262 event pairs, 1 based on Foata normal form. 2/200 useless extension candidates. Maximal degree in co-relation 385. Up to 40 conditions per place. [2022-12-06 06:15:52,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:52,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-06 06:15:52,473 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:52,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 333 [2022-12-06 06:15:52,476 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 344 flow [2022-12-06 06:15:52,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:52,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:52,477 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:52,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:15:52,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash 477676419, now seen corresponding path program 1 times [2022-12-06 06:15:52,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:52,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104702436] [2022-12-06 06:15:52,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:52,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104702436] [2022-12-06 06:15:52,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104702436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:52,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266834899] [2022-12-06 06:15:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:52,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:52,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:52,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:52,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 06:15:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:52,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 06:15:52,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:52,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:52,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266834899] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:52,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:52,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 06:15:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527503211] [2022-12-06 06:15:52,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:52,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 06:15:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 06:15:52,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-12-06 06:15:52,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 06:15:52,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 344 flow. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:52,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:52,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 06:15:52,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:53,263 INFO L130 PetriNetUnfolder]: 1348/2588 cut-off events. [2022-12-06 06:15:53,264 INFO L131 PetriNetUnfolder]: For 4417/4417 co-relation queries the response was YES. [2022-12-06 06:15:53,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 2588 events. 1348/2588 cut-off events. For 4417/4417 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 15550 event pairs, 319 based on Foata normal form. 82/2670 useless extension candidates. Maximal degree in co-relation 5772. Up to 453 conditions per place. [2022-12-06 06:15:53,280 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 146 selfloop transitions, 50 changer transitions 4/202 dead transitions. [2022-12-06 06:15:53,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 202 transitions, 1443 flow [2022-12-06 06:15:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:15:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:15:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 218 transitions. [2022-12-06 06:15:53,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2022-12-06 06:15:53,283 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 344 flow. Second operand 18 states and 218 transitions. [2022-12-06 06:15:53,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 202 transitions, 1443 flow [2022-12-06 06:15:53,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 202 transitions, 1407 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:53,295 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:53,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=806, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2022-12-06 06:15:53,297 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2022-12-06 06:15:53,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:53,298 INFO L89 Accepts]: Start accepts. Operand has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:53,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:53,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:53,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:53,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:53,346 INFO L130 PetriNetUnfolder]: 65/347 cut-off events. [2022-12-06 06:15:53,346 INFO L131 PetriNetUnfolder]: For 885/889 co-relation queries the response was YES. [2022-12-06 06:15:53,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 347 events. 65/347 cut-off events. For 885/889 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2147 event pairs, 1 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 954. Up to 78 conditions per place. [2022-12-06 06:15:53,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:53,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-06 06:15:53,769 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:15:53,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 472 [2022-12-06 06:15:53,770 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 776 flow [2022-12-06 06:15:53,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:53,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:53,770 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:53,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 06:15:53,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 06:15:53,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash 681524893, now seen corresponding path program 1 times [2022-12-06 06:15:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:53,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343320022] [2022-12-06 06:15:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:54,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343320022] [2022-12-06 06:15:54,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343320022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:54,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:54,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344309018] [2022-12-06 06:15:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:54,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:54,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:54,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:54,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:54,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-06 06:15:54,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-06 06:15:54,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:54,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-06 06:15:54,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:55,166 INFO L130 PetriNetUnfolder]: 2108/4028 cut-off events. [2022-12-06 06:15:55,166 INFO L131 PetriNetUnfolder]: For 10031/10031 co-relation queries the response was YES. [2022-12-06 06:15:55,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13332 conditions, 4028 events. 2108/4028 cut-off events. For 10031/10031 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 27243 event pairs, 713 based on Foata normal form. 24/4052 useless extension candidates. Maximal degree in co-relation 12673. Up to 1357 conditions per place. [2022-12-06 06:15:55,197 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 113 selfloop transitions, 76 changer transitions 1/192 dead transitions. [2022-12-06 06:15:55,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 192 transitions, 2024 flow [2022-12-06 06:15:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:15:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:15:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2022-12-06 06:15:55,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2022-12-06 06:15:55,199 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 776 flow. Second operand 10 states and 164 transitions. [2022-12-06 06:15:55,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 192 transitions, 2024 flow [2022-12-06 06:15:55,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 192 transitions, 1844 flow, removed 90 selfloop flow, removed 0 redundant places. [2022-12-06 06:15:55,231 INFO L231 Difference]: Finished difference. Result has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:55,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1413, PETRI_PLACES=80, PETRI_TRANSITIONS=128} [2022-12-06 06:15:55,232 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2022-12-06 06:15:55,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:55,233 INFO L89 Accepts]: Start accepts. Operand has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:55,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:55,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:55,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:55,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:55,298 INFO L130 PetriNetUnfolder]: 116/595 cut-off events. [2022-12-06 06:15:55,298 INFO L131 PetriNetUnfolder]: For 1599/1607 co-relation queries the response was YES. [2022-12-06 06:15:55,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 595 events. 116/595 cut-off events. For 1599/1607 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4513 event pairs, 0 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 1830. Up to 142 conditions per place. [2022-12-06 06:15:55,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:55,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 1028 [2022-12-06 06:15:55,306 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:55,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 06:15:55,307 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:55,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-06 06:15:55,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:55,307 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:55,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:15:55,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1781957431, now seen corresponding path program 2 times [2022-12-06 06:15:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:55,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530605379] [2022-12-06 06:15:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:55,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:56,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530605379] [2022-12-06 06:15:56,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530605379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:56,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978090487] [2022-12-06 06:15:56,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:15:56,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:56,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:56,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:56,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 06:15:56,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 06:15:56,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:15:56,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 06:15:56,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:56,344 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:15:56,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 06:15:56,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-06 06:15:56,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-06 06:15:56,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-06 06:15:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:59,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:16:00,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:16:00,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-06 06:16:00,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-06 06:16:00,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 06:16:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:16:00,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978090487] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:16:00,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:16:00,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2022-12-06 06:16:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717768837] [2022-12-06 06:16:00,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:16:00,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 06:16:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:00,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 06:16:00,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=259, Unknown=4, NotChecked=0, Total=342 [2022-12-06 06:16:00,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-06 06:16:00,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 128 transitions, 1413 flow. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:00,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:00,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-06 06:16:00,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:03,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:07,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:09,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:11,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:16,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:19,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:21,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:23,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:25,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:28,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:30,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:32,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:39,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:41,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:43,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:45,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:47,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:51,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:53,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:55,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:57,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:59,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:01,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:09,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:12,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:14,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:17,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:17,653 INFO L130 PetriNetUnfolder]: 3302/6293 cut-off events. [2022-12-06 06:17:17,653 INFO L131 PetriNetUnfolder]: For 17276/17276 co-relation queries the response was YES. [2022-12-06 06:17:17,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21751 conditions, 6293 events. 3302/6293 cut-off events. For 17276/17276 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 46371 event pairs, 597 based on Foata normal form. 17/6310 useless extension candidates. Maximal degree in co-relation 20928. Up to 1100 conditions per place. [2022-12-06 06:17:17,760 INFO L137 encePairwiseOnDemand]: 21/44 looper letters, 200 selfloop transitions, 168 changer transitions 6/376 dead transitions. [2022-12-06 06:17:17,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 376 transitions, 3936 flow [2022-12-06 06:17:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 06:17:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 06:17:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 339 transitions. [2022-12-06 06:17:17,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30818181818181817 [2022-12-06 06:17:17,763 INFO L175 Difference]: Start difference. First operand has 80 places, 128 transitions, 1413 flow. Second operand 25 states and 339 transitions. [2022-12-06 06:17:17,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 376 transitions, 3936 flow [2022-12-06 06:17:17,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 376 transitions, 3897 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:17,912 INFO L231 Difference]: Finished difference. Result has 107 places, 208 transitions, 2767 flow [2022-12-06 06:17:17,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2767, PETRI_PLACES=107, PETRI_TRANSITIONS=208} [2022-12-06 06:17:17,914 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2022-12-06 06:17:17,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:17,914 INFO L89 Accepts]: Start accepts. Operand has 107 places, 208 transitions, 2767 flow [2022-12-06 06:17:17,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:17,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:17,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 208 transitions, 2767 flow [2022-12-06 06:17:17,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 208 transitions, 2767 flow [2022-12-06 06:17:18,258 INFO L130 PetriNetUnfolder]: 457/1595 cut-off events. [2022-12-06 06:17:18,259 INFO L131 PetriNetUnfolder]: For 4762/4827 co-relation queries the response was YES. [2022-12-06 06:17:18,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5835 conditions, 1595 events. 457/1595 cut-off events. For 4762/4827 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14195 event pairs, 135 based on Foata normal form. 47/1461 useless extension candidates. Maximal degree in co-relation 5566. Up to 548 conditions per place. [2022-12-06 06:17:18,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 208 transitions, 2767 flow [2022-12-06 06:17:18,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 1556 [2022-12-06 06:17:18,614 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:18,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 701 [2022-12-06 06:17:18,615 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 208 transitions, 2776 flow [2022-12-06 06:17:18,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:18,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:18,616 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:18,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 06:17:18,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:17:18,823 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:18,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2093625879, now seen corresponding path program 1 times [2022-12-06 06:17:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:18,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245614391] [2022-12-06 06:17:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 06:17:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245614391] [2022-12-06 06:17:19,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245614391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:19,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:19,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859452342] [2022-12-06 06:17:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:19,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:17:19,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:19,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:17:19,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:17:19,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 45 [2022-12-06 06:17:19,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 208 transitions, 2776 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-06 06:17:19,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:19,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 45 [2022-12-06 06:17:19,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:21,438 INFO L130 PetriNetUnfolder]: 4294/8229 cut-off events. [2022-12-06 06:17:21,439 INFO L131 PetriNetUnfolder]: For 30088/30088 co-relation queries the response was YES. [2022-12-06 06:17:21,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32981 conditions, 8229 events. 4294/8229 cut-off events. For 30088/30088 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 63254 event pairs, 2468 based on Foata normal form. 6/8235 useless extension candidates. Maximal degree in co-relation 31926. Up to 5566 conditions per place. [2022-12-06 06:17:21,536 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 257 selfloop transitions, 63 changer transitions 0/322 dead transitions. [2022-12-06 06:17:21,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 322 transitions, 4618 flow [2022-12-06 06:17:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:17:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:17:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-12-06 06:17:21,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3234567901234568 [2022-12-06 06:17:21,538 INFO L175 Difference]: Start difference. First operand has 107 places, 208 transitions, 2776 flow. Second operand 9 states and 131 transitions. [2022-12-06 06:17:21,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 322 transitions, 4618 flow [2022-12-06 06:17:21,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 322 transitions, 4322 flow, removed 99 selfloop flow, removed 6 redundant places. [2022-12-06 06:17:21,746 INFO L231 Difference]: Finished difference. Result has 113 places, 248 transitions, 3387 flow [2022-12-06 06:17:21,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3387, PETRI_PLACES=113, PETRI_TRANSITIONS=248} [2022-12-06 06:17:21,747 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2022-12-06 06:17:21,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:21,747 INFO L89 Accepts]: Start accepts. Operand has 113 places, 248 transitions, 3387 flow [2022-12-06 06:17:21,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:21,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:21,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 248 transitions, 3387 flow [2022-12-06 06:17:21,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 248 transitions, 3387 flow [2022-12-06 06:17:22,175 INFO L130 PetriNetUnfolder]: 430/1590 cut-off events. [2022-12-06 06:17:22,175 INFO L131 PetriNetUnfolder]: For 4288/4343 co-relation queries the response was YES. [2022-12-06 06:17:22,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5564 conditions, 1590 events. 430/1590 cut-off events. For 4288/4343 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14404 event pairs, 181 based on Foata normal form. 38/1428 useless extension candidates. Maximal degree in co-relation 5303. Up to 597 conditions per place. [2022-12-06 06:17:22,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 248 transitions, 3387 flow [2022-12-06 06:17:22,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 1846 [2022-12-06 06:17:23,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:23,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1332 [2022-12-06 06:17:23,079 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 248 transitions, 3393 flow [2022-12-06 06:17:23,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-06 06:17:23,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:23,080 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:23,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:17:23,080 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1607610805, now seen corresponding path program 1 times [2022-12-06 06:17:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:23,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226075627] [2022-12-06 06:17:23,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:24,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:24,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226075627] [2022-12-06 06:17:24,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226075627] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:17:24,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591354527] [2022-12-06 06:17:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:24,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:17:24,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:17:24,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:17:24,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 06:17:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:24,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 06:17:24,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:17:24,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-06 06:17:24,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:17:24,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2022-12-06 06:17:24,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-06 06:17:27,012 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_9_48 4294967296))) (and (<= (+ .cse0 aux_mod_v_arrayElimCell_9_48 1) 0) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ .cse0 4294967297 aux_mod_v_arrayElimCell_9_48)) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |c_t2Thread1of1ForFork0_pop_#res#1|)))) is different from true [2022-12-06 06:17:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 06:17:27,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:17:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:27,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591354527] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:17:27,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:17:27,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2022-12-06 06:17:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980891269] [2022-12-06 06:17:27,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:17:27,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 06:17:27,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:27,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 06:17:27,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2022-12-06 06:17:27,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 47 [2022-12-06 06:17:27,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 248 transitions, 3393 flow. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:27,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:27,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 47 [2022-12-06 06:17:27,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:57,435 INFO L130 PetriNetUnfolder]: 7542/14411 cut-off events. [2022-12-06 06:17:57,435 INFO L131 PetriNetUnfolder]: For 50376/50376 co-relation queries the response was YES. [2022-12-06 06:17:57,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56444 conditions, 14411 events. 7542/14411 cut-off events. For 50376/50376 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 122228 event pairs, 975 based on Foata normal form. 40/14451 useless extension candidates. Maximal degree in co-relation 55292. Up to 5386 conditions per place. [2022-12-06 06:17:57,672 INFO L137 encePairwiseOnDemand]: 11/47 looper letters, 371 selfloop transitions, 500 changer transitions 104/977 dead transitions. [2022-12-06 06:17:57,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 977 transitions, 10839 flow [2022-12-06 06:17:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-06 06:17:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-06 06:17:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 875 transitions. [2022-12-06 06:17:57,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2190237797246558 [2022-12-06 06:17:57,680 INFO L175 Difference]: Start difference. First operand has 113 places, 248 transitions, 3393 flow. Second operand 85 states and 875 transitions. [2022-12-06 06:17:57,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 977 transitions, 10839 flow [2022-12-06 06:17:57,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 977 transitions, 10822 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:57,939 INFO L231 Difference]: Finished difference. Result has 202 places, 551 transitions, 8290 flow [2022-12-06 06:17:57,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3378, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=8290, PETRI_PLACES=202, PETRI_TRANSITIONS=551} [2022-12-06 06:17:57,941 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2022-12-06 06:17:57,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:57,941 INFO L89 Accepts]: Start accepts. Operand has 202 places, 551 transitions, 8290 flow [2022-12-06 06:17:57,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:57,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:57,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 551 transitions, 8290 flow [2022-12-06 06:17:57,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 551 transitions, 8290 flow [2022-12-06 06:17:58,827 INFO L130 PetriNetUnfolder]: 1351/4413 cut-off events. [2022-12-06 06:17:58,828 INFO L131 PetriNetUnfolder]: For 25446/26609 co-relation queries the response was YES. [2022-12-06 06:17:58,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22160 conditions, 4413 events. 1351/4413 cut-off events. For 25446/26609 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 45949 event pairs, 255 based on Foata normal form. 95/4021 useless extension candidates. Maximal degree in co-relation 21577. Up to 1293 conditions per place. [2022-12-06 06:17:58,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 551 transitions, 8290 flow [2022-12-06 06:17:58,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 3642 [2022-12-06 06:18:04,644 INFO L203 LiptonReduction]: Total number of compositions: 15 [2022-12-06 06:18:04,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6704 [2022-12-06 06:18:04,645 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 538 transitions, 8201 flow [2022-12-06 06:18:04,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:04,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:04,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:04,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 06:18:04,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:18:04,861 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:18:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2062440625, now seen corresponding path program 1 times [2022-12-06 06:18:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:04,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821499933] [2022-12-06 06:18:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821499933] [2022-12-06 06:18:06,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821499933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:18:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814693924] [2022-12-06 06:18:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:18:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:18:06,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:18:06,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 06:18:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:06,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 06:18:06,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:18:06,384 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:18:06,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 06:18:06,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-06 06:18:06,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-06 06:18:06,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:18:06,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-12-06 06:18:06,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-06 06:18:09,338 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_arrayElimCell_15_49 Int) (aux_div_v_arrayElimCell_15_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_15_49 4294967296))) (and (<= (+ aux_mod_v_arrayElimCell_15_49 .cse0 1) 0) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_15_49)) 4294967296)) (<= 4294966496 aux_mod_v_arrayElimCell_15_49) (< aux_mod_v_arrayElimCell_15_49 4294967296) (< 0 (+ aux_mod_v_arrayElimCell_15_49 4294967297 .cse0))))) is different from true [2022-12-06 06:18:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 06:18:09,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:18:09,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:18:09,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-06 06:18:09,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-06 06:18:09,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 06:18:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814693924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:18:09,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:18:09,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 06:18:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861668980] [2022-12-06 06:18:09,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:18:09,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:18:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:18:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=4, NotChecked=34, Total=380 [2022-12-06 06:18:09,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 71 [2022-12-06 06:18:09,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 538 transitions, 8201 flow. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:09,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:09,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 71 [2022-12-06 06:18:09,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:41,988 INFO L130 PetriNetUnfolder]: 18715/36060 cut-off events. [2022-12-06 06:18:41,988 INFO L131 PetriNetUnfolder]: For 359703/359703 co-relation queries the response was YES. [2022-12-06 06:18:42,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213173 conditions, 36060 events. 18715/36060 cut-off events. For 359703/359703 co-relation queries the response was YES. Maximal size of possible extension queue 1520. Compared 341750 event pairs, 2446 based on Foata normal form. 442/36502 useless extension candidates. Maximal degree in co-relation 208545. Up to 13830 conditions per place. [2022-12-06 06:18:42,615 INFO L137 encePairwiseOnDemand]: 16/71 looper letters, 626 selfloop transitions, 1302 changer transitions 217/2147 dead transitions. [2022-12-06 06:18:42,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 2147 transitions, 32703 flow [2022-12-06 06:18:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-12-06 06:18:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2022-12-06 06:18:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 1278 transitions. [2022-12-06 06:18:42,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1651376146788991 [2022-12-06 06:18:42,644 INFO L175 Difference]: Start difference. First operand has 189 places, 538 transitions, 8201 flow. Second operand 109 states and 1278 transitions. [2022-12-06 06:18:42,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 2147 transitions, 32703 flow [2022-12-06 06:18:44,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 2147 transitions, 31246 flow, removed 289 selfloop flow, removed 7 redundant places. [2022-12-06 06:18:44,183 INFO L231 Difference]: Finished difference. Result has 308 places, 1405 transitions, 24056 flow [2022-12-06 06:18:44,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=6892, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=398, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=109, PETRI_FLOW=24056, PETRI_PLACES=308, PETRI_TRANSITIONS=1405} [2022-12-06 06:18:44,184 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 266 predicate places. [2022-12-06 06:18:44,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:44,184 INFO L89 Accepts]: Start accepts. Operand has 308 places, 1405 transitions, 24056 flow [2022-12-06 06:18:44,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:44,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:44,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 1405 transitions, 24056 flow [2022-12-06 06:18:44,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 1405 transitions, 24056 flow [2022-12-06 06:18:47,501 INFO L130 PetriNetUnfolder]: 3655/11835 cut-off events. [2022-12-06 06:18:47,502 INFO L131 PetriNetUnfolder]: For 105771/109222 co-relation queries the response was YES. [2022-12-06 06:18:47,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67994 conditions, 11835 events. 3655/11835 cut-off events. For 105771/109222 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 137901 event pairs, 974 based on Foata normal form. 211/10734 useless extension candidates. Maximal degree in co-relation 65882. Up to 2989 conditions per place. [2022-12-06 06:18:47,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 1405 transitions, 24056 flow [2022-12-06 06:18:47,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 9382 [2022-12-06 06:18:48,793 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 800) 1 0)) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (not (= 800 v_~top~0_404)) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 800) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [563] L1021-4-->L1022-3: Formula: (and (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre47#1_21|) (= |v_#memory_int_87| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21|) |v_ULTIMATE.start_main_~#id2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_21|))) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_15|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_25|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_21|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 06:18:53,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [676] L991-6-->L991-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_983| |v_~#m~0.base_434|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_295| 4294967296))) (and (= |v_t1Thread1of1ForFork1_~i~0#1_474| (+ |v_t1Thread1of1ForFork1_~i~0#1_475| 1)) (= (store |v_#pthreadsMutex_983| |v_~#m~0.base_434| (store .cse0 |v_~#m~0.offset_434| 0)) |v_#pthreadsMutex_981|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_270| |v_t1Thread1of1ForFork1_push_~x#1_292|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_285| v_~top~0_837) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_285| 2147483647) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_292|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_292| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_270|) (= (+ v_~top~0_837 1) v_~top~0_836) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_270| |v_~#arr~0.base_316|) (= |v_t1Thread1of1ForFork1_push_#res#1_431| 0) (= (select .cse0 |v_~#m~0.offset_434|) 0) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_285| 2147483648)) (not (= 800 v_~top~0_837)) (= (ite (< .cse1 800) 1 0) |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_270| (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_270| |v_t1Thread1of1ForFork1_push_~stack#1.offset_292|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_270| |v_~#arr~0.offset_312|) (< |v_t1Thread1of1ForFork1_~i~0#1_475| 800) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_495| |v_t1Thread1of1ForFork1_~tmp~0#1_295|) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_292| 0)) (= (store |v_#memory_int_591| |v_t1Thread1of1ForFork1_push_~stack#1.base_292| (store (select |v_#memory_int_591| |v_t1Thread1of1ForFork1_push_~stack#1.base_292|) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_292| (* |v_t1Thread1of1ForFork1_get_top_#res#1_285| 4)) |v_t1Thread1of1ForFork1_push_~x#1_292|)) |v_#memory_int_590|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_983|, ~#arr~0.offset=|v_~#arr~0.offset_312|, ~#m~0.base=|v_~#m~0.base_434|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_475|, ~#m~0.offset=|v_~#m~0.offset_434|, #memory_int=|v_#memory_int_591|, ~top~0=v_~top~0_837, ~#arr~0.base=|v_~#arr~0.base_316|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_495|} OutVars{t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_474|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_270|, ~top~0=v_~top~0_836, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_270|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_431|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_285|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_280|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_292|, ~#arr~0.base=|v_~#arr~0.base_316|, t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_197|, #pthreadsMutex=|v_#pthreadsMutex_981|, ~#arr~0.offset=|v_~#arr~0.offset_312|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_292|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_314|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_270|, ~#m~0.base=|v_~#m~0.base_434|, ~#m~0.offset=|v_~#m~0.offset_434|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_295|, #memory_int=|v_#memory_int_590|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_335|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_292|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_292|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_269|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_571|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~post38#1, #pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_~i~0#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, ~top~0, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_#t~ret41#1, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [563] L1021-4-->L1022-3: Formula: (and (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre47#1_21|) (= |v_#memory_int_87| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21|) |v_ULTIMATE.start_main_~#id2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_21|))) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_15|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_25|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_21|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 06:18:58,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] L991-6-->L1022-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1399| |v_~#m~0.base_602|)) (.cse2 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_421| 4294967296)) (.cse1 (mod |v_t1Thread1of1ForFork1_#t~nondet40#1_739| 4294967296))) (and (= |v_t1Thread1of1ForFork1_#t~nondet40#1_738| |v_t1Thread1of1ForFork1_~tmp~0#1_421|) (not (= v_~top~0_1109 800)) (= (select .cse0 |v_~#m~0.offset_602|) 0) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_417| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_395|) (= (+ v_~top~0_1110 1) v_~top~0_1109) (= |v_#pthreadsMutex_1397| (store |v_#pthreadsMutex_1399| |v_~#m~0.base_602| (store .cse0 |v_~#m~0.offset_602| 1))) (<= 0 (+ v_~top~0_1110 2147483648)) (< |v_t1Thread1of1ForFork1_~i~0#1_666| 800) (not (= (ite (< .cse1 800) 1 0) 0)) (= |v_t1Thread1of1ForFork1_push_#in~x#1_395| (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_417| 0)) (not (= v_~top~0_1110 800)) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_395| |v_~#arr~0.base_465|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_395| |v_t1Thread1of1ForFork1_push_~x#1_417|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_410| 2147483647) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_417|) (= |v_#pthreadsForks_64| |v_ULTIMATE.start_main_#t~pre47#1_283|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_395| |v_t1Thread1of1ForFork1_push_~stack#1.offset_417|) (= (ite (< .cse2 800) 1 0) |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_395| |v_~#arr~0.offset_460|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_410| v_~top~0_1109) (= (let ((.cse3 (let ((.cse4 (store |v_#memory_int_872| |v_~#arr~0.base_465| (store (select |v_#memory_int_872| |v_~#arr~0.base_465|) (+ (* v_~top~0_1110 4) |v_~#arr~0.offset_460|) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))))))) (store .cse4 |v_t1Thread1of1ForFork1_push_~stack#1.base_417| (store (select .cse4 |v_t1Thread1of1ForFork1_push_~stack#1.base_417|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_410| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_417|) |v_t1Thread1of1ForFork1_push_~x#1_417|))))) (store .cse3 |v_ULTIMATE.start_main_~#id2~0#1.base_99| (store (select .cse3 |v_ULTIMATE.start_main_~#id2~0#1.base_99|) |v_ULTIMATE.start_main_~#id2~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre47#1_283|))) |v_#memory_int_870|) (= (+ |v_#pthreadsForks_64| 1) |v_#pthreadsForks_63|) (= |v_t1Thread1of1ForFork1_~i~0#1_666| (+ |v_t1Thread1of1ForFork1_~i~0#1_667| 1)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1399|, ~#arr~0.offset=|v_~#arr~0.offset_460|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_41|, ~#m~0.base=|v_~#m~0.base_602|, #pthreadsForks=|v_#pthreadsForks_64|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_667|, ~#m~0.offset=|v_~#m~0.offset_602|, #memory_int=|v_#memory_int_872|, ~top~0=v_~top~0_1110, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_99|, ~#arr~0.base=|v_~#arr~0.base_465|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_739|} OutVars{t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_666|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_395|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_283|, ~top~0=v_~top~0_1109, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_395|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_581|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_410|, #pthreadsForks=|v_#pthreadsForks_63|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_405|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_417|, ~#arr~0.base=|v_~#arr~0.base_465|, #pthreadsMutex=|v_#pthreadsMutex_1397|, ~#arr~0.offset=|v_~#arr~0.offset_460|, t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_268|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_41|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_417|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_439|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_395|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_43|, ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_35|, ~#m~0.base=|v_~#m~0.base_602|, ~#m~0.offset=|v_~#m~0.offset_602|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_421|, #memory_int=|v_#memory_int_870|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_406|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_417|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_99|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_417|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_394|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_721|} AuxVars[|v_t1Thread1of1ForFork1_#t~nondet40#1_738|] AssignedVars[t1Thread1of1ForFork1_~i~0#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.offset, ULTIMATE.start_main_#t~pre47#1, ~top~0, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, #pthreadsForks, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, #pthreadsMutex, t1Thread1of1ForFork1_#t~post38#1, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, ULTIMATE.start_main_#t~pre45#1, ULTIMATE.start_main_#t~nondet46#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_#t~ret41#1, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [627] L945-->L991-6: Formula: (and (= |v_t1Thread1of1ForFork1_~i~0#1_136| (+ |v_t1Thread1of1ForFork1_~i~0#1_137| 1)) (= (store |v_#pthreadsMutex_403| |v_~#m~0.base_188| (store (select |v_#pthreadsMutex_403| |v_~#m~0.base_188|) |v_~#m~0.offset_188| 0)) |v_#pthreadsMutex_402|) (= (+ v_~top~0_411 1) v_~top~0_410) (= |v_t1Thread1of1ForFork1_push_#res#1_166| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_403|, ~#m~0.base=|v_~#m~0.base_188|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_137|, ~#m~0.offset=|v_~#m~0.offset_188|, ~top~0=v_~top~0_411} OutVars{t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_69|, #pthreadsMutex=|v_#pthreadsMutex_402|, ~#m~0.base=|v_~#m~0.base_188|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_136|, ~#m~0.offset=|v_~#m~0.offset_188|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_194|, ~top~0=v_~top~0_410, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_166|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_301|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~post38#1, #pthreadsMutex, t1Thread1of1ForFork1_~i~0#1, t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 06:18:58,689 INFO L203 LiptonReduction]: Total number of compositions: 19 [2022-12-06 06:18:58,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14508 [2022-12-06 06:18:58,692 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 1391 transitions, 24008 flow [2022-12-06 06:18:58,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:58,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:58,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:58,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 06:18:58,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 06:18:58,901 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:18:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1797473652, now seen corresponding path program 1 times [2022-12-06 06:18:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:58,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749127663] [2022-12-06 06:18:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:59,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749127663] [2022-12-06 06:18:59,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749127663] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:18:59,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304417074] [2022-12-06 06:18:59,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:59,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:18:59,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:18:59,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:18:59,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 06:18:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:59,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 06:18:59,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:18:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:59,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:18:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:59,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304417074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:18:59,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:18:59,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-06 06:18:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111360880] [2022-12-06 06:18:59,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:18:59,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:18:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:18:59,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:18:59,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 106 [2022-12-06 06:18:59,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 1391 transitions, 24008 flow. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:59,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:59,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 106 [2022-12-06 06:18:59,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:18,177 INFO L130 PetriNetUnfolder]: 26861/51319 cut-off events. [2022-12-06 06:19:18,177 INFO L131 PetriNetUnfolder]: For 741961/741961 co-relation queries the response was YES. [2022-12-06 06:19:18,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347032 conditions, 51319 events. 26861/51319 cut-off events. For 741961/741961 co-relation queries the response was YES. Maximal size of possible extension queue 1900. Compared 496076 event pairs, 7071 based on Foata normal form. 446/51765 useless extension candidates. Maximal degree in co-relation 330175. Up to 19078 conditions per place. [2022-12-06 06:19:19,064 INFO L137 encePairwiseOnDemand]: 25/106 looper letters, 811 selfloop transitions, 1507 changer transitions 39/2359 dead transitions. [2022-12-06 06:19:19,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 2359 transitions, 42911 flow [2022-12-06 06:19:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:19:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:19:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 443 transitions. [2022-12-06 06:19:19,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1607402031930334 [2022-12-06 06:19:19,070 INFO L175 Difference]: Start difference. First operand has 293 places, 1391 transitions, 24008 flow. Second operand 26 states and 443 transitions. [2022-12-06 06:19:19,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 2359 transitions, 42911 flow [2022-12-06 06:19:23,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2359 transitions, 42299 flow, removed 235 selfloop flow, removed 12 redundant places. [2022-12-06 06:19:23,759 INFO L231 Difference]: Finished difference. Result has 318 places, 1927 transitions, 38209 flow [2022-12-06 06:19:23,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=23191, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=38209, PETRI_PLACES=318, PETRI_TRANSITIONS=1927} [2022-12-06 06:19:23,760 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 276 predicate places. [2022-12-06 06:19:23,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:23,761 INFO L89 Accepts]: Start accepts. Operand has 318 places, 1927 transitions, 38209 flow [2022-12-06 06:19:23,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:23,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:23,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 318 places, 1927 transitions, 38209 flow [2022-12-06 06:19:23,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 1927 transitions, 38209 flow [2022-12-06 06:19:28,130 INFO L130 PetriNetUnfolder]: 5913/18590 cut-off events. [2022-12-06 06:19:28,130 INFO L131 PetriNetUnfolder]: For 217800/224083 co-relation queries the response was YES. [2022-12-06 06:19:28,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116849 conditions, 18590 events. 5913/18590 cut-off events. For 217800/224083 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 224648 event pairs, 1705 based on Foata normal form. 280/16738 useless extension candidates. Maximal degree in co-relation 114037. Up to 4923 conditions per place. [2022-12-06 06:19:28,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 1927 transitions, 38209 flow [2022-12-06 06:19:28,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 13186 [2022-12-06 06:19:28,801 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:19:28,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5045 [2022-12-06 06:19:28,805 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 1925 transitions, 38201 flow [2022-12-06 06:19:28,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:28,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:28,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:28,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 06:19:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:19:29,006 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:19:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1950573048, now seen corresponding path program 1 times [2022-12-06 06:19:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:29,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943443062] [2022-12-06 06:19:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:19:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:29,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943443062] [2022-12-06 06:19:29,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943443062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:29,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:29,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613274375] [2022-12-06 06:19:29,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:29,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:19:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:19:29,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:19:29,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 112 [2022-12-06 06:19:29,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 1925 transitions, 38201 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:29,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:29,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 112 [2022-12-06 06:19:29,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:01,091 INFO L130 PetriNetUnfolder]: 34953/67267 cut-off events. [2022-12-06 06:20:01,091 INFO L131 PetriNetUnfolder]: For 1059226/1059226 co-relation queries the response was YES. [2022-12-06 06:20:02,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473884 conditions, 67267 events. 34953/67267 cut-off events. For 1059226/1059226 co-relation queries the response was YES. Maximal size of possible extension queue 2515. Compared 678431 event pairs, 13730 based on Foata normal form. 6/67273 useless extension candidates. Maximal degree in co-relation 465235. Up to 39785 conditions per place. [2022-12-06 06:20:02,483 INFO L137 encePairwiseOnDemand]: 81/112 looper letters, 2268 selfloop transitions, 390 changer transitions 7/2667 dead transitions. [2022-12-06 06:20:02,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 2667 transitions, 57733 flow [2022-12-06 06:20:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:20:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:20:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2022-12-06 06:20:02,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2022-12-06 06:20:02,485 INFO L175 Difference]: Start difference. First operand has 316 places, 1925 transitions, 38201 flow. Second operand 6 states and 222 transitions. [2022-12-06 06:20:02,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 2667 transitions, 57733 flow [2022-12-06 06:20:13,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 2667 transitions, 57171 flow, removed 281 selfloop flow, removed 0 redundant places. [2022-12-06 06:20:13,263 INFO L231 Difference]: Finished difference. Result has 324 places, 2130 transitions, 44481 flow [2022-12-06 06:20:13,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=37765, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=44481, PETRI_PLACES=324, PETRI_TRANSITIONS=2130} [2022-12-06 06:20:13,265 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 282 predicate places. [2022-12-06 06:20:13,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:13,265 INFO L89 Accepts]: Start accepts. Operand has 324 places, 2130 transitions, 44481 flow [2022-12-06 06:20:13,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:13,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:13,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 2130 transitions, 44481 flow [2022-12-06 06:20:13,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 2130 transitions, 44481 flow [2022-12-06 06:20:18,804 INFO L130 PetriNetUnfolder]: 7159/22636 cut-off events. [2022-12-06 06:20:18,805 INFO L131 PetriNetUnfolder]: For 292049/299980 co-relation queries the response was YES. [2022-12-06 06:20:18,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146014 conditions, 22636 events. 7159/22636 cut-off events. For 292049/299980 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 282099 event pairs, 2009 based on Foata normal form. 338/20446 useless extension candidates. Maximal degree in co-relation 142819. Up to 6008 conditions per place. [2022-12-06 06:20:19,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 2130 transitions, 44481 flow [2022-12-06 06:20:19,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 14640 [2022-12-06 06:20:19,269 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:19,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6004 [2022-12-06 06:20:19,269 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 2130 transitions, 44481 flow [2022-12-06 06:20:19,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:19,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:19,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:19,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:20:19,270 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1290103012, now seen corresponding path program 1 times [2022-12-06 06:20:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:19,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475671609] [2022-12-06 06:20:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:20:19,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:19,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475671609] [2022-12-06 06:20:19,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475671609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:19,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:19,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:20:19,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67636076] [2022-12-06 06:20:19,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:19,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:20:19,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:20:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:20:19,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 112 [2022-12-06 06:20:19,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 2130 transitions, 44481 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-06 06:20:19,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:19,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 112 [2022-12-06 06:20:19,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:03,679 INFO L130 PetriNetUnfolder]: 35513/68322 cut-off events. [2022-12-06 06:21:03,679 INFO L131 PetriNetUnfolder]: For 1125064/1125064 co-relation queries the response was YES. [2022-12-06 06:21:05,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485280 conditions, 68322 events. 35513/68322 cut-off events. For 1125064/1125064 co-relation queries the response was YES. Maximal size of possible extension queue 2577. Compared 690882 event pairs, 13764 based on Foata normal form. 6/68328 useless extension candidates. Maximal degree in co-relation 476593. Up to 36131 conditions per place. [2022-12-06 06:21:05,410 INFO L137 encePairwiseOnDemand]: 81/112 looper letters, 2158 selfloop transitions, 614 changer transitions 4/2778 dead transitions. [2022-12-06 06:21:05,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 2778 transitions, 61014 flow [2022-12-06 06:21:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:21:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:21:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 241 transitions. [2022-12-06 06:21:05,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21517857142857144 [2022-12-06 06:21:05,412 INFO L175 Difference]: Start difference. First operand has 324 places, 2130 transitions, 44481 flow. Second operand 10 states and 241 transitions. [2022-12-06 06:21:05,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 2778 transitions, 61014 flow [2022-12-06 06:21:16,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 2778 transitions, 60987 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 06:21:16,533 INFO L231 Difference]: Finished difference. Result has 334 places, 2195 transitions, 48068 flow [2022-12-06 06:21:16,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=44454, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=549, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=48068, PETRI_PLACES=334, PETRI_TRANSITIONS=2195} [2022-12-06 06:21:16,535 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 292 predicate places. [2022-12-06 06:21:16,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:16,535 INFO L89 Accepts]: Start accepts. Operand has 334 places, 2195 transitions, 48068 flow [2022-12-06 06:21:16,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:16,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:16,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 2195 transitions, 48068 flow [2022-12-06 06:21:16,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 2195 transitions, 48068 flow [2022-12-06 06:21:25,616 INFO L130 PetriNetUnfolder]: 7203/22806 cut-off events. [2022-12-06 06:21:25,617 INFO L131 PetriNetUnfolder]: For 322706/330760 co-relation queries the response was YES. [2022-12-06 06:21:25,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149875 conditions, 22806 events. 7203/22806 cut-off events. For 322706/330760 co-relation queries the response was YES. Maximal size of possible extension queue 1166. Compared 284764 event pairs, 2019 based on Foata normal form. 347/20607 useless extension candidates. Maximal degree in co-relation 146593. Up to 6058 conditions per place. [2022-12-06 06:21:26,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 2195 transitions, 48068 flow [2022-12-06 06:21:26,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 15066 [2022-12-06 06:21:26,358 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:26,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9825 [2022-12-06 06:21:26,379 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 2195 transitions, 48068 flow [2022-12-06 06:21:26,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-06 06:21:26,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:26,380 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:26,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:21:26,380 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:21:26,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1990850684, now seen corresponding path program 1 times [2022-12-06 06:21:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:26,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102432549] [2022-12-06 06:21:26,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:27,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102432549] [2022-12-06 06:21:27,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102432549] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:21:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430863004] [2022-12-06 06:21:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:27,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:21:27,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:21:27,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:21:27,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 06:21:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:28,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 06:21:28,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:21:28,065 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 06:21:28,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-06 06:21:28,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2022-12-06 06:21:28,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-06 06:21:28,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:21:28,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2022-12-06 06:21:28,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-06 06:21:30,447 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_21_49 Int) (aux_mod_v_arrayElimCell_21_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_21_49 4294967296))) (and (<= (+ .cse0 aux_mod_v_arrayElimCell_21_49 1) 0) (< 0 (+ .cse0 aux_mod_v_arrayElimCell_21_49 4294967297)) (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_21_49)) 4294967296) |c_t2Thread1of1ForFork0_pop_#res#1|) (< aux_mod_v_arrayElimCell_21_49 4294967296) (<= 4294966496 aux_mod_v_arrayElimCell_21_49)))) is different from true [2022-12-06 06:21:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 06:21:30,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:21:30,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:21:30,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-12-06 06:21:30,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2022-12-06 06:21:30,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2022-12-06 06:21:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:30,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430863004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:21:30,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:21:30,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:21:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767590432] [2022-12-06 06:21:30,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:21:30,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:21:30,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:30,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:21:30,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2022-12-06 06:21:30,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 112 [2022-12-06 06:21:30,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 2195 transitions, 48068 flow. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:30,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:30,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 112 [2022-12-06 06:21:30,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:27,699 INFO L130 PetriNetUnfolder]: 48507/93496 cut-off events. [2022-12-06 06:22:27,699 INFO L131 PetriNetUnfolder]: For 1583357/1583357 co-relation queries the response was YES. [2022-12-06 06:22:28,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665057 conditions, 93496 events. 48507/93496 cut-off events. For 1583357/1583357 co-relation queries the response was YES. Maximal size of possible extension queue 3359. Compared 977674 event pairs, 13578 based on Foata normal form. 126/93622 useless extension candidates. Maximal degree in co-relation 655216. Up to 34061 conditions per place. [2022-12-06 06:22:29,401 INFO L137 encePairwiseOnDemand]: 57/112 looper letters, 2419 selfloop transitions, 1469 changer transitions 41/3931 dead transitions. [2022-12-06 06:22:29,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 3931 transitions, 86842 flow [2022-12-06 06:22:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 06:22:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 06:22:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 624 transitions. [2022-12-06 06:22:29,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15476190476190477 [2022-12-06 06:22:29,404 INFO L175 Difference]: Start difference. First operand has 334 places, 2195 transitions, 48068 flow. Second operand 36 states and 624 transitions. [2022-12-06 06:22:29,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 3931 transitions, 86842 flow [2022-12-06 06:22:44,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 3931 transitions, 86344 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:44,412 INFO L231 Difference]: Finished difference. Result has 388 places, 2770 transitions, 66805 flow [2022-12-06 06:22:44,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=47604, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=909, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1085, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=66805, PETRI_PLACES=388, PETRI_TRANSITIONS=2770} [2022-12-06 06:22:44,415 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 346 predicate places. [2022-12-06 06:22:44,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:44,415 INFO L89 Accepts]: Start accepts. Operand has 388 places, 2770 transitions, 66805 flow [2022-12-06 06:22:44,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:44,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:44,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 388 places, 2770 transitions, 66805 flow [2022-12-06 06:22:44,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 388 places, 2770 transitions, 66805 flow [2022-12-06 06:22:49,191 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([572] pop_returnLabel#1-->t2Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_37|) 0) InVars {t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_37|} OutVars{t2Thread1of1ForFork0_#t~ret44#1=|v_t2Thread1of1ForFork0_#t~ret44#1_65|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_37|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_#t~ret44#1][328], [1144#(= ~top~0 0), Black: 170#(<= ~top~0 1), Black: 215#(not (<= 800 ~top~0)), Black: 174#(<= ~top~0 0), Black: 1280#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 500#(and (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (or (and (<= (+ (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 4) (* ~top~0 4)) (= |~#arr~0.offset| 0)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647))) (or (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647)) (and (= |~#arr~0.offset| 0) (<= (+ (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 4) (* ~top~0 4)))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (exists ((aux_div_v_arrayElimCell_5_48 Int) (aux_mod_v_arrayElimCell_5_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_5_48 4294967296) aux_mod_v_arrayElimCell_5_48 1) 0) (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_5_48)) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (< 0 (+ (* aux_div_v_arrayElimCell_5_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_5_48)) (<= 4294966496 aux_mod_v_arrayElimCell_5_48) (< aux_mod_v_arrayElimCell_5_48 4294967296))) (= 3 |~#arr~0.base|)), Black: 498#(and (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (or (and (<= (+ (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 4) (* ~top~0 4)) (= |~#arr~0.offset| 0)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647))) (or (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647)) (and (= |~#arr~0.offset| 0) (<= (+ (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 4) (* ~top~0 4)))) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 502#(and (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 275#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799)), 909#(not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)), Black: 540#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (= |~#arr~0.offset| 0)), Black: 289#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799)), Black: 535#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 287#(or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)), Black: 544#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), 1255#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), 136#t2Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 40#L1023-2true, Black: 723#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|)), Black: 719#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|)), Black: 695#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 752#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (= |~#arr~0.offset| 0) (<= (+ (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) 4294966497 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|)), Black: 728#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|) (or (< (* ~top~0 4) 4) (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))))), Black: 798#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= (+ (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) 4294966497 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|)), 282#true, 533#(= |~#arr~0.offset| 0), 166#true, 271#true, Black: 971#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 1083#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0))), Black: 824#true, Black: 975#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 989#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 995#(and (<= (+ (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|))) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|)) (= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (< (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294967296) (= 3 |~#arr~0.base|)), Black: 1041#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 963#(and (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (forall ((v_ArrVal_472 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_472) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)))), Black: 987#(and (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 991#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 877#(not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)), Black: 952#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (exists ((aux_mod_v_arrayElimCell_15_49 Int) (aux_div_v_arrayElimCell_15_49 Int)) (and (<= (+ aux_mod_v_arrayElimCell_15_49 (* aux_div_v_arrayElimCell_15_49 4294967296) 1) 0) (= |t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_15_49)) 4294967296)) (<= 4294966496 aux_mod_v_arrayElimCell_15_49) (< aux_mod_v_arrayElimCell_15_49 4294967296) (< 0 (+ aux_mod_v_arrayElimCell_15_49 4294967297 (* aux_div_v_arrayElimCell_15_49 4294967296))))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 969#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (forall ((v_ArrVal_472 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_472) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)))), Black: 927#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (<= (* ~top~0 4) 4)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), 295#(= ~top~0 0), Black: 881#(not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)), Black: 967#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 940#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 1101#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0))), Black: 1017#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 1095#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294))), Black: 1019#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= (+ (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|))) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|)) (= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (< (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294967296) (= 3 |~#arr~0.base|)), Black: 350#(< ~top~0 797), Black: 297#(<= ~top~0 2), Black: 299#(<= ~top~0 3), Black: 296#(<= ~top~0 1), Black: 339#(< ~top~0 799), 384#(= |~#arr~0.offset| 0), Black: 331#(not (<= 800 ~top~0)), Black: 343#(< ~top~0 798), 561#(= 3 |~#arr~0.base|), Black: 391#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)))), t2Thread1of1ForFork0InUse, Black: 1419#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)), Black: 1379#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 160#(= ~top~0 0), Black: 1403#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1431#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1411#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|)), Black: 1395#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1417#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1437#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (= ~top~0 3)), Black: 1399#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1421#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (exists ((aux_div_v_arrayElimCell_21_49 Int) (aux_mod_v_arrayElimCell_21_49 Int)) (and (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_21_49)) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ (* aux_div_v_arrayElimCell_21_49 4294967296) aux_mod_v_arrayElimCell_21_49 1) 0) (< 0 (+ (* aux_div_v_arrayElimCell_21_49 4294967296) aux_mod_v_arrayElimCell_21_49 4294967297)) (< aux_mod_v_arrayElimCell_21_49 4294967296) (<= 4294966496 aux_mod_v_arrayElimCell_21_49))) (= 3 |~#arr~0.base|)), Black: 1389#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)), Black: 1407#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|)), Black: 1433#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)), Black: 1439#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* |t1Thread1of1ForFork1_inc_top_#t~post31#1| 4) (- 4)))) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* |t1Thread1of1ForFork1_inc_top_#t~post31#1| 4) (- 4))) 2147483647) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1435#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (= ~top~0 3)), Black: 1381#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)), Black: 1387#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (= ~top~0 3)), Black: 1397#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1385#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (= ~top~0 3) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1413#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), 1293#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1146#(<= ~top~0 2), Black: 1200#(< ~top~0 798), Black: 1147#(<= ~top~0 3), Black: 1208#(< ~top~0 796), Black: 1204#(< ~top~0 797), Black: 1212#(< ~top~0 795), Black: 1185#(not (<= 800 ~top~0)), Black: 1145#(<= ~top~0 1), Black: 1148#(<= ~top~0 4), 1270#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1150#(<= ~top~0 5), Black: 1193#(< ~top~0 799), Black: 1260#(and (= |~#arr~0.offset| 0) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1262#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|)), 414#(and (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|))]) [2022-12-06 06:22:49,192 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-06 06:22:49,192 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 06:22:49,192 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 06:22:49,192 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 06:22:49,687 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([572] pop_returnLabel#1-->t2Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_37|) 0) InVars {t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_37|} OutVars{t2Thread1of1ForFork0_#t~ret44#1=|v_t2Thread1of1ForFork0_#t~ret44#1_65|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_37|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_#t~ret44#1][328], [1144#(= ~top~0 0), Black: 170#(<= ~top~0 1), Black: 215#(not (<= 800 ~top~0)), Black: 174#(<= ~top~0 0), Black: 1280#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 500#(and (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (or (and (<= (+ (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 4) (* ~top~0 4)) (= |~#arr~0.offset| 0)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647))) (or (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647)) (and (= |~#arr~0.offset| 0) (<= (+ (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 4) (* ~top~0 4)))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (exists ((aux_div_v_arrayElimCell_5_48 Int) (aux_mod_v_arrayElimCell_5_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_5_48 4294967296) aux_mod_v_arrayElimCell_5_48 1) 0) (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_5_48)) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (< 0 (+ (* aux_div_v_arrayElimCell_5_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_5_48)) (<= 4294966496 aux_mod_v_arrayElimCell_5_48) (< aux_mod_v_arrayElimCell_5_48 4294967296))) (= 3 |~#arr~0.base|)), Black: 498#(and (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (or (and (<= (+ (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 4) (* ~top~0 4)) (= |~#arr~0.offset| 0)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647))) (or (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647)) (and (= |~#arr~0.offset| 0) (<= (+ (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 4) (* ~top~0 4)))) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 502#(and (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 275#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799)), 909#(not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)), Black: 289#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799)), Black: 540#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (= |~#arr~0.offset| 0)), Black: 535#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 287#(or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)), Black: 544#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), 1255#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), 136#t2Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 723#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|)), Black: 719#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|)), Black: 695#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 752#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (= |~#arr~0.offset| 0) (<= (+ (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) 4294966497 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|)), Black: 728#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|) (or (< (* ~top~0 4) 4) (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))))), 282#true, Black: 798#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= (+ (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) 4294966497 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_9_48 4294967296) aux_mod_v_arrayElimCell_9_48 1) 0) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_9_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_9_48)))) (= 3 |~#arr~0.base|)), 533#(= |~#arr~0.offset| 0), 166#true, 271#true, Black: 971#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 1083#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0))), Black: 824#true, Black: 975#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 989#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 995#(and (<= (+ (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|))) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|)) (= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (< (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294967296) (= 3 |~#arr~0.base|)), Black: 1041#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), 41#L1024-1true, Black: 963#(and (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (forall ((v_ArrVal_472 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_472) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)))), Black: 987#(and (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 991#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 877#(not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)), Black: 952#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (exists ((aux_mod_v_arrayElimCell_15_49 Int) (aux_div_v_arrayElimCell_15_49 Int)) (and (<= (+ aux_mod_v_arrayElimCell_15_49 (* aux_div_v_arrayElimCell_15_49 4294967296) 1) 0) (= |t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_15_49)) 4294967296)) (<= 4294966496 aux_mod_v_arrayElimCell_15_49) (< aux_mod_v_arrayElimCell_15_49 4294967296) (< 0 (+ aux_mod_v_arrayElimCell_15_49 4294967297 (* aux_div_v_arrayElimCell_15_49 4294967296))))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 969#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (forall ((v_ArrVal_472 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_472) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)))), Black: 927#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (<= (* ~top~0 4) 4)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), 295#(= ~top~0 0), Black: 881#(not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)), Black: 967#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296) 4294966497) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 940#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 1101#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (or (and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (<= ~top~0 0))), Black: 1017#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 1095#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294))), Black: 1019#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= (+ (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|))) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|)) (= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (< (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294967296) (= 3 |~#arr~0.base|)), Black: 350#(< ~top~0 797), Black: 297#(<= ~top~0 2), Black: 299#(<= ~top~0 3), Black: 296#(<= ~top~0 1), 384#(= |~#arr~0.offset| 0), Black: 339#(< ~top~0 799), Black: 331#(not (<= 800 ~top~0)), Black: 343#(< ~top~0 798), 561#(= 3 |~#arr~0.base|), Black: 391#(and (or (<= (+ 4294966497 |t2Thread1of1ForFork0_pop_#res#1|) 0) (<= 0 |t2Thread1of1ForFork0_pop_#res#1|)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)))), t2Thread1of1ForFork0InUse, Black: 1419#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)), Black: 1379#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 160#(= ~top~0 0), Black: 1403#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1431#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1411#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|)), Black: 1395#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1417#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1437#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (= ~top~0 3)), Black: 1399#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1421#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (exists ((aux_div_v_arrayElimCell_21_49 Int) (aux_mod_v_arrayElimCell_21_49 Int)) (and (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_21_49)) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ (* aux_div_v_arrayElimCell_21_49 4294967296) aux_mod_v_arrayElimCell_21_49 1) 0) (< 0 (+ (* aux_div_v_arrayElimCell_21_49 4294967296) aux_mod_v_arrayElimCell_21_49 4294967297)) (< aux_mod_v_arrayElimCell_21_49 4294967296) (<= 4294966496 aux_mod_v_arrayElimCell_21_49))) (= 3 |~#arr~0.base|)), Black: 1389#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)), Black: 1407#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|)), Black: 1433#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)), Black: 1439#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* |t1Thread1of1ForFork1_inc_top_#t~post31#1| 4) (- 4)))) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* |t1Thread1of1ForFork1_inc_top_#t~post31#1| 4) (- 4))) 2147483647) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1435#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (= ~top~0 3)), Black: 1381#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)), Black: 1387#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (= ~top~0 3)), Black: 1397#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1385#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (<= (+ (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294966497 (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (= ~top~0 3) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1413#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), 1293#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1146#(<= ~top~0 2), Black: 1200#(< ~top~0 798), Black: 1147#(<= ~top~0 3), Black: 1208#(< ~top~0 796), Black: 1204#(< ~top~0 797), Black: 1212#(< ~top~0 795), Black: 1185#(not (<= 800 ~top~0)), Black: 1145#(<= ~top~0 1), 1270#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1148#(<= ~top~0 4), Black: 1150#(<= ~top~0 5), Black: 1193#(< ~top~0 799), Black: 1260#(and (= |~#arr~0.offset| 0) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 1262#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|)), 414#(and (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|))]) [2022-12-06 06:22:49,688 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-06 06:22:49,688 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:22:49,688 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:22:49,688 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event