/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-queue-add-2-nl.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 09:29:40,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 09:29:40,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 09:29:40,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 09:29:40,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 09:29:40,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 09:29:40,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 09:29:40,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 09:29:40,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 09:29:40,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 09:29:40,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 09:29:40,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 09:29:40,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 09:29:40,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 09:29:40,569 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 09:29:40,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 09:29:40,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 09:29:40,571 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 09:29:40,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 09:29:40,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 09:29:40,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 09:29:40,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 09:29:40,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 09:29:40,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 09:29:40,573 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 09:29:40,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 09:29:40,573 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 09:29:40,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 09:29:40,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 09:29:40,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 09:29:40,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:29:40,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 09:29:40,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 09:29:40,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 09:29:40,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 09:29:40,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 09:29:40,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 09:29:40,576 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 09:29:40,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 09:29:40,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 09:29:40,577 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 09:29:40,577 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 09:29:40,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 09:29:40,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 09:29:40,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 09:29:40,851 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 09:29:40,851 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 09:29:40,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-queue-add-2-nl.wvr_bound2.c [2023-08-04 09:29:42,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 09:29:42,234 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 09:29:42,234 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-queue-add-2-nl.wvr_bound2.c [2023-08-04 09:29:42,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a4dffc5/e49cb72261c24bf79345442c909cb430/FLAG34e955426 [2023-08-04 09:29:42,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a4dffc5/e49cb72261c24bf79345442c909cb430 [2023-08-04 09:29:42,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 09:29:42,257 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 09:29:42,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 09:29:42,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 09:29:42,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 09:29:42,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ef02bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42, skipping insertion in model container [2023-08-04 09:29:42,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,284 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 09:29:42,414 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-queue-add-2-nl.wvr_bound2.c[3032,3045] [2023-08-04 09:29:42,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:29:42,426 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 09:29:42,447 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-queue-add-2-nl.wvr_bound2.c[3032,3045] [2023-08-04 09:29:42,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:29:42,457 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:29:42,458 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:29:42,463 INFO L206 MainTranslator]: Completed translation [2023-08-04 09:29:42,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42 WrapperNode [2023-08-04 09:29:42,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 09:29:42,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 09:29:42,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 09:29:42,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 09:29:42,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,503 INFO L138 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 200 [2023-08-04 09:29:42,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 09:29:42,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 09:29:42,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 09:29:42,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 09:29:42,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 09:29:42,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 09:29:42,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 09:29:42,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 09:29:42,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (1/1) ... [2023-08-04 09:29:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:29:42,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:42,566 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) [2023-08-04 09:29:42,569 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 [2023-08-04 09:29:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 09:29:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 09:29:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 09:29:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 09:29:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 09:29:42,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 09:29:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 09:29:42,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 09:29:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 09:29:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 09:29:42,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 09:29:42,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 09:29:42,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 09:29:42,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 09:29:42,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 09:29:42,595 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 09:29:42,682 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 09:29:42,684 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 09:29:42,945 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 09:29:43,036 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 09:29:43,036 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-04 09:29:43,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:29:43 BoogieIcfgContainer [2023-08-04 09:29:43,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 09:29:43,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 09:29:43,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 09:29:43,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 09:29:43,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 09:29:42" (1/3) ... [2023-08-04 09:29:43,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1dee17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:29:43, skipping insertion in model container [2023-08-04 09:29:43,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:29:42" (2/3) ... [2023-08-04 09:29:43,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1dee17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:29:43, skipping insertion in model container [2023-08-04 09:29:43,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:29:43" (3/3) ... [2023-08-04 09:29:43,045 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-more-queue-add-2-nl.wvr_bound2.c [2023-08-04 09:29:43,064 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 09:29:43,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 09:29:43,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 09:29:43,074 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 09:29:43,139 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 09:29:43,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:43,282 INFO L124 PetriNetUnfolderBase]: 39/310 cut-off events. [2023-08-04 09:29:43,283 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:29:43,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 310 events. 39/310 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 915 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 183. Up to 8 conditions per place. [2023-08-04 09:29:43,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:43,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:43,299 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:29:43,306 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:43,308 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:43,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:43,372 INFO L124 PetriNetUnfolderBase]: 39/310 cut-off events. [2023-08-04 09:29:43,372 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:29:43,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 310 events. 39/310 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 915 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 183. Up to 8 conditions per place. [2023-08-04 09:29:43,379 INFO L119 LiptonReduction]: Number of co-enabled transitions 3076 [2023-08-04 09:29:47,522 INFO L134 LiptonReduction]: Checked pairs total: 5762 [2023-08-04 09:29:47,523 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-08-04 09:29:47,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:29:47,541 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@7b981b9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:29:47,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:29:47,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:29:47,546 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-04 09:29:47,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:29:47,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:47,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 09:29:47,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:47,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash 432217691, now seen corresponding path program 1 times [2023-08-04 09:29:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:47,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180711513] [2023-08-04 09:29:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:29:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180711513] [2023-08-04 09:29:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180711513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:29:47,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:29:47,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:29:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612459169] [2023-08-04 09:29:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:29:47,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:29:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:47,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:29:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:29:47,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 322 [2023-08-04 09:29:47,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 37 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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) [2023-08-04 09:29:47,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:47,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 322 [2023-08-04 09:29:47,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:47,998 INFO L124 PetriNetUnfolderBase]: 449/781 cut-off events. [2023-08-04 09:29:47,998 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-08-04 09:29:48,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 781 events. 449/781 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3587 event pairs, 168 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 1353. Up to 700 conditions per place. [2023-08-04 09:29:48,005 INFO L140 encePairwiseOnDemand]: 317/322 looper letters, 31 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2023-08-04 09:29:48,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 170 flow [2023-08-04 09:29:48,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:29:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:29:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-04 09:29:48,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47929606625258797 [2023-08-04 09:29:48,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-04 09:29:48,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-04 09:29:48,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:48,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-04 09:29:48,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2023-08-04 09:29:48,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-04 09:29:48,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-04 09:29:48,033 INFO L175 Difference]: Start difference. First operand has 34 places, 37 transitions, 96 flow. Second operand 3 states and 463 transitions. [2023-08-04 09:29:48,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 170 flow [2023-08-04 09:29:48,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:29:48,039 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 92 flow [2023-08-04 09:29:48,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-08-04 09:29:48,043 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-08-04 09:29:48,044 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 92 flow [2023-08-04 09:29:48,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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) [2023-08-04 09:29:48,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:48,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:48,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 09:29:48,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:48,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1138451236, now seen corresponding path program 1 times [2023-08-04 09:29:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358680924] [2023-08-04 09:29:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:48,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:29:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358680924] [2023-08-04 09:29:48,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358680924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272500455] [2023-08-04 09:29:48,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:48,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:48,177 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) [2023-08-04 09:29:48,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 09:29:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:48,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:29:48,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:29:48,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:29:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272500455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:29:48,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:29:48,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:29:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244745501] [2023-08-04 09:29:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:29:48,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:29:48,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:48,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:29:48,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:29:48,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 322 [2023-08-04 09:29:48,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-08-04 09:29:48,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:48,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 322 [2023-08-04 09:29:48,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:48,405 INFO L124 PetriNetUnfolderBase]: 444/727 cut-off events. [2023-08-04 09:29:48,405 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-04 09:29:48,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 727 events. 444/727 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2882 event pairs, 185 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 1301. Up to 631 conditions per place. [2023-08-04 09:29:48,411 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 35 selfloop transitions, 2 changer transitions 1/42 dead transitions. [2023-08-04 09:29:48,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 186 flow [2023-08-04 09:29:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:29:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:29:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-08-04 09:29:48,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813664596273292 [2023-08-04 09:29:48,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-08-04 09:29:48,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-08-04 09:29:48,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:48,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-08-04 09:29:48,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-08-04 09:29:48,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-04 09:29:48,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-04 09:29:48,429 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 92 flow. Second operand 3 states and 465 transitions. [2023-08-04 09:29:48,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 186 flow [2023-08-04 09:29:48,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 176 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 09:29:48,432 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 90 flow [2023-08-04 09:29:48,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2023-08-04 09:29:48,433 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-08-04 09:29:48,433 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 90 flow [2023-08-04 09:29:48,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-08-04 09:29:48,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:48,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:48,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 09:29:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:48,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:48,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1553541978, now seen corresponding path program 1 times [2023-08-04 09:29:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:48,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207079200] [2023-08-04 09:29:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:29:48,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:48,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207079200] [2023-08-04 09:29:48,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207079200] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:48,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665779076] [2023-08-04 09:29:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:48,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:48,769 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) [2023-08-04 09:29:48,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 09:29:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:48,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:29:48,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:29:48,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:29:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665779076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:29:48,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:29:48,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:29:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140466691] [2023-08-04 09:29:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:29:48,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:29:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:29:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:29:48,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 322 [2023-08-04 09:29:48,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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) [2023-08-04 09:29:48,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:48,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 322 [2023-08-04 09:29:48,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:49,007 INFO L124 PetriNetUnfolderBase]: 293/508 cut-off events. [2023-08-04 09:29:49,007 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-04 09:29:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 508 events. 293/508 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1876 event pairs, 128 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 398. Up to 335 conditions per place. [2023-08-04 09:29:49,011 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 39 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-04 09:29:49,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 200 flow [2023-08-04 09:29:49,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:29:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:29:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-08-04 09:29:49,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484472049689441 [2023-08-04 09:29:49,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-08-04 09:29:49,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-08-04 09:29:49,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:49,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-08-04 09:29:49,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2023-08-04 09:29:49,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-04 09:29:49,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-04 09:29:49,019 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 90 flow. Second operand 3 states and 468 transitions. [2023-08-04 09:29:49,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 200 flow [2023-08-04 09:29:49,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:29:49,021 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 98 flow [2023-08-04 09:29:49,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2023-08-04 09:29:49,022 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-08-04 09:29:49,022 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 98 flow [2023-08-04 09:29:49,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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) [2023-08-04 09:29:49,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:49,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:49,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 09:29:49,229 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,SelfDestructingSolverStorable2 [2023-08-04 09:29:49,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:49,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1671404287, now seen corresponding path program 1 times [2023-08-04 09:29:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736565426] [2023-08-04 09:29:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:29:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736565426] [2023-08-04 09:29:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736565426] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169429558] [2023-08-04 09:29:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:49,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:49,353 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) [2023-08-04 09:29:49,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 09:29:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:49,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:29:49,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:29:49,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:29:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169429558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:29:49,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:29:49,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:29:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950566762] [2023-08-04 09:29:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:29:49,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:29:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:29:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:29:49,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 322 [2023-08-04 09:29:49,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-04 09:29:49,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:49,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 322 [2023-08-04 09:29:49,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:49,569 INFO L124 PetriNetUnfolderBase]: 282/490 cut-off events. [2023-08-04 09:29:49,569 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-08-04 09:29:49,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 490 events. 282/490 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1801 event pairs, 177 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 509. Up to 422 conditions per place. [2023-08-04 09:29:49,575 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-04 09:29:49,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 194 flow [2023-08-04 09:29:49,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:29:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:29:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-08-04 09:29:49,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813664596273292 [2023-08-04 09:29:49,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-08-04 09:29:49,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-08-04 09:29:49,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:49,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-08-04 09:29:49,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-08-04 09:29:49,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-04 09:29:49,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-04 09:29:49,582 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 98 flow. Second operand 3 states and 465 transitions. [2023-08-04 09:29:49,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 194 flow [2023-08-04 09:29:49,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:29:49,586 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 100 flow [2023-08-04 09:29:49,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-08-04 09:29:49,587 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-08-04 09:29:49,587 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 100 flow [2023-08-04 09:29:49,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-04 09:29:49,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:49,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:49,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 09:29:49,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:49,793 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:49,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:49,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1803542347, now seen corresponding path program 1 times [2023-08-04 09:29:49,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:49,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552207027] [2023-08-04 09:29:49,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:49,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:29:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552207027] [2023-08-04 09:29:49,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552207027] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138739181] [2023-08-04 09:29:49,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:49,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:49,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:49,905 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) [2023-08-04 09:29:49,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 09:29:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:49,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-04 09:29:49,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:29:50,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:29:50,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138739181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:29:50,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:29:50,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-08-04 09:29:50,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582376799] [2023-08-04 09:29:50,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:29:50,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:29:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:29:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-04 09:29:50,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 322 [2023-08-04 09:29:50,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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) [2023-08-04 09:29:50,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:50,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 322 [2023-08-04 09:29:50,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:50,195 INFO L124 PetriNetUnfolderBase]: 286/509 cut-off events. [2023-08-04 09:29:50,195 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-04 09:29:50,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 509 events. 286/509 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1909 event pairs, 195 based on Foata normal form. 20/435 useless extension candidates. Maximal degree in co-relation 1008. Up to 460 conditions per place. [2023-08-04 09:29:50,198 INFO L140 encePairwiseOnDemand]: 316/322 looper letters, 28 selfloop transitions, 2 changer transitions 11/45 dead transitions. [2023-08-04 09:29:50,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 220 flow [2023-08-04 09:29:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:29:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:29:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 604 transitions. [2023-08-04 09:29:50,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468944099378882 [2023-08-04 09:29:50,200 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 604 transitions. [2023-08-04 09:29:50,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 604 transitions. [2023-08-04 09:29:50,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:50,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 604 transitions. [2023-08-04 09:29:50,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 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) [2023-08-04 09:29:50,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 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) [2023-08-04 09:29:50,205 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 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) [2023-08-04 09:29:50,205 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 100 flow. Second operand 4 states and 604 transitions. [2023-08-04 09:29:50,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 220 flow [2023-08-04 09:29:50,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:29:50,207 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2023-08-04 09:29:50,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2023-08-04 09:29:50,208 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-08-04 09:29:50,208 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 114 flow [2023-08-04 09:29:50,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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) [2023-08-04 09:29:50,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:50,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:50,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 09:29:50,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:50,415 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:50,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash -478598858, now seen corresponding path program 1 times [2023-08-04 09:29:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:50,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594018108] [2023-08-04 09:29:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:29:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594018108] [2023-08-04 09:29:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594018108] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:50,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577334009] [2023-08-04 09:29:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:50,479 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) [2023-08-04 09:29:50,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 09:29:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:50,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:29:50,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:29:50,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:29:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:29:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577334009] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:29:50,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:29:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:29:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972984236] [2023-08-04 09:29:50,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:29:50,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:29:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:29:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:29:50,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 322 [2023-08-04 09:29:50,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 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) [2023-08-04 09:29:50,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:50,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 322 [2023-08-04 09:29:50,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:50,639 INFO L124 PetriNetUnfolderBase]: 13/32 cut-off events. [2023-08-04 09:29:50,639 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 09:29:50,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 32 events. 13/32 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 5/32 useless extension candidates. Maximal degree in co-relation 83. Up to 21 conditions per place. [2023-08-04 09:29:50,639 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2023-08-04 09:29:50,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 88 flow [2023-08-04 09:29:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:29:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:29:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 580 transitions. [2023-08-04 09:29:50,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4503105590062112 [2023-08-04 09:29:50,641 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 580 transitions. [2023-08-04 09:29:50,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 580 transitions. [2023-08-04 09:29:50,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:50,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 580 transitions. [2023-08-04 09:29:50,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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) [2023-08-04 09:29:50,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 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) [2023-08-04 09:29:50,646 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 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) [2023-08-04 09:29:50,646 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 114 flow. Second operand 4 states and 580 transitions. [2023-08-04 09:29:50,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 88 flow [2023-08-04 09:29:50,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 74 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-04 09:29:50,647 INFO L231 Difference]: Finished difference. Result has 20 places, 0 transitions, 0 flow [2023-08-04 09:29:50,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=20, PETRI_TRANSITIONS=0} [2023-08-04 09:29:50,647 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -14 predicate places. [2023-08-04 09:29:50,647 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 0 transitions, 0 flow [2023-08-04 09:29:50,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 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) [2023-08-04 09:29:50,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:29:50,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 09:29:50,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:50,864 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 09:29:50,865 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 09:29:50,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:50,890 INFO L124 PetriNetUnfolderBase]: 39/310 cut-off events. [2023-08-04 09:29:50,890 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:29:50,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 310 events. 39/310 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 915 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 183. Up to 8 conditions per place. [2023-08-04 09:29:50,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:50,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:50,892 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:29:50,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:50,893 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:50,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 168 transitions, 358 flow [2023-08-04 09:29:50,913 INFO L124 PetriNetUnfolderBase]: 39/310 cut-off events. [2023-08-04 09:29:50,913 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:29:50,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 310 events. 39/310 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 915 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 183. Up to 8 conditions per place. [2023-08-04 09:29:50,916 INFO L119 LiptonReduction]: Number of co-enabled transitions 3076 [2023-08-04 09:29:54,896 INFO L134 LiptonReduction]: Checked pairs total: 5822 [2023-08-04 09:29:54,896 INFO L136 LiptonReduction]: Total number of compositions: 152 [2023-08-04 09:29:54,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 09:29:54,899 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@7b981b9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:29:54,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 09:29:54,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:29:54,902 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2023-08-04 09:29:54,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:29:54,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:54,902 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 09:29:54,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 09:29:54,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1653395196, now seen corresponding path program 1 times [2023-08-04 09:29:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796543986] [2023-08-04 09:29:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:29:54,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 09:29:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:29:54,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 09:29:54,952 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 09:29:54,953 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 09:29:54,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 09:29:54,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 09:29:54,953 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 09:29:54,954 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 09:29:54,954 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 09:29:54,954 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 09:29:54,973 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 09:29:54,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 199 transitions, 446 flow [2023-08-04 09:29:55,046 INFO L124 PetriNetUnfolderBase]: 144/896 cut-off events. [2023-08-04 09:29:55,046 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:29:55,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 896 events. 144/896 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4422 event pairs, 1 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 547. Up to 32 conditions per place. [2023-08-04 09:29:55,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 199 transitions, 446 flow [2023-08-04 09:29:55,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 199 transitions, 446 flow [2023-08-04 09:29:55,054 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:29:55,054 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 199 transitions, 446 flow [2023-08-04 09:29:55,055 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 199 transitions, 446 flow [2023-08-04 09:29:55,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 199 transitions, 446 flow [2023-08-04 09:29:55,129 INFO L124 PetriNetUnfolderBase]: 144/896 cut-off events. [2023-08-04 09:29:55,129 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:29:55,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 896 events. 144/896 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4422 event pairs, 1 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 547. Up to 32 conditions per place. [2023-08-04 09:29:55,173 INFO L119 LiptonReduction]: Number of co-enabled transitions 7904 [2023-08-04 09:29:59,151 INFO L134 LiptonReduction]: Checked pairs total: 18061 [2023-08-04 09:29:59,151 INFO L136 LiptonReduction]: Total number of compositions: 169 [2023-08-04 09:29:59,155 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:29:59,156 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@7b981b9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:29:59,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:29:59,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:29:59,159 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-04 09:29:59,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:29:59,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:59,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 09:29:59,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:59,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash -504694527, now seen corresponding path program 1 times [2023-08-04 09:29:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:59,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360314163] [2023-08-04 09:29:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:29:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:59,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360314163] [2023-08-04 09:29:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360314163] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:29:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:29:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:29:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765077957] [2023-08-04 09:29:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:29:59,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:29:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:29:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:29:59,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 368 [2023-08-04 09:29:59,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 56 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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) [2023-08-04 09:29:59,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:59,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 368 [2023-08-04 09:29:59,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:02,336 INFO L124 PetriNetUnfolderBase]: 27253/37109 cut-off events. [2023-08-04 09:30:02,336 INFO L125 PetriNetUnfolderBase]: For 2965/2965 co-relation queries the response was YES. [2023-08-04 09:30:02,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73821 conditions, 37109 events. 27253/37109 cut-off events. For 2965/2965 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 215899 event pairs, 14477 based on Foata normal form. 0/26629 useless extension candidates. Maximal degree in co-relation 24008. Up to 34695 conditions per place. [2023-08-04 09:30:02,535 INFO L140 encePairwiseOnDemand]: 362/368 looper letters, 47 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2023-08-04 09:30:02,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 264 flow [2023-08-04 09:30:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:30:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:30:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2023-08-04 09:30:02,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2023-08-04 09:30:02,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2023-08-04 09:30:02,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2023-08-04 09:30:02,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:02,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2023-08-04 09:30:02,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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) [2023-08-04 09:30:02,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 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) [2023-08-04 09:30:02,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 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) [2023-08-04 09:30:02,545 INFO L175 Difference]: Start difference. First operand has 50 places, 56 transitions, 160 flow. Second operand 3 states and 536 transitions. [2023-08-04 09:30:02,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 264 flow [2023-08-04 09:30:02,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:30:02,550 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 154 flow [2023-08-04 09:30:02,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2023-08-04 09:30:02,552 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-04 09:30:02,552 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 154 flow [2023-08-04 09:30:02,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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) [2023-08-04 09:30:02,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:02,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:02,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 09:30:02,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:02,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:02,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1745810801, now seen corresponding path program 1 times [2023-08-04 09:30:02,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:02,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713900659] [2023-08-04 09:30:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:30:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713900659] [2023-08-04 09:30:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713900659] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197529191] [2023-08-04 09:30:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:02,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:02,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:02,598 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) [2023-08-04 09:30:02,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 09:30:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:02,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:30:02,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:30:02,675 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:30:02,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197529191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:30:02,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:30:02,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:30:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118912486] [2023-08-04 09:30:02,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:30:02,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:30:02,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:30:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:30:02,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 368 [2023-08-04 09:30:02,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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) [2023-08-04 09:30:02,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:02,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 368 [2023-08-04 09:30:02,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:05,034 INFO L124 PetriNetUnfolderBase]: 27219/36818 cut-off events. [2023-08-04 09:30:05,034 INFO L125 PetriNetUnfolderBase]: For 2384/2384 co-relation queries the response was YES. [2023-08-04 09:30:05,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73308 conditions, 36818 events. 27219/36818 cut-off events. For 2384/2384 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 212905 event pairs, 13612 based on Foata normal form. 0/26506 useless extension candidates. Maximal degree in co-relation 31108. Up to 34061 conditions per place. [2023-08-04 09:30:05,208 INFO L140 encePairwiseOnDemand]: 365/368 looper letters, 56 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-04 09:30:05,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 298 flow [2023-08-04 09:30:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:30:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:30:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2023-08-04 09:30:05,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490036231884058 [2023-08-04 09:30:05,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2023-08-04 09:30:05,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2023-08-04 09:30:05,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:05,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2023-08-04 09:30:05,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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) [2023-08-04 09:30:05,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 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) [2023-08-04 09:30:05,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 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) [2023-08-04 09:30:05,216 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 154 flow. Second operand 3 states and 541 transitions. [2023-08-04 09:30:05,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 298 flow [2023-08-04 09:30:05,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 290 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 09:30:05,226 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 158 flow [2023-08-04 09:30:05,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2023-08-04 09:30:05,229 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-04 09:30:05,229 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 158 flow [2023-08-04 09:30:05,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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) [2023-08-04 09:30:05,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:05,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:05,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:05,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:05,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:05,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1186615623, now seen corresponding path program 1 times [2023-08-04 09:30:05,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:05,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282943530] [2023-08-04 09:30:05,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:30:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282943530] [2023-08-04 09:30:05,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282943530] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:05,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666894412] [2023-08-04 09:30:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:05,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:05,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:05,480 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) [2023-08-04 09:30:05,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 09:30:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:05,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:30:05,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:30:05,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:30:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666894412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:30:05,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:30:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:30:05,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120275998] [2023-08-04 09:30:05,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:30:05,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:30:05,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:30:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:30:05,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 368 [2023-08-04 09:30:05,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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) [2023-08-04 09:30:05,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:05,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 368 [2023-08-04 09:30:05,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:07,419 INFO L124 PetriNetUnfolderBase]: 21831/29644 cut-off events. [2023-08-04 09:30:07,419 INFO L125 PetriNetUnfolderBase]: For 2173/2173 co-relation queries the response was YES. [2023-08-04 09:30:07,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60688 conditions, 29644 events. 21831/29644 cut-off events. For 2173/2173 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 166272 event pairs, 10410 based on Foata normal form. 0/22196 useless extension candidates. Maximal degree in co-relation 14508. Up to 20313 conditions per place. [2023-08-04 09:30:07,559 INFO L140 encePairwiseOnDemand]: 365/368 looper letters, 65 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-08-04 09:30:07,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 346 flow [2023-08-04 09:30:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:30:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:30:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2023-08-04 09:30:07,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49728260869565216 [2023-08-04 09:30:07,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2023-08-04 09:30:07,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2023-08-04 09:30:07,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:07,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2023-08-04 09:30:07,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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) [2023-08-04 09:30:07,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 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) [2023-08-04 09:30:07,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 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) [2023-08-04 09:30:07,566 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 158 flow. Second operand 3 states and 549 transitions. [2023-08-04 09:30:07,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 346 flow [2023-08-04 09:30:07,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:30:07,569 INFO L231 Difference]: Finished difference. Result has 52 places, 54 transitions, 168 flow [2023-08-04 09:30:07,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=52, PETRI_TRANSITIONS=54} [2023-08-04 09:30:07,570 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-04 09:30:07,570 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 168 flow [2023-08-04 09:30:07,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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) [2023-08-04 09:30:07,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:07,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:07,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:07,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:07,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:07,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash -549264933, now seen corresponding path program 1 times [2023-08-04 09:30:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:07,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505962774] [2023-08-04 09:30:07,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:07,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:30:07,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:07,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505962774] [2023-08-04 09:30:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505962774] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:07,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999913592] [2023-08-04 09:30:07,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:07,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:07,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:07,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:07,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 09:30:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:07,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:30:07,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:30:07,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:30:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999913592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:30:07,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:30:07,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:30:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674171126] [2023-08-04 09:30:07,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:30:07,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:30:07,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:07,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:30:07,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:30:07,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 368 [2023-08-04 09:30:07,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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) [2023-08-04 09:30:07,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:07,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 368 [2023-08-04 09:30:07,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:09,924 INFO L124 PetriNetUnfolderBase]: 21153/29090 cut-off events. [2023-08-04 09:30:09,924 INFO L125 PetriNetUnfolderBase]: For 5602/5602 co-relation queries the response was YES. [2023-08-04 09:30:09,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61514 conditions, 29090 events. 21153/29090 cut-off events. For 5602/5602 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 164295 event pairs, 12230 based on Foata normal form. 0/22648 useless extension candidates. Maximal degree in co-relation 19561. Up to 22942 conditions per place. [2023-08-04 09:30:10,092 INFO L140 encePairwiseOnDemand]: 365/368 looper letters, 66 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-04 09:30:10,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 358 flow [2023-08-04 09:30:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:30:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:30:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2023-08-04 09:30:10,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49728260869565216 [2023-08-04 09:30:10,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2023-08-04 09:30:10,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2023-08-04 09:30:10,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:10,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2023-08-04 09:30:10,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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) [2023-08-04 09:30:10,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 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) [2023-08-04 09:30:10,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 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) [2023-08-04 09:30:10,098 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 168 flow. Second operand 3 states and 549 transitions. [2023-08-04 09:30:10,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 358 flow [2023-08-04 09:30:10,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:30:10,134 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 178 flow [2023-08-04 09:30:10,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2023-08-04 09:30:10,135 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-04 09:30:10,135 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 178 flow [2023-08-04 09:30:10,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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) [2023-08-04 09:30:10,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:10,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:10,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:10,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 09:30:10,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:10,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1359378420, now seen corresponding path program 1 times [2023-08-04 09:30:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813306358] [2023-08-04 09:30:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:30:10,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813306358] [2023-08-04 09:30:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813306358] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526527254] [2023-08-04 09:30:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:10,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:10,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:10,400 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:10,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 09:30:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:10,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-04 09:30:10,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:30:10,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:30:10,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526527254] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:30:10,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:30:10,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-08-04 09:30:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133589876] [2023-08-04 09:30:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:30:10,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:30:10,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:10,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:30:10,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-04 09:30:10,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 368 [2023-08-04 09:30:10,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 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) [2023-08-04 09:30:10,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:10,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 368 [2023-08-04 09:30:10,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:12,552 INFO L124 PetriNetUnfolderBase]: 21197/29217 cut-off events. [2023-08-04 09:30:12,552 INFO L125 PetriNetUnfolderBase]: For 4762/4762 co-relation queries the response was YES. [2023-08-04 09:30:12,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62287 conditions, 29217 events. 21197/29217 cut-off events. For 4762/4762 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 165400 event pairs, 14575 based on Foata normal form. 155/23070 useless extension candidates. Maximal degree in co-relation 48462. Up to 27490 conditions per place. [2023-08-04 09:30:12,663 INFO L140 encePairwiseOnDemand]: 359/368 looper letters, 46 selfloop transitions, 2 changer transitions 16/72 dead transitions. [2023-08-04 09:30:12,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 372 flow [2023-08-04 09:30:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:30:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:30:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions. [2023-08-04 09:30:12,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47554347826086957 [2023-08-04 09:30:12,666 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 700 transitions. [2023-08-04 09:30:12,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 700 transitions. [2023-08-04 09:30:12,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:12,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 700 transitions. [2023-08-04 09:30:12,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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) [2023-08-04 09:30:12,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:30:12,670 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:30:12,670 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 178 flow. Second operand 4 states and 700 transitions. [2023-08-04 09:30:12,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 372 flow [2023-08-04 09:30:12,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:30:12,798 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 200 flow [2023-08-04 09:30:12,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2023-08-04 09:30:12,799 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-08-04 09:30:12,799 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 200 flow [2023-08-04 09:30:12,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 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) [2023-08-04 09:30:12,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:12,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:12,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-04 09:30:13,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:13,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:13,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash -759965644, now seen corresponding path program 1 times [2023-08-04 09:30:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:13,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223024465] [2023-08-04 09:30:13,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:13,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:30:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:13,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223024465] [2023-08-04 09:30:13,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223024465] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:13,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943129178] [2023-08-04 09:30:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:13,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:13,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:13,051 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:13,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 09:30:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:13,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:30:13,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:30:13,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:30:13,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943129178] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:13,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:13,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:30:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252627179] [2023-08-04 09:30:13,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:13,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:30:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:13,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:30:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:30:13,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 368 [2023-08-04 09:30:13,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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) [2023-08-04 09:30:13,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:13,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 368 [2023-08-04 09:30:13,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:15,103 INFO L124 PetriNetUnfolderBase]: 19569/26786 cut-off events. [2023-08-04 09:30:15,103 INFO L125 PetriNetUnfolderBase]: For 8165/8165 co-relation queries the response was YES. [2023-08-04 09:30:15,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66526 conditions, 26786 events. 19569/26786 cut-off events. For 8165/8165 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 148214 event pairs, 6760 based on Foata normal form. 5/20944 useless extension candidates. Maximal degree in co-relation 66506. Up to 25187 conditions per place. [2023-08-04 09:30:15,359 INFO L140 encePairwiseOnDemand]: 364/368 looper letters, 58 selfloop transitions, 3 changer transitions 1/70 dead transitions. [2023-08-04 09:30:15,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 364 flow [2023-08-04 09:30:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:30:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:30:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions. [2023-08-04 09:30:15,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748641304347826 [2023-08-04 09:30:15,362 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 699 transitions. [2023-08-04 09:30:15,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions. [2023-08-04 09:30:15,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:15,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions. [2023-08-04 09:30:15,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 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) [2023-08-04 09:30:15,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:30:15,366 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:30:15,367 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 200 flow. Second operand 4 states and 699 transitions. [2023-08-04 09:30:15,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 364 flow [2023-08-04 09:30:15,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 360 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:30:15,429 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 210 flow [2023-08-04 09:30:15,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-04 09:30:15,429 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-04 09:30:15,430 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 210 flow [2023-08-04 09:30:15,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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) [2023-08-04 09:30:15,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:15,430 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:15,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:15,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 09:30:15,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:15,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1831714614, now seen corresponding path program 1 times [2023-08-04 09:30:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:15,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458204518] [2023-08-04 09:30:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 09:30:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458204518] [2023-08-04 09:30:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458204518] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678761158] [2023-08-04 09:30:15,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:15,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:15,690 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:15,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 09:30:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:15,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 09:30:15,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:30:15,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:30:15,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678761158] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:15,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:15,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2023-08-04 09:30:15,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59460031] [2023-08-04 09:30:15,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:15,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-04 09:30:15,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-04 09:30:15,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 09:30:16,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 368 [2023-08-04 09:30:16,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 210 flow. Second operand has 11 states, 11 states have (on average 154.63636363636363) internal successors, (1701), 11 states have internal predecessors, (1701), 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) [2023-08-04 09:30:16,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:16,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 368 [2023-08-04 09:30:16,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:18,317 INFO L124 PetriNetUnfolderBase]: 21647/30285 cut-off events. [2023-08-04 09:30:18,317 INFO L125 PetriNetUnfolderBase]: For 10762/10762 co-relation queries the response was YES. [2023-08-04 09:30:18,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74796 conditions, 30285 events. 21647/30285 cut-off events. For 10762/10762 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 177147 event pairs, 6610 based on Foata normal form. 2180/26266 useless extension candidates. Maximal degree in co-relation 62838. Up to 18669 conditions per place. [2023-08-04 09:30:18,477 INFO L140 encePairwiseOnDemand]: 355/368 looper letters, 145 selfloop transitions, 30 changer transitions 3/186 dead transitions. [2023-08-04 09:30:18,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 186 transitions, 1014 flow [2023-08-04 09:30:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 09:30:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 09:30:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1986 transitions. [2023-08-04 09:30:18,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44972826086956524 [2023-08-04 09:30:18,483 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1986 transitions. [2023-08-04 09:30:18,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1986 transitions. [2023-08-04 09:30:18,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:18,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1986 transitions. [2023-08-04 09:30:18,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 165.5) internal successors, (1986), 12 states have internal predecessors, (1986), 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) [2023-08-04 09:30:18,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 368.0) internal successors, (4784), 13 states have internal predecessors, (4784), 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) [2023-08-04 09:30:18,496 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 368.0) internal successors, (4784), 13 states have internal predecessors, (4784), 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) [2023-08-04 09:30:18,496 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 210 flow. Second operand 12 states and 1986 transitions. [2023-08-04 09:30:18,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 186 transitions, 1014 flow [2023-08-04 09:30:18,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 186 transitions, 991 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-04 09:30:18,657 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 502 flow [2023-08-04 09:30:18,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=502, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2023-08-04 09:30:18,657 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2023-08-04 09:30:18,657 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 502 flow [2023-08-04 09:30:18,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 154.63636363636363) internal successors, (1701), 11 states have internal predecessors, (1701), 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) [2023-08-04 09:30:18,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:18,658 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:18,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:18,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 09:30:18,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:18,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1749224085, now seen corresponding path program 1 times [2023-08-04 09:30:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953448219] [2023-08-04 09:30:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:18,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 09:30:18,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:18,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953448219] [2023-08-04 09:30:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953448219] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002369457] [2023-08-04 09:30:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:18,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:18,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:18,923 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:18,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 09:30:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:19,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:30:19,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 09:30:19,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 09:30:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002369457] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:19,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:30:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180134085] [2023-08-04 09:30:19,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:19,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:30:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:19,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:30:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:30:19,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 368 [2023-08-04 09:30:19,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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) [2023-08-04 09:30:19,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:19,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 368 [2023-08-04 09:30:19,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:20,842 INFO L124 PetriNetUnfolderBase]: 15415/21721 cut-off events. [2023-08-04 09:30:20,843 INFO L125 PetriNetUnfolderBase]: For 88179/88179 co-relation queries the response was YES. [2023-08-04 09:30:20,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92625 conditions, 21721 events. 15415/21721 cut-off events. For 88179/88179 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 121685 event pairs, 4141 based on Foata normal form. 464/17702 useless extension candidates. Maximal degree in co-relation 87771. Up to 8521 conditions per place. [2023-08-04 09:30:20,970 INFO L140 encePairwiseOnDemand]: 364/368 looper letters, 98 selfloop transitions, 4 changer transitions 15/125 dead transitions. [2023-08-04 09:30:20,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 125 transitions, 1009 flow [2023-08-04 09:30:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:30:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:30:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 723 transitions. [2023-08-04 09:30:20,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49116847826086957 [2023-08-04 09:30:20,972 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 723 transitions. [2023-08-04 09:30:20,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 723 transitions. [2023-08-04 09:30:20,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:20,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 723 transitions. [2023-08-04 09:30:20,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 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) [2023-08-04 09:30:20,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:30:20,976 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:30:20,976 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 502 flow. Second operand 4 states and 723 transitions. [2023-08-04 09:30:20,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 125 transitions, 1009 flow [2023-08-04 09:30:21,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 939 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-08-04 09:30:21,047 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 399 flow [2023-08-04 09:30:21,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2023-08-04 09:30:21,047 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2023-08-04 09:30:21,047 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 399 flow [2023-08-04 09:30:21,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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) [2023-08-04 09:30:21,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:21,048 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:21,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:21,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 09:30:21,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:21,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1644220582, now seen corresponding path program 1 times [2023-08-04 09:30:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593879192] [2023-08-04 09:30:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:30:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593879192] [2023-08-04 09:30:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593879192] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671013451] [2023-08-04 09:30:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:21,332 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:21,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 09:30:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:21,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:30:21,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:30:21,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:30:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671013451] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:21,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:21,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:30:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185015502] [2023-08-04 09:30:21,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:21,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:30:21,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:21,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:30:21,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:30:21,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 368 [2023-08-04 09:30:21,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 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) [2023-08-04 09:30:21,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:21,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 368 [2023-08-04 09:30:21,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:23,488 INFO L124 PetriNetUnfolderBase]: 14369/20102 cut-off events. [2023-08-04 09:30:23,489 INFO L125 PetriNetUnfolderBase]: For 89446/89446 co-relation queries the response was YES. [2023-08-04 09:30:23,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89736 conditions, 20102 events. 14369/20102 cut-off events. For 89446/89446 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 109849 event pairs, 9541 based on Foata normal form. 21/15760 useless extension candidates. Maximal degree in co-relation 84936. Up to 17783 conditions per place. [2023-08-04 09:30:23,659 INFO L140 encePairwiseOnDemand]: 364/368 looper letters, 83 selfloop transitions, 3 changer transitions 15/109 dead transitions. [2023-08-04 09:30:23,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 825 flow [2023-08-04 09:30:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:30:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:30:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 723 transitions. [2023-08-04 09:30:23,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49116847826086957 [2023-08-04 09:30:23,662 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 723 transitions. [2023-08-04 09:30:23,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 723 transitions. [2023-08-04 09:30:23,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:23,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 723 transitions. [2023-08-04 09:30:23,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 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) [2023-08-04 09:30:23,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:30:23,666 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:30:23,666 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 399 flow. Second operand 4 states and 723 transitions. [2023-08-04 09:30:23,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 825 flow [2023-08-04 09:30:23,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 109 transitions, 785 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-08-04 09:30:23,786 INFO L231 Difference]: Finished difference. Result has 83 places, 57 transitions, 298 flow [2023-08-04 09:30:23,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=83, PETRI_TRANSITIONS=57} [2023-08-04 09:30:23,787 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-04 09:30:23,787 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 57 transitions, 298 flow [2023-08-04 09:30:23,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 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) [2023-08-04 09:30:23,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:23,787 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:23,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:23,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 09:30:23,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:23,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1509494197, now seen corresponding path program 1 times [2023-08-04 09:30:23,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082091717] [2023-08-04 09:30:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:30:25,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082091717] [2023-08-04 09:30:25,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082091717] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707687760] [2023-08-04 09:30:25,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:25,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:25,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:25,048 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:25,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 09:30:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:25,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-04 09:30:25,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:25,320 INFO L351 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 13 treesize of output 9 [2023-08-04 09:30:25,471 INFO L351 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 17 treesize of output 9 [2023-08-04 09:30:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:30:25,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:25,890 INFO L351 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 38 treesize of output 34 [2023-08-04 09:30:25,895 INFO L351 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 50 treesize of output 42 [2023-08-04 09:30:25,929 INFO L351 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 40 treesize of output 36 [2023-08-04 09:30:25,935 INFO L351 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 54 treesize of output 46 [2023-08-04 09:30:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:30:26,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707687760] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:26,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:26,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 26 [2023-08-04 09:30:26,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280680374] [2023-08-04 09:30:26,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:26,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-04 09:30:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:26,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-04 09:30:26,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2023-08-04 09:30:27,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 368 [2023-08-04 09:30:27,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 57 transitions, 298 flow. Second operand has 26 states, 26 states have (on average 148.03846153846155) internal successors, (3849), 26 states have internal predecessors, (3849), 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) [2023-08-04 09:30:27,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:27,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 368 [2023-08-04 09:30:27,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:30,897 INFO L124 PetriNetUnfolderBase]: 14875/19647 cut-off events. [2023-08-04 09:30:30,898 INFO L125 PetriNetUnfolderBase]: For 68497/68497 co-relation queries the response was YES. [2023-08-04 09:30:30,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84519 conditions, 19647 events. 14875/19647 cut-off events. For 68497/68497 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 95532 event pairs, 179 based on Foata normal form. 15/15158 useless extension candidates. Maximal degree in co-relation 84476. Up to 12037 conditions per place. [2023-08-04 09:30:31,064 INFO L140 encePairwiseOnDemand]: 354/368 looper letters, 199 selfloop transitions, 18 changer transitions 8/231 dead transitions. [2023-08-04 09:30:31,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 231 transitions, 1816 flow [2023-08-04 09:30:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 09:30:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 09:30:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2672 transitions. [2023-08-04 09:30:31,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42710997442455245 [2023-08-04 09:30:31,070 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2672 transitions. [2023-08-04 09:30:31,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2672 transitions. [2023-08-04 09:30:31,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:31,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2672 transitions. [2023-08-04 09:30:31,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 157.1764705882353) internal successors, (2672), 17 states have internal predecessors, (2672), 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) [2023-08-04 09:30:31,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 368.0) internal successors, (6624), 18 states have internal predecessors, (6624), 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) [2023-08-04 09:30:31,084 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 368.0) internal successors, (6624), 18 states have internal predecessors, (6624), 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) [2023-08-04 09:30:31,084 INFO L175 Difference]: Start difference. First operand has 83 places, 57 transitions, 298 flow. Second operand 17 states and 2672 transitions. [2023-08-04 09:30:31,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 231 transitions, 1816 flow [2023-08-04 09:30:31,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 231 transitions, 1328 flow, removed 239 selfloop flow, removed 8 redundant places. [2023-08-04 09:30:31,289 INFO L231 Difference]: Finished difference. Result has 87 places, 61 transitions, 306 flow [2023-08-04 09:30:31,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=306, PETRI_PLACES=87, PETRI_TRANSITIONS=61} [2023-08-04 09:30:31,289 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 37 predicate places. [2023-08-04 09:30:31,289 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 61 transitions, 306 flow [2023-08-04 09:30:31,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 148.03846153846155) internal successors, (3849), 26 states have internal predecessors, (3849), 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) [2023-08-04 09:30:31,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:31,290 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:31,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-04 09:30:31,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:31,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:31,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1462957431, now seen corresponding path program 2 times [2023-08-04 09:30:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969587754] [2023-08-04 09:30:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:30:32,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:32,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969587754] [2023-08-04 09:30:32,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969587754] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:32,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197031191] [2023-08-04 09:30:32,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:30:32,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:32,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:32,296 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:32,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 09:30:32,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:30:32,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:30:32,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-04 09:30:32,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:30:33,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:30:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197031191] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:33,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2023-08-04 09:30:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994206103] [2023-08-04 09:30:33,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-04 09:30:33,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-04 09:30:33,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2023-08-04 09:30:34,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 368 [2023-08-04 09:30:34,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 61 transitions, 306 flow. Second operand has 26 states, 26 states have (on average 144.92307692307693) internal successors, (3768), 26 states have internal predecessors, (3768), 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) [2023-08-04 09:30:34,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:34,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 368 [2023-08-04 09:30:34,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:46,313 INFO L124 PetriNetUnfolderBase]: 82557/110874 cut-off events. [2023-08-04 09:30:46,313 INFO L125 PetriNetUnfolderBase]: For 120415/120415 co-relation queries the response was YES. [2023-08-04 09:30:46,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326183 conditions, 110874 events. 82557/110874 cut-off events. For 120415/120415 co-relation queries the response was YES. Maximal size of possible extension queue 2378. Compared 687788 event pairs, 2684 based on Foata normal form. 3/93601 useless extension candidates. Maximal degree in co-relation 326143. Up to 31455 conditions per place. [2023-08-04 09:30:47,005 INFO L140 encePairwiseOnDemand]: 349/368 looper letters, 628 selfloop transitions, 240 changer transitions 10/885 dead transitions. [2023-08-04 09:30:47,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 885 transitions, 6112 flow [2023-08-04 09:30:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-04 09:30:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-04 09:30:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5456 transitions. [2023-08-04 09:30:47,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2023-08-04 09:30:47,018 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 5456 transitions. [2023-08-04 09:30:47,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 5456 transitions. [2023-08-04 09:30:47,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:47,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 5456 transitions. [2023-08-04 09:30:47,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 165.33333333333334) internal successors, (5456), 33 states have internal predecessors, (5456), 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) [2023-08-04 09:30:47,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 368.0) internal successors, (12512), 34 states have internal predecessors, (12512), 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) [2023-08-04 09:30:47,045 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 368.0) internal successors, (12512), 34 states have internal predecessors, (12512), 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) [2023-08-04 09:30:47,045 INFO L175 Difference]: Start difference. First operand has 87 places, 61 transitions, 306 flow. Second operand 33 states and 5456 transitions. [2023-08-04 09:30:47,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 885 transitions, 6112 flow [2023-08-04 09:30:47,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 885 transitions, 5536 flow, removed 74 selfloop flow, removed 14 redundant places. [2023-08-04 09:30:47,541 INFO L231 Difference]: Finished difference. Result has 128 places, 317 transitions, 1728 flow [2023-08-04 09:30:47,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1728, PETRI_PLACES=128, PETRI_TRANSITIONS=317} [2023-08-04 09:30:47,542 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 78 predicate places. [2023-08-04 09:30:47,542 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 317 transitions, 1728 flow [2023-08-04 09:30:47,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 144.92307692307693) internal successors, (3768), 26 states have internal predecessors, (3768), 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) [2023-08-04 09:30:47,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:47,543 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:47,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:47,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 09:30:47,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:47,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1482954033, now seen corresponding path program 3 times [2023-08-04 09:30:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950283980] [2023-08-04 09:30:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:30:47,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:47,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950283980] [2023-08-04 09:30:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950283980] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:47,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231494784] [2023-08-04 09:30:47,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 09:30:47,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:47,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:47,902 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:47,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 09:30:48,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 09:30:48,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:30:48,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 09:30:48,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:30:48,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:30:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231494784] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:48,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2023-08-04 09:30:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585058604] [2023-08-04 09:30:48,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:48,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 09:30:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 09:30:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-08-04 09:30:48,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 368 [2023-08-04 09:30:48,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 317 transitions, 1728 flow. Second operand has 8 states, 8 states have (on average 168.75) internal successors, (1350), 8 states have internal predecessors, (1350), 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) [2023-08-04 09:30:48,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:48,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 368 [2023-08-04 09:30:48,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:31:05,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][254], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 7#L101-4true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, 10#thread2EXITtrue, thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:05,239 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 09:31:05,239 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:05,239 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:05,239 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 09:31:05,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][255], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 7#L101-4true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:05,240 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 09:31:05,240 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:05,240 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 09:31:05,240 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:06,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][224], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), 137#thread1EXITtrue, Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 109#L101-3true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), 2132#(= ~q_front~0 ~q_back~0), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), 65#L61true, Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, 10#thread2EXITtrue, thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,383 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,383 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:31:06,383 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:31:06,383 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][227], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), 137#thread1EXITtrue, Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, 109#L101-3true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), 2132#(= ~q_front~0 ~q_back~0), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), 65#L61true, Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,383 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,383 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:31:06,383 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,383 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:31:06,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][224], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), 109#L101-3true, Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), 2132#(= ~q_front~0 ~q_back~0), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), 65#L61true, Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, 17#L49-5true, thread1Thread1of2ForFork0InUse, 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,405 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][227], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), 109#L101-3true, Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), 2132#(= ~q_front~0 ~q_back~0), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), 65#L61true, Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, thread2Thread1of2ForFork1InUse, 17#L49-5true, thread1Thread1of2ForFork0InUse, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,405 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][254], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, thread1Thread1of2ForFork0NotInUse, 1732#true, 76#L101-8true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,428 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,428 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,428 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 09:31:06,428 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 09:31:06,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][255], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, 76#L101-8true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,428 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,428 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 09:31:06,428 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,428 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 09:31:06,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][223], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 91#L61true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), 109#L101-3true, Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), 65#L61true, Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, 2133#(<= ~q_back~0 (+ ~q_front~0 1)), thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, thread1Thread1of2ForFork0InUse, 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,687 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,687 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:31:06,687 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,687 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:31:06,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][226], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), 66#L70-2true, Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 91#L61true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), 109#L101-3true, Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), 65#L61true, Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 2133#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 841#true, thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,687 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,687 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:31:06,687 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:31:06,687 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][223], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), 109#L101-3true, Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), 65#L61true, Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, 138#L54true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, 2133#(<= ~q_back~0 (+ ~q_front~0 1)), thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, thread1Thread1of2ForFork0InUse, 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,700 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,701 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,701 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:31:06,701 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:31:06,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][226], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), 109#L101-3true, Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), 65#L61true, Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, 138#L54true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, 2133#(<= ~q_back~0 (+ ~q_front~0 1)), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,701 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,701 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,701 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:31:06,701 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:31:06,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][254], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 1718#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|)), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 159#L102-8true, Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, thread1Thread1of2ForFork0NotInUse, 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,722 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,722 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 09:31:06,722 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,722 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 09:31:06,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][255], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 1718#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|)), 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 159#L102-8true, Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,722 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,722 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 09:31:06,722 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 09:31:06,722 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:06,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][254], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), 88#L102-3true, Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, thread1Thread1of2ForFork0NotInUse, 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,951 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-04 09:31:06,951 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,951 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 09:31:06,951 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][255], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), 88#L102-3true, Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:06,951 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-04 09:31:06,951 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,951 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 09:31:06,951 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 09:31:07,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][512], [Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 1718#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|)), 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 159#L102-8true, Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:07,619 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-04 09:31:07,619 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 09:31:07,619 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 09:31:07,619 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 09:31:07,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][513], [Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 1718#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|)), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 159#L102-8true, Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, thread1Thread1of2ForFork0NotInUse, 1732#true, Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:07,619 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-04 09:31:07,619 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 09:31:07,619 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 09:31:07,619 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 09:31:07,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][512], [Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), 88#L102-3true, Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:07,620 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,620 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,620 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,620 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][513], [Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), 88#L102-3true, Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 2130#true, 90#L77true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, thread1Thread1of2ForFork0NotInUse, 1732#true, Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:07,620 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,620 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,620 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,620 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][223], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 91#L61true, Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 109#L101-3true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 2133#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 841#true, 10#thread2EXITtrue, thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:07,644 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,644 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:07,644 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:07,644 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:07,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][226], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, 91#L61true, Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 109#L101-3true, Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 2133#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 841#true, thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:07,644 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,644 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:07,644 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:07,644 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:07,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L77-->thread2EXIT: Formula: (and (= |v_thread2Thread2of2ForFork1_~j~0#1_23| 0) (= v_~y~0_90 (+ v_~y~0_91 v_~C~0_92)) (= |v_thread2Thread2of2ForFork1_#res#1.offset_15| 0) (= |v_thread2Thread2of2ForFork1_#res#1.base_15| 0)) InVars {~C~0=v_~C~0_92, ~y~0=v_~y~0_91, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} OutVars{~C~0=v_~C~0_92, thread2Thread2of2ForFork1_#res#1.base=|v_thread2Thread2of2ForFork1_#res#1.base_15|, ~y~0=v_~y~0_90, thread2Thread2of2ForFork1_#res#1.offset=|v_thread2Thread2of2ForFork1_#res#1.offset_15|, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_23|} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_#res#1.base, ~y~0, thread2Thread2of2ForFork1_#res#1.offset][223], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 109#L101-3true, Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, 138#L54true, Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, 2133#(<= ~q_back~0 (+ ~q_front~0 1)), thread2Thread1of2ForFork1InUse, 10#thread2EXITtrue, thread1Thread1of2ForFork0NotInUse, 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1732#true, Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:07,657 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,657 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:07,657 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:07,657 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:07,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1159] L77-->L70-2: Formula: (and (= v_~y~0_76 (+ v_~y~0_77 v_~C~0_74)) (not (= |v_thread2Thread2of2ForFork1_~j~0#1_19| 0))) InVars {~C~0=v_~C~0_74, ~y~0=v_~y~0_77, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} OutVars{~C~0=v_~C~0_74, ~y~0=v_~y~0_76, thread2Thread2of2ForFork1_~j~0#1=|v_thread2Thread2of2ForFork1_~j~0#1_19|} AuxVars[] AssignedVars[~y~0][226], [Black: 623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 2077#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 826#(and (<= |ULTIMATE.start_main_~asdf~1#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2095#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1720#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (or (<= |ULTIMATE.start_main_#t~mem22#1| (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296))) (not (= (+ thread2Thread2of2ForFork1_thidvar0 4294967296 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (not (= |ULTIMATE.start_main_#t~mem22#1| (+ thread2Thread2of2ForFork1_thidvar0 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)))) (< (+ 2147483647 (* (div |ULTIMATE.start_main_#t~mem22#1| 4294967296) 4294967296)) |ULTIMATE.start_main_#t~mem22#1|))), Black: 2099#(and (= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1074#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1726#(and (<= thread2Thread2of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 4)) (= (+ thread2Thread1of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 1) thread2Thread2of2ForFork1_thidvar0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 1 |ULTIMATE.start_main_~asdf~3#1|)), Black: 2087#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 2079#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= ~y~0 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0)), Black: 615#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 2042#(and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1))), Black: 1741#(and (<= 0 ~N~0) (<= ~x~0 (+ ~y~0 ~C~0)) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~N~0 0) (= ~s~0 0)), Black: 816#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1)), Black: 2085#(and (or (< |thread1Thread1of2ForFork0_~i~0#1| ~N~0) (and (< (mod ~x~0 4294967296) (+ (mod ~y~0 4294967296) 1)) (= ~N~0 0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)))), Black: 1820#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0)), Black: 2097#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= ~s~0 ~N~0))), Black: 2101#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0)), 66#L70-2true, 109#L101-3true, Black: 262#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2093#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 2103#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), Black: 332#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2091#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= ~s~0 ~N~0)), Black: 1735#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0)), Black: 1986#(and (= ~N~0 0) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))), Black: 1847#(and (<= 0 ~N~0) (<= 0 (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2))) (= (mod ~y~0 2) 0) (<= ~N~0 0) (<= (+ ~x~0 (* (div (* (- 1) ~y~0) 2) 2)) 0) (= ~s~0 0)), 90#L77true, 138#L54true, 1975#(or (not (= |thread2Thread2of2ForFork1_~j~0#1| 0)) (and (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296)) (= ~s~0 ~N~0))), Black: 213#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 433#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 342#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 841#true, 2133#(<= ~q_back~0 (+ ~q_front~0 1)), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0NotInUse, 844#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1738#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), Black: 185#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1836#(and (<= 0 ~N~0) (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= ~y~0 ~C~0) (<= ~N~0 0) (= ~s~0 0)), Black: 2081#(and (<= 0 ~N~0) (<= (+ ~y~0 ~C~0) ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0) (= ~s~0 0)), Black: 2089#(and (= ~N~0 0) (< ~s~0 (+ ~N~0 1)) (<= (+ (* (div ~y~0 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0)) (<= ~N~0 ~s~0) (< (mod ~y~0 4294967296) (+ (mod ~x~0 4294967296) 1)) (<= (div ~x~0 4294967296) (div ~y~0 4294967296))), Black: 1736#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= |thread1Thread1of2ForFork0_~i~0#1| 0))]) [2023-08-04 09:31:07,657 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 09:31:07,657 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:07,657 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:31:07,657 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 09:31:07,791 INFO L124 PetriNetUnfolderBase]: 127661/176944 cut-off events. [2023-08-04 09:31:07,791 INFO L125 PetriNetUnfolderBase]: For 673860/677631 co-relation queries the response was YES. [2023-08-04 09:31:08,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705732 conditions, 176944 events. 127661/176944 cut-off events. For 673860/677631 co-relation queries the response was YES. Maximal size of possible extension queue 4518. Compared 1251263 event pairs, 18072 based on Foata normal form. 5373/158193 useless extension candidates. Maximal degree in co-relation 705671. Up to 92154 conditions per place. [2023-08-04 09:31:09,609 INFO L140 encePairwiseOnDemand]: 361/368 looper letters, 705 selfloop transitions, 25 changer transitions 5/783 dead transitions. [2023-08-04 09:31:09,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 783 transitions, 5740 flow [2023-08-04 09:31:09,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:31:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:31:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 765 transitions. [2023-08-04 09:31:09,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197010869565217 [2023-08-04 09:31:09,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 765 transitions. [2023-08-04 09:31:09,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 765 transitions. [2023-08-04 09:31:09,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:31:09,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 765 transitions. [2023-08-04 09:31:09,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 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) [2023-08-04 09:31:09,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:31:09,614 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 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) [2023-08-04 09:31:09,614 INFO L175 Difference]: Start difference. First operand has 128 places, 317 transitions, 1728 flow. Second operand 4 states and 765 transitions. [2023-08-04 09:31:09,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 783 transitions, 5740 flow [2023-08-04 09:31:17,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 783 transitions, 5729 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:31:17,802 INFO L231 Difference]: Finished difference. Result has 131 places, 339 transitions, 2065 flow [2023-08-04 09:31:17,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1723, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2065, PETRI_PLACES=131, PETRI_TRANSITIONS=339} [2023-08-04 09:31:17,802 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 81 predicate places. [2023-08-04 09:31:17,802 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 339 transitions, 2065 flow [2023-08-04 09:31:17,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 168.75) internal successors, (1350), 8 states have internal predecessors, (1350), 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) [2023-08-04 09:31:17,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:31:17,803 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:31:17,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-04 09:31:18,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:31:18,009 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:31:18,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:31:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash -300954845, now seen corresponding path program 4 times [2023-08-04 09:31:18,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:31:18,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044809260] [2023-08-04 09:31:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:31:18,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:31:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:31:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:31:18,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:31:18,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044809260] [2023-08-04 09:31:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044809260] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:31:18,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516459710] [2023-08-04 09:31:18,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 09:31:18,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:31:18,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:31:18,654 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:31:18,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 09:31:18,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 09:31:18,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:31:18,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-04 09:31:18,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:31:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:31:19,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:31:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:31:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516459710] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:31:20,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:31:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2023-08-04 09:31:20,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294780944] [2023-08-04 09:31:20,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:31:20,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-04 09:31:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:31:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-04 09:31:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2023-08-04 09:31:20,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 368 [2023-08-04 09:31:20,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 339 transitions, 2065 flow. Second operand has 25 states, 25 states have (on average 144.76) internal successors, (3619), 25 states have internal predecessors, (3619), 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) [2023-08-04 09:31:20,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:31:20,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 368 [2023-08-04 09:31:20,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:31:52,460 INFO L124 PetriNetUnfolderBase]: 195927/271524 cut-off events. [2023-08-04 09:31:52,460 INFO L125 PetriNetUnfolderBase]: For 1424528/1424618 co-relation queries the response was YES. [2023-08-04 09:31:54,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212558 conditions, 271524 events. 195927/271524 cut-off events. For 1424528/1424618 co-relation queries the response was YES. Maximal size of possible extension queue 6167. Compared 1982369 event pairs, 32177 based on Foata normal form. 96/250035 useless extension candidates. Maximal degree in co-relation 1212494. Up to 186894 conditions per place. [2023-08-04 09:31:55,320 INFO L140 encePairwiseOnDemand]: 349/368 looper letters, 757 selfloop transitions, 576 changer transitions 31/1372 dead transitions. [2023-08-04 09:31:55,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 1372 transitions, 11867 flow [2023-08-04 09:31:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-04 09:31:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-04 09:31:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4059 transitions. [2023-08-04 09:31:55,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44119565217391304 [2023-08-04 09:31:55,324 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4059 transitions. [2023-08-04 09:31:55,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4059 transitions. [2023-08-04 09:31:55,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:31:55,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4059 transitions. [2023-08-04 09:31:55,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 162.36) internal successors, (4059), 25 states have internal predecessors, (4059), 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) [2023-08-04 09:31:55,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 368.0) internal successors, (9568), 26 states have internal predecessors, (9568), 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) [2023-08-04 09:31:55,336 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 368.0) internal successors, (9568), 26 states have internal predecessors, (9568), 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) [2023-08-04 09:31:55,336 INFO L175 Difference]: Start difference. First operand has 131 places, 339 transitions, 2065 flow. Second operand 25 states and 4059 transitions. [2023-08-04 09:31:55,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 1372 transitions, 11867 flow [2023-08-04 09:32:56,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 1372 transitions, 11867 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:32:56,280 INFO L231 Difference]: Finished difference. Result has 173 places, 833 transitions, 7108 flow [2023-08-04 09:32:56,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=7108, PETRI_PLACES=173, PETRI_TRANSITIONS=833} [2023-08-04 09:32:56,281 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 123 predicate places. [2023-08-04 09:32:56,281 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 833 transitions, 7108 flow [2023-08-04 09:32:56,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 144.76) internal successors, (3619), 25 states have internal predecessors, (3619), 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) [2023-08-04 09:32:56,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:32:56,282 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:32:56,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 09:32:56,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:32:56,482 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:32:56,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:32:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash 549351561, now seen corresponding path program 5 times [2023-08-04 09:32:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:32:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561569032] [2023-08-04 09:32:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:32:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:32:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:32:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 09:32:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:32:57,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561569032] [2023-08-04 09:32:57,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561569032] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:32:57,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014843278] [2023-08-04 09:32:57,093 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 09:32:57,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:32:57,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:32:57,094 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:32:57,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-04 09:32:57,484 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-04 09:32:57,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:32:57,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-04 09:32:57,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:32:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 09:32:58,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:32:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:32:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014843278] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:32:58,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:32:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2023-08-04 09:32:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745343065] [2023-08-04 09:32:58,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:32:58,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-04 09:32:58,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:32:58,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-04 09:32:58,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2023-08-04 09:32:59,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 368 [2023-08-04 09:32:59,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 833 transitions, 7108 flow. Second operand has 28 states, 28 states have (on average 141.35714285714286) internal successors, (3958), 28 states have internal predecessors, (3958), 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) [2023-08-04 09:32:59,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:32:59,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 368 [2023-08-04 09:32:59,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand