/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_parallel-ticket-2.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 08:57:21,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 08:57:21,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 08:57:21,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 08:57:21,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 08:57:21,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 08:57:21,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 08:57:21,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 08:57:21,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 08:57:21,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 08:57:21,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 08:57:21,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 08:57:21,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 08:57:21,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 08:57:21,280 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 08:57:21,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 08:57:21,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 08:57:21,285 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 08:57:21,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 08:57:21,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 08:57:21,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 08:57:21,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 08:57:21,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 08:57:21,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 08:57:21,287 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 08:57:21,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 08:57:21,288 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 08:57:21,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 08:57:21,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 08:57:21,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 08:57:21,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 08:57:21,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 08:57:21,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 08:57:21,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 08:57:21,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 08:57:21,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 08:57:21,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 08:57:21,290 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 08:57:21,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 08:57:21,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 08:57:21,290 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 08:57:21,290 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 08:57:21,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 08:57:21,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 08:57:21,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 08:57:21,465 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 08:57:21,466 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 08:57:21,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-ticket-2.wvr_bound2.c [2023-08-04 08:57:22,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 08:57:22,558 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 08:57:22,559 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-ticket-2.wvr_bound2.c [2023-08-04 08:57:22,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4491eba/64d3f6e6451b40498d50b3f01d999ddd/FLAGdf850e874 [2023-08-04 08:57:22,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4491eba/64d3f6e6451b40498d50b3f01d999ddd [2023-08-04 08:57:22,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 08:57:22,588 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 08:57:22,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 08:57:22,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 08:57:22,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 08:57:22,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e94049d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22, skipping insertion in model container [2023-08-04 08:57:22,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 08:57:22,722 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_parallel-ticket-2.wvr_bound2.c[2814,2827] [2023-08-04 08:57:22,722 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 08:57:22,728 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 08:57:22,743 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_parallel-ticket-2.wvr_bound2.c[2814,2827] [2023-08-04 08:57:22,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 08:57:22,751 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 08:57:22,752 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 08:57:22,756 INFO L206 MainTranslator]: Completed translation [2023-08-04 08:57:22,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22 WrapperNode [2023-08-04 08:57:22,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 08:57:22,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 08:57:22,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 08:57:22,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 08:57:22,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,779 INFO L138 Inliner]: procedures = 21, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2023-08-04 08:57:22,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 08:57:22,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 08:57:22,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 08:57:22,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 08:57:22,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 08:57:22,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 08:57:22,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 08:57:22,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 08:57:22,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (1/1) ... [2023-08-04 08:57:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 08:57:22,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:22,831 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 08:57:22,832 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 08:57:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 08:57:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 08:57:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 08:57:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 08:57:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 08:57:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 08:57:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 08:57:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 08:57:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 08:57:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 08:57:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 08:57:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 08:57:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 08:57:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 08:57:22,855 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 08:57:22,932 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 08:57:22,933 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 08:57:23,137 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 08:57:23,175 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 08:57:23,176 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-04 08:57:23,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 08:57:23 BoogieIcfgContainer [2023-08-04 08:57:23,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 08:57:23,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 08:57:23,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 08:57:23,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 08:57:23,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 08:57:22" (1/3) ... [2023-08-04 08:57:23,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c4f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 08:57:23, skipping insertion in model container [2023-08-04 08:57:23,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:57:22" (2/3) ... [2023-08-04 08:57:23,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c4f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 08:57:23, skipping insertion in model container [2023-08-04 08:57:23,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 08:57:23" (3/3) ... [2023-08-04 08:57:23,190 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_parallel-ticket-2.wvr_bound2.c [2023-08-04 08:57:23,195 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 08:57:23,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 08:57:23,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 08:57:23,201 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 08:57:23,252 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 08:57:23,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 125 transitions, 272 flow [2023-08-04 08:57:23,342 INFO L124 PetriNetUnfolderBase]: 27/261 cut-off events. [2023-08-04 08:57:23,343 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 08:57:23,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 261 events. 27/261 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 818 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-04 08:57:23,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 125 transitions, 272 flow [2023-08-04 08:57:23,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 115 transitions, 248 flow [2023-08-04 08:57:23,351 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 08:57:23,356 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 115 transitions, 248 flow [2023-08-04 08:57:23,358 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 115 transitions, 248 flow [2023-08-04 08:57:23,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 115 transitions, 248 flow [2023-08-04 08:57:23,386 INFO L124 PetriNetUnfolderBase]: 27/226 cut-off events. [2023-08-04 08:57:23,387 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 08:57:23,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 226 events. 27/226 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 608 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2023-08-04 08:57:23,389 INFO L119 LiptonReduction]: Number of co-enabled transitions 1280 [2023-08-04 08:57:25,634 INFO L134 LiptonReduction]: Checked pairs total: 4931 [2023-08-04 08:57:25,634 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-04 08:57:25,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 08:57:25,652 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;@1fde145f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 08:57:25,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 08:57:25,657 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 08:57:25,658 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 08:57:25,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:57:25,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:25,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 08:57:25,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:25,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 464101048, now seen corresponding path program 1 times [2023-08-04 08:57:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030342578] [2023-08-04 08:57:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:25,838 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 08:57:25,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:25,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030342578] [2023-08-04 08:57:25,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030342578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:25,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:57:25,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 08:57:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112540765] [2023-08-04 08:57:25,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:25,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:25,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:25,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:57:25,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 223 [2023-08-04 08:57:25,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 08:57:25,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:25,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 223 [2023-08-04 08:57:25,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:25,976 INFO L124 PetriNetUnfolderBase]: 249/514 cut-off events. [2023-08-04 08:57:25,976 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-04 08:57:25,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 514 events. 249/514 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2512 event pairs, 147 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 850. Up to 457 conditions per place. [2023-08-04 08:57:25,983 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 26 selfloop transitions, 2 changer transitions 1/34 dead transitions. [2023-08-04 08:57:25,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 144 flow [2023-08-04 08:57:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-04 08:57:25,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022421524663677 [2023-08-04 08:57:25,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-04 08:57:26,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-04 08:57:26,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:26,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-04 08:57:26,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 08:57:26,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 08:57:26,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 08:57:26,012 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 78 flow. Second operand 3 states and 336 transitions. [2023-08-04 08:57:26,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 144 flow [2023-08-04 08:57:26,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 08:57:26,016 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 80 flow [2023-08-04 08:57:26,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2023-08-04 08:57:26,020 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2023-08-04 08:57:26,021 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 80 flow [2023-08-04 08:57:26,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 08:57:26,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:26,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:57:26,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 08:57:26,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:26,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1875066257, now seen corresponding path program 1 times [2023-08-04 08:57:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776170703] [2023-08-04 08:57:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:26,101 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 08:57:26,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776170703] [2023-08-04 08:57:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776170703] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:26,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310196959] [2023-08-04 08:57:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:26,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:26,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:26,104 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 08:57:26,119 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 08:57:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:26,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:57:26,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:26,171 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 08:57:26,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:57:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310196959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:57:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 08:57:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692433586] [2023-08-04 08:57:26,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:26,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:26,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 223 [2023-08-04 08:57:26,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 08:57:26,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:26,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 223 [2023-08-04 08:57:26,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:26,246 INFO L124 PetriNetUnfolderBase]: 245/486 cut-off events. [2023-08-04 08:57:26,246 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 08:57:26,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 486 events. 245/486 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2173 event pairs, 112 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 729. Up to 417 conditions per place. [2023-08-04 08:57:26,248 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 29 selfloop transitions, 2 changer transitions 1/37 dead transitions. [2023-08-04 08:57:26,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 158 flow [2023-08-04 08:57:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-04 08:57:26,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067264573991032 [2023-08-04 08:57:26,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-04 08:57:26,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-04 08:57:26,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:26,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-04 08:57:26,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 08:57:26,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 08:57:26,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 08:57:26,268 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 80 flow. Second operand 3 states and 339 transitions. [2023-08-04 08:57:26,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 158 flow [2023-08-04 08:57:26,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 08:57:26,269 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 84 flow [2023-08-04 08:57:26,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-08-04 08:57:26,270 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-04 08:57:26,270 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 84 flow [2023-08-04 08:57:26,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 08:57:26,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:26,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:57:26,277 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 08:57:26,475 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 08:57:26,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:26,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 279740601, now seen corresponding path program 1 times [2023-08-04 08:57:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697611215] [2023-08-04 08:57:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:26,526 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 08:57:26,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:26,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697611215] [2023-08-04 08:57:26,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697611215] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:26,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664871688] [2023-08-04 08:57:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:26,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:26,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:26,527 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 08:57:26,529 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 08:57:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:26,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:57:26,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:26,579 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 08:57:26,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:57:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664871688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:57:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 08:57:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431019193] [2023-08-04 08:57:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:26,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:26,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 223 [2023-08-04 08:57:26,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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 08:57:26,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:26,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 223 [2023-08-04 08:57:26,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:26,639 INFO L124 PetriNetUnfolderBase]: 159/344 cut-off events. [2023-08-04 08:57:26,639 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 08:57:26,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 344 events. 159/344 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1393 event pairs, 102 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 214. Up to 223 conditions per place. [2023-08-04 08:57:26,641 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 33 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-04 08:57:26,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 178 flow [2023-08-04 08:57:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-04 08:57:26,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112107623318386 [2023-08-04 08:57:26,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-04 08:57:26,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-04 08:57:26,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:26,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-04 08:57:26,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 08:57:26,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 08:57:26,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 08:57:26,645 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 84 flow. Second operand 3 states and 342 transitions. [2023-08-04 08:57:26,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 178 flow [2023-08-04 08:57:26,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 08:57:26,646 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 92 flow [2023-08-04 08:57:26,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2023-08-04 08:57:26,647 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-04 08:57:26,648 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 92 flow [2023-08-04 08:57:26,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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 08:57:26,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:26,648 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 08:57:26,655 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 08:57:26,853 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 08:57:26,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:26,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 138801158, now seen corresponding path program 1 times [2023-08-04 08:57:26,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:26,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495049076] [2023-08-04 08:57:26,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:26,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:26,930 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 08:57:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495049076] [2023-08-04 08:57:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495049076] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37654536] [2023-08-04 08:57:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:26,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:26,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:26,947 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 08:57:26,948 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 08:57:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:26,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:57:26,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:27,003 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 08:57:27,003 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:57:27,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37654536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:27,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:57:27,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 08:57:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864674940] [2023-08-04 08:57:27,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:27,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:27,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:27,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:27,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 223 [2023-08-04 08:57:27,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 08:57:27,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:27,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 223 [2023-08-04 08:57:27,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:27,067 INFO L124 PetriNetUnfolderBase]: 152/331 cut-off events. [2023-08-04 08:57:27,067 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-04 08:57:27,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 331 events. 152/331 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1325 event pairs, 139 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 331. Up to 272 conditions per place. [2023-08-04 08:57:27,069 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 29 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-04 08:57:27,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 172 flow [2023-08-04 08:57:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-04 08:57:27,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067264573991032 [2023-08-04 08:57:27,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-04 08:57:27,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-04 08:57:27,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:27,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-04 08:57:27,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 08:57:27,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 08:57:27,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 08:57:27,075 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 92 flow. Second operand 3 states and 339 transitions. [2023-08-04 08:57:27,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 172 flow [2023-08-04 08:57:27,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:57:27,076 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 94 flow [2023-08-04 08:57:27,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-08-04 08:57:27,077 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-04 08:57:27,077 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 94 flow [2023-08-04 08:57:27,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 08:57:27,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:27,078 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 08:57:27,084 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 08:57:27,284 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 08:57:27,284 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:27,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2049222557, now seen corresponding path program 1 times [2023-08-04 08:57:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367017089] [2023-08-04 08:57:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:27,335 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 08:57:27,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:27,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367017089] [2023-08-04 08:57:27,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367017089] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:27,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320122881] [2023-08-04 08:57:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:27,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:27,337 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 08:57:27,339 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 08:57:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:27,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:57:27,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:27,430 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 08:57:27,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:57:27,460 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 08:57:27,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320122881] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:57:27,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:57:27,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 08:57:27,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948609429] [2023-08-04 08:57:27,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:57:27,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:57:27,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:27,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:57:27,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:27,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 223 [2023-08-04 08:57:27,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 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 08:57:27,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:27,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 223 [2023-08-04 08:57:27,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:27,496 INFO L124 PetriNetUnfolderBase]: 6/22 cut-off events. [2023-08-04 08:57:27,496 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 08:57:27,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 22 events. 6/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 1 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 08:57:27,497 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 0 selfloop transitions, 0 changer transitions 13/13 dead transitions. [2023-08-04 08:57:27,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 13 transitions, 52 flow [2023-08-04 08:57:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:57:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:57:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-08-04 08:57:27,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663677130044843 [2023-08-04 08:57:27,498 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-08-04 08:57:27,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-08-04 08:57:27,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:27,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-08-04 08:57:27,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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 08:57:27,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 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 08:57:27,501 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 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 08:57:27,501 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 94 flow. Second operand 4 states and 416 transitions. [2023-08-04 08:57:27,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 13 transitions, 52 flow [2023-08-04 08:57:27,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 13 transitions, 50 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:57:27,501 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 08:57:27,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2023-08-04 08:57:27,503 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -12 predicate places. [2023-08-04 08:57:27,503 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 08:57:27,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 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 08:57:27,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 08:57:27,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 08:57:27,710 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 08:57:27,711 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 08:57:27,712 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 08:57:27,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 125 transitions, 272 flow [2023-08-04 08:57:27,727 INFO L124 PetriNetUnfolderBase]: 27/261 cut-off events. [2023-08-04 08:57:27,727 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 08:57:27,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 261 events. 27/261 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 818 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-04 08:57:27,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 125 transitions, 272 flow [2023-08-04 08:57:27,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 85 transitions, 180 flow [2023-08-04 08:57:27,728 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 08:57:27,728 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 85 transitions, 180 flow [2023-08-04 08:57:27,729 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 85 transitions, 180 flow [2023-08-04 08:57:27,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 85 transitions, 180 flow [2023-08-04 08:57:27,735 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events. [2023-08-04 08:57:27,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:57:27,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2023-08-04 08:57:27,736 INFO L119 LiptonReduction]: Number of co-enabled transitions 540 [2023-08-04 08:57:29,846 INFO L134 LiptonReduction]: Checked pairs total: 1785 [2023-08-04 08:57:29,846 INFO L136 LiptonReduction]: Total number of compositions: 74 [2023-08-04 08:57:29,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 08:57:29,848 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;@1fde145f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 08:57:29,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 08:57:29,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 08:57:29,849 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 08:57:29,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:57:29,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:29,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 08:57:29,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 08:57:29,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash 535820163, now seen corresponding path program 1 times [2023-08-04 08:57:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075946239] [2023-08-04 08:57:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:29,868 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 08:57:29,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:29,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075946239] [2023-08-04 08:57:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075946239] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:29,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:57:29,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 08:57:29,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201958993] [2023-08-04 08:57:29,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:29,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:29,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:57:29,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 199 [2023-08-04 08:57:29,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 08:57:29,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:29,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 199 [2023-08-04 08:57:29,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:29,896 INFO L124 PetriNetUnfolderBase]: 45/113 cut-off events. [2023-08-04 08:57:29,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:57:29,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 113 events. 45/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 400 event pairs, 22 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 210. Up to 90 conditions per place. [2023-08-04 08:57:29,897 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 15 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-04 08:57:29,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 88 flow [2023-08-04 08:57:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-04 08:57:29,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.542713567839196 [2023-08-04 08:57:29,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-04 08:57:29,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-04 08:57:29,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:29,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-04 08:57:29,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 08:57:29,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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 08:57:29,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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 08:57:29,900 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 324 transitions. [2023-08-04 08:57:29,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 88 flow [2023-08-04 08:57:29,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 88 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 08:57:29,901 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-04 08:57:29,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-04 08:57:29,901 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-04 08:57:29,901 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-04 08:57:29,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 08:57:29,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:29,902 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 08:57:29,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 08:57:29,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 08:57:29,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash -571231856, now seen corresponding path program 1 times [2023-08-04 08:57:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:29,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441780440] [2023-08-04 08:57:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:29,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 08:57:29,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 08:57:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 08:57:29,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 08:57:29,928 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 08:57:29,928 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 08:57:29,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 08:57:29,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 08:57:29,928 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 08:57:29,929 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 08:57:29,930 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 08:57:29,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 08:57:29,954 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 08:57:29,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 144 transitions, 336 flow [2023-08-04 08:57:30,022 INFO L124 PetriNetUnfolderBase]: 118/817 cut-off events. [2023-08-04 08:57:30,022 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 08:57:30,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 817 events. 118/817 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4157 event pairs, 1 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 486. Up to 32 conditions per place. [2023-08-04 08:57:30,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 144 transitions, 336 flow [2023-08-04 08:57:30,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 134 transitions, 308 flow [2023-08-04 08:57:30,027 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 08:57:30,027 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 134 transitions, 308 flow [2023-08-04 08:57:30,029 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 134 transitions, 308 flow [2023-08-04 08:57:30,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 134 transitions, 308 flow [2023-08-04 08:57:30,074 INFO L124 PetriNetUnfolderBase]: 118/685 cut-off events. [2023-08-04 08:57:30,074 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-08-04 08:57:30,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 685 events. 118/685 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3172 event pairs, 1 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 416. Up to 32 conditions per place. [2023-08-04 08:57:30,082 INFO L119 LiptonReduction]: Number of co-enabled transitions 3160 [2023-08-04 08:57:32,022 INFO L134 LiptonReduction]: Checked pairs total: 16225 [2023-08-04 08:57:32,022 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-04 08:57:32,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 08:57:32,023 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;@1fde145f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 08:57:32,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 08:57:32,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 08:57:32,025 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 08:57:32,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:57:32,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:32,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 08:57:32,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:32,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash 782869797, now seen corresponding path program 1 times [2023-08-04 08:57:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:32,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590755539] [2023-08-04 08:57:32,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:32,038 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 08:57:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590755539] [2023-08-04 08:57:32,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590755539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:32,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:57:32,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 08:57:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214993752] [2023-08-04 08:57:32,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:32,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:32,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:57:32,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-08-04 08:57:32,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 08:57:32,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:32,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-08-04 08:57:32,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:33,022 INFO L124 PetriNetUnfolderBase]: 12819/19905 cut-off events. [2023-08-04 08:57:33,022 INFO L125 PetriNetUnfolderBase]: For 2096/2096 co-relation queries the response was YES. [2023-08-04 08:57:33,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39189 conditions, 19905 events. 12819/19905 cut-off events. For 2096/2096 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 141467 event pairs, 8831 based on Foata normal form. 0/18119 useless extension candidates. Maximal degree in co-relation 10328. Up to 17979 conditions per place. [2023-08-04 08:57:33,106 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 40 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 08:57:33,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 228 flow [2023-08-04 08:57:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-04 08:57:33,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075445816186557 [2023-08-04 08:57:33,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-04 08:57:33,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-04 08:57:33,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:33,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-04 08:57:33,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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 08:57:33,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 08:57:33,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 08:57:33,110 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 134 flow. Second operand 3 states and 370 transitions. [2023-08-04 08:57:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 228 flow [2023-08-04 08:57:33,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 08:57:33,118 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 140 flow [2023-08-04 08:57:33,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2023-08-04 08:57:33,119 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2023-08-04 08:57:33,119 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 140 flow [2023-08-04 08:57:33,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 08:57:33,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:33,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:57:33,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 08:57:33,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:33,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1985787239, now seen corresponding path program 1 times [2023-08-04 08:57:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:33,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727449829] [2023-08-04 08:57:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:33,147 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 08:57:33,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:33,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727449829] [2023-08-04 08:57:33,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727449829] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:33,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607960406] [2023-08-04 08:57:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:33,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:33,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:33,149 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 08:57:33,152 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 08:57:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:33,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:57:33,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:33,200 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 08:57:33,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:57:33,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607960406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:33,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:57:33,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 08:57:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698559671] [2023-08-04 08:57:33,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:33,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:33,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:33,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:33,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-08-04 08:57:33,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 08:57:33,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:33,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-08-04 08:57:33,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:34,345 INFO L124 PetriNetUnfolderBase]: 12799/19529 cut-off events. [2023-08-04 08:57:34,345 INFO L125 PetriNetUnfolderBase]: For 1201/1201 co-relation queries the response was YES. [2023-08-04 08:57:34,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38756 conditions, 19529 events. 12799/19529 cut-off events. For 1201/1201 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 135207 event pairs, 8806 based on Foata normal form. 0/17841 useless extension candidates. Maximal degree in co-relation 38714. Up to 17683 conditions per place. [2023-08-04 08:57:34,436 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 47 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 08:57:34,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 260 flow [2023-08-04 08:57:34,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-04 08:57:34,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157750342935528 [2023-08-04 08:57:34,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-04 08:57:34,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-04 08:57:34,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:34,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-04 08:57:34,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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 08:57:34,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 08:57:34,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 08:57:34,440 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 140 flow. Second operand 3 states and 376 transitions. [2023-08-04 08:57:34,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 260 flow [2023-08-04 08:57:34,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:57:34,443 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 150 flow [2023-08-04 08:57:34,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-08-04 08:57:34,445 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-04 08:57:34,445 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 150 flow [2023-08-04 08:57:34,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 08:57:34,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:34,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:57:34,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 08:57:34,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:34,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:34,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1874963912, now seen corresponding path program 1 times [2023-08-04 08:57:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332673597] [2023-08-04 08:57:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:34,691 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 08:57:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332673597] [2023-08-04 08:57:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332673597] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687422091] [2023-08-04 08:57:34,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:34,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:34,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:34,706 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 08:57:34,707 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 08:57:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:34,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:57:34,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:34,761 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 08:57:34,761 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:57:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687422091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:57:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 08:57:34,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944621986] [2023-08-04 08:57:34,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:34,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:34,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-08-04 08:57:34,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 08:57:34,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:34,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-08-04 08:57:34,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:35,559 INFO L124 PetriNetUnfolderBase]: 10373/15983 cut-off events. [2023-08-04 08:57:35,559 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2023-08-04 08:57:35,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32881 conditions, 15983 events. 10373/15983 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 108701 event pairs, 7032 based on Foata normal form. 0/15202 useless extension candidates. Maximal degree in co-relation 9486. Up to 10869 conditions per place. [2023-08-04 08:57:35,621 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 55 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-04 08:57:35,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 310 flow [2023-08-04 08:57:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-08-04 08:57:35,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253772290809328 [2023-08-04 08:57:35,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-08-04 08:57:35,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-08-04 08:57:35,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:35,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-08-04 08:57:35,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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 08:57:35,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 08:57:35,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 08:57:35,625 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 150 flow. Second operand 3 states and 383 transitions. [2023-08-04 08:57:35,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 310 flow [2023-08-04 08:57:35,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:57:35,627 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 160 flow [2023-08-04 08:57:35,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2023-08-04 08:57:35,627 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2023-08-04 08:57:35,627 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 160 flow [2023-08-04 08:57:35,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 08:57:35,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:35,628 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 08:57:35,634 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 08:57:35,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:35,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:35,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash 336378036, now seen corresponding path program 1 times [2023-08-04 08:57:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95379466] [2023-08-04 08:57:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:35,881 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 08:57:35,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95379466] [2023-08-04 08:57:35,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95379466] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748045310] [2023-08-04 08:57:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:35,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:35,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:35,897 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 08:57:35,899 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 08:57:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:35,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:57:35,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:35,951 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 08:57:35,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:57:35,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748045310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:57:35,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:57:35,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 08:57:35,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302685614] [2023-08-04 08:57:35,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:35,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:57:35,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:35,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:57:35,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:35,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-08-04 08:57:35,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 08:57:35,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:35,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-08-04 08:57:35,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:37,007 INFO L124 PetriNetUnfolderBase]: 10060/15778 cut-off events. [2023-08-04 08:57:37,007 INFO L125 PetriNetUnfolderBase]: For 3858/3858 co-relation queries the response was YES. [2023-08-04 08:57:37,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33893 conditions, 15778 events. 10060/15778 cut-off events. For 3858/3858 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 107392 event pairs, 8135 based on Foata normal form. 0/15598 useless extension candidates. Maximal degree in co-relation 10131. Up to 11963 conditions per place. [2023-08-04 08:57:37,068 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 56 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-04 08:57:37,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 322 flow [2023-08-04 08:57:37,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:57:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:57:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-08-04 08:57:37,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253772290809328 [2023-08-04 08:57:37,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-08-04 08:57:37,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-08-04 08:57:37,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:37,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-08-04 08:57:37,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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 08:57:37,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 08:57:37,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 08:57:37,071 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 160 flow. Second operand 3 states and 383 transitions. [2023-08-04 08:57:37,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 322 flow [2023-08-04 08:57:37,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:57:37,086 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 170 flow [2023-08-04 08:57:37,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-08-04 08:57:37,087 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-04 08:57:37,087 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 170 flow [2023-08-04 08:57:37,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 08:57:37,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:37,087 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 08:57:37,093 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 08:57:37,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:37,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:37,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash -944054270, now seen corresponding path program 1 times [2023-08-04 08:57:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:37,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276811678] [2023-08-04 08:57:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:37,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:37,342 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 08:57:37,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:37,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276811678] [2023-08-04 08:57:37,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276811678] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:37,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624174388] [2023-08-04 08:57:37,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:37,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:37,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:37,357 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 08:57:37,359 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 08:57:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:37,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:57:37,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:37,449 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 08:57:37,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:57:37,466 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 08:57:37,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624174388] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:57:37,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:57:37,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 08:57:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176147277] [2023-08-04 08:57:37,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:57:37,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:57:37,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:57:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:37,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 243 [2023-08-04 08:57:37,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 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 08:57:37,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:37,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 243 [2023-08-04 08:57:37,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:38,277 INFO L124 PetriNetUnfolderBase]: 9164/14238 cut-off events. [2023-08-04 08:57:38,277 INFO L125 PetriNetUnfolderBase]: For 2825/2825 co-relation queries the response was YES. [2023-08-04 08:57:38,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31007 conditions, 14238 events. 9164/14238 cut-off events. For 2825/2825 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 94653 event pairs, 5018 based on Foata normal form. 4/14226 useless extension candidates. Maximal degree in co-relation 22496. Up to 13133 conditions per place. [2023-08-04 08:57:38,322 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 48 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2023-08-04 08:57:38,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 296 flow [2023-08-04 08:57:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:57:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:57:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-04 08:57:38,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49588477366255146 [2023-08-04 08:57:38,326 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-04 08:57:38,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-04 08:57:38,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:38,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-04 08:57:38,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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 08:57:38,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 08:57:38,330 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 08:57:38,330 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 170 flow. Second operand 4 states and 482 transitions. [2023-08-04 08:57:38,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 296 flow [2023-08-04 08:57:38,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:57:38,379 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 182 flow [2023-08-04 08:57:38,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-04 08:57:38,379 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2023-08-04 08:57:38,380 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 182 flow [2023-08-04 08:57:38,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 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 08:57:38,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:38,381 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, 1] [2023-08-04 08:57:38,388 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 08:57:38,585 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,SelfDestructingSolverStorable11 [2023-08-04 08:57:38,586 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:38,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1182770087, now seen corresponding path program 1 times [2023-08-04 08:57:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:38,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868375088] [2023-08-04 08:57:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 08:57:38,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:38,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868375088] [2023-08-04 08:57:38,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868375088] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:38,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822845031] [2023-08-04 08:57:38,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:38,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:38,624 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 08:57:38,625 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 08:57:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:38,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:57:38,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 08:57:38,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:57:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 08:57:38,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822845031] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:57:38,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:57:38,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 08:57:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354310632] [2023-08-04 08:57:38,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:57:38,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:57:38,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:38,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:57:38,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:38,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 243 [2023-08-04 08:57:38,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 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 08:57:38,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:38,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 243 [2023-08-04 08:57:38,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:39,542 INFO L124 PetriNetUnfolderBase]: 8732/13346 cut-off events. [2023-08-04 08:57:39,542 INFO L125 PetriNetUnfolderBase]: For 1486/1486 co-relation queries the response was YES. [2023-08-04 08:57:39,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29214 conditions, 13346 events. 8732/13346 cut-off events. For 1486/1486 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 83656 event pairs, 3682 based on Foata normal form. 64/13405 useless extension candidates. Maximal degree in co-relation 20815. Up to 10085 conditions per place. [2023-08-04 08:57:39,595 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 60 selfloop transitions, 3 changer transitions 1/74 dead transitions. [2023-08-04 08:57:39,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 356 flow [2023-08-04 08:57:39,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:57:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:57:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-08-04 08:57:39,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5082304526748971 [2023-08-04 08:57:39,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-08-04 08:57:39,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-08-04 08:57:39,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:39,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-08-04 08:57:39,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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 08:57:39,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 08:57:39,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 08:57:39,600 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 182 flow. Second operand 4 states and 494 transitions. [2023-08-04 08:57:39,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 356 flow [2023-08-04 08:57:39,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 347 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 08:57:39,644 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 187 flow [2023-08-04 08:57:39,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-08-04 08:57:39,644 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-04 08:57:39,645 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 187 flow [2023-08-04 08:57:39,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 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 08:57:39,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:39,645 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-04 08:57:39,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 08:57:39,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 08:57:39,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:39,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash -513313454, now seen corresponding path program 1 times [2023-08-04 08:57:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:39,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304059187] [2023-08-04 08:57:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 08:57:39,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:39,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304059187] [2023-08-04 08:57:39,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304059187] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:39,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276670659] [2023-08-04 08:57:39,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:39,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:39,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:39,953 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 08:57:39,981 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 08:57:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:40,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:57:40,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 08:57:40,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:57:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 08:57:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276670659] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:57:40,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:57:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 08:57:40,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007810692] [2023-08-04 08:57:40,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:57:40,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:57:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:57:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:40,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 243 [2023-08-04 08:57:40,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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 08:57:40,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:40,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 243 [2023-08-04 08:57:40,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:40,510 INFO L124 PetriNetUnfolderBase]: 6080/9446 cut-off events. [2023-08-04 08:57:40,510 INFO L125 PetriNetUnfolderBase]: For 4143/4143 co-relation queries the response was YES. [2023-08-04 08:57:40,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21306 conditions, 9446 events. 6080/9446 cut-off events. For 4143/4143 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 58000 event pairs, 2353 based on Foata normal form. 256/9693 useless extension candidates. Maximal degree in co-relation 19585. Up to 3564 conditions per place. [2023-08-04 08:57:40,547 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 67 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2023-08-04 08:57:40,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 398 flow [2023-08-04 08:57:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:57:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:57:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-04 08:57:40,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2023-08-04 08:57:40,549 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-04 08:57:40,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-04 08:57:40,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:40,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-04 08:57:40,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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 08:57:40,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 08:57:40,551 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 08:57:40,551 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 187 flow. Second operand 4 states and 501 transitions. [2023-08-04 08:57:40,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 398 flow [2023-08-04 08:57:40,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 388 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 08:57:40,567 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 198 flow [2023-08-04 08:57:40,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-08-04 08:57:40,568 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2023-08-04 08:57:40,568 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 198 flow [2023-08-04 08:57:40,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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 08:57:40,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:40,568 INFO L208 CegarLoopForPetriNet]: trace histogram [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 08:57:40,591 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 08:57:40,772 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,SelfDestructingSolverStorable13 [2023-08-04 08:57:40,773 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:40,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash 751102717, now seen corresponding path program 1 times [2023-08-04 08:57:40,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:40,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869797313] [2023-08-04 08:57:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 08:57:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:40,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869797313] [2023-08-04 08:57:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869797313] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:40,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39262928] [2023-08-04 08:57:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:40,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:40,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:40,831 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 08:57:40,837 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 08:57:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:40,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:57:40,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 08:57:40,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:57:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 08:57:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39262928] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:57:40,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:57:40,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 08:57:40,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933741059] [2023-08-04 08:57:40,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:57:40,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:57:40,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:57:40,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:57:40,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 243 [2023-08-04 08:57:40,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 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 08:57:40,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:40,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 243 [2023-08-04 08:57:40,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:41,565 INFO L124 PetriNetUnfolderBase]: 6068/9419 cut-off events. [2023-08-04 08:57:41,565 INFO L125 PetriNetUnfolderBase]: For 5820/5820 co-relation queries the response was YES. [2023-08-04 08:57:41,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22414 conditions, 9419 events. 6068/9419 cut-off events. For 5820/5820 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 57737 event pairs, 5681 based on Foata normal form. 17/9363 useless extension candidates. Maximal degree in co-relation 20664. Up to 8085 conditions per place. [2023-08-04 08:57:41,601 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 67 selfloop transitions, 3 changer transitions 2/82 dead transitions. [2023-08-04 08:57:41,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 410 flow [2023-08-04 08:57:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:57:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:57:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-04 08:57:41,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2023-08-04 08:57:41,603 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-04 08:57:41,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-04 08:57:41,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:41,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-04 08:57:41,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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 08:57:41,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 08:57:41,605 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 08:57:41,605 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 198 flow. Second operand 4 states and 501 transitions. [2023-08-04 08:57:41,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 410 flow [2023-08-04 08:57:41,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 406 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 08:57:41,639 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 202 flow [2023-08-04 08:57:41,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-04 08:57:41,640 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2023-08-04 08:57:41,640 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 202 flow [2023-08-04 08:57:41,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 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 08:57:41,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:41,641 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-04 08:57:41,661 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 08:57:41,861 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,SelfDestructingSolverStorable14 [2023-08-04 08:57:41,861 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:41,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -691951405, now seen corresponding path program 1 times [2023-08-04 08:57:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410818615] [2023-08-04 08:57:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 08:57:42,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:42,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410818615] [2023-08-04 08:57:42,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410818615] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:42,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587652266] [2023-08-04 08:57:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:42,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:42,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:42,714 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 08:57:42,716 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 08:57:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:42,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-04 08:57:42,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:42,942 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 08:57:42,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 08:57:42,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-04 08:57:43,096 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 08:57:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 08:57:43,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:57:43,643 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 50 treesize of output 46 [2023-08-04 08:57:43,649 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 252 treesize of output 244 [2023-08-04 08:57:43,778 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 48 treesize of output 44 [2023-08-04 08:57:43,793 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 236 treesize of output 228 [2023-08-04 08:57:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 08:57:44,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587652266] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:57:44,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:57:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-08-04 08:57:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245691108] [2023-08-04 08:57:44,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:57:44,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-04 08:57:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:44,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-04 08:57:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2023-08-04 08:57:46,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 243 [2023-08-04 08:57:46,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 202 flow. Second operand has 31 states, 31 states have (on average 82.29032258064517) internal successors, (2551), 31 states have internal predecessors, (2551), 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 08:57:46,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:46,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 243 [2023-08-04 08:57:46,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:51,686 INFO L124 PetriNetUnfolderBase]: 26729/38389 cut-off events. [2023-08-04 08:57:51,686 INFO L125 PetriNetUnfolderBase]: For 12905/12905 co-relation queries the response was YES. [2023-08-04 08:57:51,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89037 conditions, 38389 events. 26729/38389 cut-off events. For 12905/12905 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 235164 event pairs, 4156 based on Foata normal form. 125/38358 useless extension candidates. Maximal degree in co-relation 88551. Up to 19935 conditions per place. [2023-08-04 08:57:51,869 INFO L140 encePairwiseOnDemand]: 219/243 looper letters, 370 selfloop transitions, 84 changer transitions 0/456 dead transitions. [2023-08-04 08:57:51,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 456 transitions, 2103 flow [2023-08-04 08:57:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-04 08:57:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-04 08:57:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3110 transitions. [2023-08-04 08:57:51,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37642217380779475 [2023-08-04 08:57:51,876 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3110 transitions. [2023-08-04 08:57:51,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3110 transitions. [2023-08-04 08:57:51,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:51,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3110 transitions. [2023-08-04 08:57:51,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 91.47058823529412) internal successors, (3110), 34 states have internal predecessors, (3110), 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 08:57:51,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 243.0) internal successors, (8505), 35 states have internal predecessors, (8505), 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 08:57:51,889 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 243.0) internal successors, (8505), 35 states have internal predecessors, (8505), 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 08:57:51,889 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 202 flow. Second operand 34 states and 3110 transitions. [2023-08-04 08:57:51,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 456 transitions, 2103 flow [2023-08-04 08:57:52,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 456 transitions, 2082 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 08:57:52,398 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 852 flow [2023-08-04 08:57:52,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=852, PETRI_PLACES=115, PETRI_TRANSITIONS=143} [2023-08-04 08:57:52,398 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 67 predicate places. [2023-08-04 08:57:52,398 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 852 flow [2023-08-04 08:57:52,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 82.29032258064517) internal successors, (2551), 31 states have internal predecessors, (2551), 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 08:57:52,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:52,399 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-04 08:57:52,403 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 08:57:52,600 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,SelfDestructingSolverStorable15 [2023-08-04 08:57:52,600 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:57:52,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:57:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1241861249, now seen corresponding path program 2 times [2023-08-04 08:57:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:57:52,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135599714] [2023-08-04 08:57:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:57:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:57:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:57:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 08:57:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:57:52,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135599714] [2023-08-04 08:57:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135599714] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:52,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899141874] [2023-08-04 08:57:52,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 08:57:52,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:57:52,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:57:52,737 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 08:57:52,739 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 08:57:52,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 08:57:52,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 08:57:52,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-04 08:57:52,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:57:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 08:57:52,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:57:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 08:57:52,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899141874] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 08:57:52,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 08:57:52,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 11 [2023-08-04 08:57:52,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405476982] [2023-08-04 08:57:52,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:57:52,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:57:52,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:57:52,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:57:52,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-08-04 08:57:52,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-08-04 08:57:52,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 143 transitions, 852 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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 08:57:52,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:57:52,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-08-04 08:57:52,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:57:56,752 INFO L124 PetriNetUnfolderBase]: 31146/52707 cut-off events. [2023-08-04 08:57:56,752 INFO L125 PetriNetUnfolderBase]: For 143249/144094 co-relation queries the response was YES. [2023-08-04 08:57:57,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163560 conditions, 52707 events. 31146/52707 cut-off events. For 143249/144094 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 465998 event pairs, 6074 based on Foata normal form. 2300/53581 useless extension candidates. Maximal degree in co-relation 161743. Up to 14725 conditions per place. [2023-08-04 08:57:57,245 INFO L140 encePairwiseOnDemand]: 232/243 looper letters, 194 selfloop transitions, 19 changer transitions 0/293 dead transitions. [2023-08-04 08:57:57,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 293 transitions, 2271 flow [2023-08-04 08:57:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 08:57:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 08:57:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-04 08:57:57,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448559670781893 [2023-08-04 08:57:57,247 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-04 08:57:57,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-04 08:57:57,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:57:57,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-04 08:57:57,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 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 08:57:57,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 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 08:57:57,249 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 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 08:57:57,249 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 852 flow. Second operand 5 states and 662 transitions. [2023-08-04 08:57:57,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 293 transitions, 2271 flow [2023-08-04 08:57:59,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 293 transitions, 2059 flow, removed 65 selfloop flow, removed 9 redundant places. [2023-08-04 08:57:59,961 INFO L231 Difference]: Finished difference. Result has 113 places, 161 transitions, 916 flow [2023-08-04 08:57:59,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=916, PETRI_PLACES=113, PETRI_TRANSITIONS=161} [2023-08-04 08:57:59,962 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 65 predicate places. [2023-08-04 08:57:59,962 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 161 transitions, 916 flow [2023-08-04 08:57:59,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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 08:57:59,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:57:59,962 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-04 08:57:59,968 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 08:58:00,166 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,SelfDestructingSolverStorable16 [2023-08-04 08:58:00,166 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:58:00,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:58:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1786453843, now seen corresponding path program 3 times [2023-08-04 08:58:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:58:00,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51867766] [2023-08-04 08:58:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:58:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:58:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:58:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 08:58:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:58:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51867766] [2023-08-04 08:58:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51867766] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:58:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156989999] [2023-08-04 08:58:00,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 08:58:00,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:00,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:58:00,644 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 08:58:00,646 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 08:58:00,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 08:58:00,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 08:58:00,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-04 08:58:00,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:58:00,784 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 11 treesize of output 7 [2023-08-04 08:58:00,834 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-04 08:58:00,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-08-04 08:58:00,968 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 26 treesize of output 14 [2023-08-04 08:58:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 08:58:00,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:58:01,374 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 34 treesize of output 30 [2023-08-04 08:58:01,378 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 46 treesize of output 42 [2023-08-04 08:58:01,392 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 36 treesize of output 32 [2023-08-04 08:58:01,395 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 46 [2023-08-04 08:58:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 08:58:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156989999] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:58:01,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:58:01,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2023-08-04 08:58:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398840335] [2023-08-04 08:58:01,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:58:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 08:58:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:58:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 08:58:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-08-04 08:58:01,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 243 [2023-08-04 08:58:01,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 161 transitions, 916 flow. Second operand has 22 states, 22 states have (on average 99.18181818181819) internal successors, (2182), 22 states have internal predecessors, (2182), 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 08:58:01,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:58:01,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 243 [2023-08-04 08:58:01,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:58:07,318 INFO L124 PetriNetUnfolderBase]: 31315/52500 cut-off events. [2023-08-04 08:58:07,319 INFO L125 PetriNetUnfolderBase]: For 160980/161677 co-relation queries the response was YES. [2023-08-04 08:58:07,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200033 conditions, 52500 events. 31315/52500 cut-off events. For 160980/161677 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 448091 event pairs, 10400 based on Foata normal form. 109/51506 useless extension candidates. Maximal degree in co-relation 198064. Up to 34347 conditions per place. [2023-08-04 08:58:07,690 INFO L140 encePairwiseOnDemand]: 230/243 looper letters, 226 selfloop transitions, 33 changer transitions 0/331 dead transitions. [2023-08-04 08:58:07,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 331 transitions, 2270 flow [2023-08-04 08:58:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 08:58:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 08:58:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1362 transitions. [2023-08-04 08:58:07,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311490978157645 [2023-08-04 08:58:07,693 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1362 transitions. [2023-08-04 08:58:07,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1362 transitions. [2023-08-04 08:58:07,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:58:07,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1362 transitions. [2023-08-04 08:58:07,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.76923076923077) internal successors, (1362), 13 states have internal predecessors, (1362), 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 08:58:07,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 243.0) internal successors, (3402), 14 states have internal predecessors, (3402), 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 08:58:07,698 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 243.0) internal successors, (3402), 14 states have internal predecessors, (3402), 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 08:58:07,698 INFO L175 Difference]: Start difference. First operand has 113 places, 161 transitions, 916 flow. Second operand 13 states and 1362 transitions. [2023-08-04 08:58:07,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 331 transitions, 2270 flow [2023-08-04 08:58:10,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 331 transitions, 2270 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 08:58:10,169 INFO L231 Difference]: Finished difference. Result has 126 places, 161 transitions, 990 flow [2023-08-04 08:58:10,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=990, PETRI_PLACES=126, PETRI_TRANSITIONS=161} [2023-08-04 08:58:10,169 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 78 predicate places. [2023-08-04 08:58:10,169 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 161 transitions, 990 flow [2023-08-04 08:58:10,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 99.18181818181819) internal successors, (2182), 22 states have internal predecessors, (2182), 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 08:58:10,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:58:10,170 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-04 08:58:10,176 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 08:58:10,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:10,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:58:10,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:58:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1253227739, now seen corresponding path program 1 times [2023-08-04 08:58:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:58:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230454235] [2023-08-04 08:58:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:58:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:58:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:58:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 08:58:11,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:58:11,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230454235] [2023-08-04 08:58:11,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230454235] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:58:11,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481137975] [2023-08-04 08:58:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:58:11,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:11,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:58:11,049 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 08:58:11,051 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 08:58:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:58:11,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-04 08:58:11,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:58:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 08:58:11,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:58:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481137975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:58:11,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:58:11,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 16 [2023-08-04 08:58:11,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339009119] [2023-08-04 08:58:11,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:58:11,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 08:58:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:58:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 08:58:11,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-08-04 08:58:11,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 243 [2023-08-04 08:58:11,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 161 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 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 08:58:11,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:58:11,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 243 [2023-08-04 08:58:11,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:58:21,891 INFO L124 PetriNetUnfolderBase]: 83511/126106 cut-off events. [2023-08-04 08:58:21,891 INFO L125 PetriNetUnfolderBase]: For 813649/814815 co-relation queries the response was YES. [2023-08-04 08:58:22,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552507 conditions, 126106 events. 83511/126106 cut-off events. For 813649/814815 co-relation queries the response was YES. Maximal size of possible extension queue 3405. Compared 1000496 event pairs, 19047 based on Foata normal form. 514/126171 useless extension candidates. Maximal degree in co-relation 548616. Up to 53112 conditions per place. [2023-08-04 08:58:22,730 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 283 selfloop transitions, 78 changer transitions 68/442 dead transitions. [2023-08-04 08:58:22,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 442 transitions, 3599 flow [2023-08-04 08:58:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 08:58:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 08:58:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-08-04 08:58:22,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5384087791495199 [2023-08-04 08:58:22,732 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-08-04 08:58:22,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-08-04 08:58:22,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:58:22,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-08-04 08:58:22,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 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 08:58:22,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 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 08:58:22,736 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 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 08:58:22,736 INFO L175 Difference]: Start difference. First operand has 126 places, 161 transitions, 990 flow. Second operand 6 states and 785 transitions. [2023-08-04 08:58:22,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 442 transitions, 3599 flow [2023-08-04 08:58:31,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 442 transitions, 3412 flow, removed 11 selfloop flow, removed 12 redundant places. [2023-08-04 08:58:31,767 INFO L231 Difference]: Finished difference. Result has 123 places, 199 transitions, 1542 flow [2023-08-04 08:58:31,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1542, PETRI_PLACES=123, PETRI_TRANSITIONS=199} [2023-08-04 08:58:31,768 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 75 predicate places. [2023-08-04 08:58:31,768 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 199 transitions, 1542 flow [2023-08-04 08:58:31,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 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 08:58:31,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:58:31,768 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-04 08:58:31,773 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 08:58:31,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:31,973 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:58:31,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:58:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1251382855, now seen corresponding path program 2 times [2023-08-04 08:58:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:58:31,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153629766] [2023-08-04 08:58:31,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:58:31,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:58:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:58:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 08:58:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:58:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153629766] [2023-08-04 08:58:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153629766] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:58:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641895329] [2023-08-04 08:58:32,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 08:58:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:58:32,453 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 08:58:32,455 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 08:58:32,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 08:58:32,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 08:58:32,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-04 08:58:32,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:58:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 08:58:32,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:58:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 08:58:32,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641895329] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 08:58:32,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 08:58:32,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 18 [2023-08-04 08:58:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503986438] [2023-08-04 08:58:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:58:32,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 08:58:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:58:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 08:58:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2023-08-04 08:58:32,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-08-04 08:58:32,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 199 transitions, 1542 flow. Second operand has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 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 08:58:32,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:58:32,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-08-04 08:58:32,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:58:38,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L52-->L55: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][198], [Black: 1578#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1544#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_#t~pre12#1| 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1560#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2))), Black: 1590#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 676#true, Black: 1596#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2414#(and (= ~b~0 0) (<= ~x~0 0)), Black: 1582#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1586#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2445#(= ~b~0 0), thread2Thread1of2ForFork0InUse, Black: 2395#(and (<= ~x~0 0) (= (mod ~b~0 256) 0)), Black: 1546#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 2337#(= (mod ~b~0 256) 0), Black: 1570#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296))))), Black: 1584#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 47#L55true, 56#L98-5true, Black: 1594#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), thread1Thread1of2ForFork1InUse, Black: 1592#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1574#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1580#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1550#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1588#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2317#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= |ULTIMATE.start_main_#t~mem20#1| (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 1562#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 679#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 291#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 903#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1965#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), Black: 215#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 285#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1620#(<= (+ ~s~0 1) ~t~0), Black: 1953#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 2321#true, 70#L74true, 1621#(<= ~s~0 ~t~0), 2794#(< ~s~0 ~t~0), Black: 1576#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1564#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)))]) [2023-08-04 08:58:38,625 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 08:58:38,625 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 08:58:38,625 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 08:58:38,625 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 08:58:38,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L52-->L55: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][198], [Black: 1578#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1544#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_#t~pre12#1| 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1560#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2))), Black: 1590#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 676#true, Black: 1596#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2414#(and (= ~b~0 0) (<= ~x~0 0)), thread2Thread1of2ForFork0NotInUse, Black: 1582#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1586#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2445#(= ~b~0 0), Black: 1546#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 2395#(and (<= ~x~0 0) (= (mod ~b~0 256) 0)), Black: 1570#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296))))), Black: 2337#(= (mod ~b~0 256) 0), Black: 1584#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 47#L55true, Black: 1594#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), thread1Thread1of2ForFork1InUse, 56#L98-5true, Black: 1592#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1574#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1580#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1550#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1588#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2317#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= |ULTIMATE.start_main_#t~mem20#1| (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 1562#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 679#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 291#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 903#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1965#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), Black: 215#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 285#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1620#(<= (+ ~s~0 1) ~t~0), Black: 1953#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 2321#true, 16#L74true, 1621#(<= ~s~0 ~t~0), 2794#(< ~s~0 ~t~0), Black: 1576#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1564#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)))]) [2023-08-04 08:58:38,626 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 08:58:38,626 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 08:58:38,627 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 08:58:38,627 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 08:58:39,548 INFO L124 PetriNetUnfolderBase]: 39080/68585 cut-off events. [2023-08-04 08:58:39,548 INFO L125 PetriNetUnfolderBase]: For 298117/300795 co-relation queries the response was YES. [2023-08-04 08:58:39,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276100 conditions, 68585 events. 39080/68585 cut-off events. For 298117/300795 co-relation queries the response was YES. Maximal size of possible extension queue 2894. Compared 667322 event pairs, 6497 based on Foata normal form. 2539/68602 useless extension candidates. Maximal degree in co-relation 273018. Up to 23654 conditions per place. [2023-08-04 08:58:40,163 INFO L140 encePairwiseOnDemand]: 232/243 looper letters, 220 selfloop transitions, 57 changer transitions 2/397 dead transitions. [2023-08-04 08:58:40,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 397 transitions, 3296 flow [2023-08-04 08:58:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 08:58:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 08:58:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 792 transitions. [2023-08-04 08:58:40,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2023-08-04 08:58:40,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 792 transitions. [2023-08-04 08:58:40,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 792 transitions. [2023-08-04 08:58:40,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:58:40,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 792 transitions. [2023-08-04 08:58:40,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 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 08:58:40,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 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 08:58:40,167 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 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 08:58:40,167 INFO L175 Difference]: Start difference. First operand has 123 places, 199 transitions, 1542 flow. Second operand 6 states and 792 transitions. [2023-08-04 08:58:40,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 397 transitions, 3296 flow [2023-08-04 08:58:45,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 397 transitions, 3264 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-08-04 08:58:45,572 INFO L231 Difference]: Finished difference. Result has 131 places, 241 transitions, 1957 flow [2023-08-04 08:58:45,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1957, PETRI_PLACES=131, PETRI_TRANSITIONS=241} [2023-08-04 08:58:45,572 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 83 predicate places. [2023-08-04 08:58:45,573 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 241 transitions, 1957 flow [2023-08-04 08:58:45,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 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 08:58:45,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:58:45,573 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-04 08:58:45,577 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 08:58:45,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:45,775 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:58:45,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:58:45,775 INFO L85 PathProgramCache]: Analyzing trace with hash -177637569, now seen corresponding path program 3 times [2023-08-04 08:58:45,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:58:45,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676926186] [2023-08-04 08:58:45,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:58:45,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:58:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:58:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 08:58:45,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:58:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676926186] [2023-08-04 08:58:45,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676926186] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:58:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585873350] [2023-08-04 08:58:45,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 08:58:45,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:45,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:58:45,904 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 08:58:45,914 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 08:58:45,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 08:58:45,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 08:58:45,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 08:58:45,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:58:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 08:58:46,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:58:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 08:58:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585873350] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 08:58:46,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 08:58:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 8] total 14 [2023-08-04 08:58:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464126558] [2023-08-04 08:58:46,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:58:46,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 08:58:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:58:46,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 08:58:46,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-08-04 08:58:46,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-08-04 08:58:46,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 241 transitions, 1957 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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 08:58:46,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:58:46,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-08-04 08:58:46,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:58:51,882 INFO L124 PetriNetUnfolderBase]: 29053/51916 cut-off events. [2023-08-04 08:58:51,883 INFO L125 PetriNetUnfolderBase]: For 236512/242118 co-relation queries the response was YES. [2023-08-04 08:58:52,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237913 conditions, 51916 events. 29053/51916 cut-off events. For 236512/242118 co-relation queries the response was YES. Maximal size of possible extension queue 2155. Compared 494678 event pairs, 5603 based on Foata normal form. 4603/54650 useless extension candidates. Maximal degree in co-relation 235849. Up to 17948 conditions per place. [2023-08-04 08:58:52,483 INFO L140 encePairwiseOnDemand]: 232/243 looper letters, 194 selfloop transitions, 53 changer transitions 37/394 dead transitions. [2023-08-04 08:58:52,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 394 transitions, 3511 flow [2023-08-04 08:58:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 08:58:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 08:58:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-08-04 08:58:52,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5397805212620027 [2023-08-04 08:58:52,485 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-08-04 08:58:52,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-08-04 08:58:52,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:58:52,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-08-04 08:58:52,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 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 08:58:52,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 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 08:58:52,488 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 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 08:58:52,488 INFO L175 Difference]: Start difference. First operand has 131 places, 241 transitions, 1957 flow. Second operand 6 states and 787 transitions. [2023-08-04 08:58:52,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 394 transitions, 3511 flow [2023-08-04 08:58:55,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 394 transitions, 3499 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-04 08:58:55,702 INFO L231 Difference]: Finished difference. Result has 137 places, 229 transitions, 1979 flow [2023-08-04 08:58:55,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1979, PETRI_PLACES=137, PETRI_TRANSITIONS=229} [2023-08-04 08:58:55,702 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 89 predicate places. [2023-08-04 08:58:55,703 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 229 transitions, 1979 flow [2023-08-04 08:58:55,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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 08:58:55,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:58:55,703 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-04 08:58:55,707 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 08:58:55,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:55,903 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:58:55,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:58:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash -102277911, now seen corresponding path program 4 times [2023-08-04 08:58:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:58:55,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303720618] [2023-08-04 08:58:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:58:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:58:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:58:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 08:58:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:58:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303720618] [2023-08-04 08:58:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303720618] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:58:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771770910] [2023-08-04 08:58:56,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 08:58:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:58:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:58:56,021 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 08:58:56,023 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 08:58:56,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 08:58:56,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 08:58:56,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 08:58:56,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:58:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 08:58:56,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:58:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 08:58:56,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771770910] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:58:56,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:58:56,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2023-08-04 08:58:56,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510119446] [2023-08-04 08:58:56,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:58:56,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-04 08:58:56,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:58:56,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-04 08:58:56,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-08-04 08:58:56,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 243 [2023-08-04 08:58:56,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 229 transitions, 1979 flow. Second operand has 16 states, 16 states have (on average 109.0625) internal successors, (1745), 16 states have internal predecessors, (1745), 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 08:58:56,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:58:56,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 243 [2023-08-04 08:58:56,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:59:00,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L52-->L55: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][351], [Black: 1578#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1544#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_#t~pre12#1| 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 679#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1560#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2))), Black: 1590#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 676#true, 2858#(<= (+ ~s~0 1) ~t~0), Black: 1596#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2414#(and (= ~b~0 0) (<= ~x~0 0)), Black: 1582#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1586#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2445#(= ~b~0 0), thread2Thread1of2ForFork0InUse, Black: 2395#(and (<= ~x~0 0) (= (mod ~b~0 256) 0)), Black: 1546#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 2337#(= (mod ~b~0 256) 0), Black: 1570#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296))))), 47#L55true, Black: 1584#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1594#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), thread1Thread1of2ForFork1InUse, Black: 1592#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1574#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1580#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 95#L55true, Black: 1550#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1588#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2317#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= |ULTIMATE.start_main_#t~mem20#1| (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 1562#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 291#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 903#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1965#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), Black: 285#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2849#(and (< (+ ~s~0 1) ~t~0) (< ~s~0 ~m1~0)), Black: 2838#(< ~s~0 (+ ~t~0 1)), Black: 1620#(<= (+ ~s~0 1) ~t~0), Black: 1953#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 2321#true, 16#L74true, 215#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1621#(<= ~s~0 ~t~0), 3297#(and (<= ~s~0 1) (<= 3 ~t~0)), 12#thread2EXITtrue, 93#L98-3true, Black: 3194#(and (<= (+ ~s~0 1) ~m2~0) (<= (+ 2 ~s~0) ~t~0)), 2794#(< ~s~0 ~t~0), Black: 1576#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1564#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)))]) [2023-08-04 08:59:00,078 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-08-04 08:59:00,078 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 08:59:00,078 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 08:59:00,078 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 08:59:00,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L52-->L55: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][351], [Black: 1578#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1544#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_#t~pre12#1| 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 679#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1560#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2))), Black: 1590#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 676#true, 2858#(<= (+ ~s~0 1) ~t~0), Black: 1596#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2414#(and (= ~b~0 0) (<= ~x~0 0)), Black: 1582#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1586#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2445#(= ~b~0 0), thread2Thread1of2ForFork0InUse, Black: 1546#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 2395#(and (<= ~x~0 0) (= (mod ~b~0 256) 0)), Black: 2337#(= (mod ~b~0 256) 0), Black: 1570#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296))))), Black: 1584#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 47#L55true, thread1Thread1of2ForFork1InUse, Black: 1594#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1592#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1574#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1580#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 95#L55true, Black: 1550#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1588#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2317#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= |ULTIMATE.start_main_#t~mem20#1| (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 1562#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 291#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 903#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1965#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 21#thread2EXITtrue, Black: 285#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2849#(and (< (+ ~s~0 1) ~t~0) (< ~s~0 ~m1~0)), Black: 2838#(< ~s~0 (+ ~t~0 1)), Black: 1620#(<= (+ ~s~0 1) ~t~0), Black: 1953#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 2321#true, 70#L74true, 215#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1621#(<= ~s~0 ~t~0), 3297#(and (<= ~s~0 1) (<= 3 ~t~0)), 93#L98-3true, Black: 3194#(and (<= (+ ~s~0 1) ~m2~0) (<= (+ 2 ~s~0) ~t~0)), 2794#(< ~s~0 ~t~0), Black: 1576#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1564#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)))]) [2023-08-04 08:59:00,135 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-08-04 08:59:00,135 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 08:59:00,135 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 08:59:00,135 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 08:59:00,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L52-->L55: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][351], [Black: 1578#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1544#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_#t~pre12#1| 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 679#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1560#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2))), Black: 1590#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 676#true, 2858#(<= (+ ~s~0 1) ~t~0), Black: 1596#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1582#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2414#(and (= ~b~0 0) (<= ~x~0 0)), thread2Thread1of2ForFork0NotInUse, Black: 1586#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2445#(= ~b~0 0), Black: 1546#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 2395#(and (<= ~x~0 0) (= (mod ~b~0 256) 0)), Black: 2337#(= (mod ~b~0 256) 0), Black: 1570#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296))))), 47#L55true, Black: 1584#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1594#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), thread1Thread1of2ForFork1InUse, 56#L98-5true, Black: 1592#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1574#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1580#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1550#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1588#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 3201#(<= (+ ~s~0 1) ~t~0), Black: 2317#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= |ULTIMATE.start_main_#t~mem20#1| (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 1562#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 291#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 903#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1965#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 22#thread1EXITtrue, Black: 285#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2849#(and (< (+ ~s~0 1) ~t~0) (< ~s~0 ~m1~0)), Black: 2838#(< ~s~0 (+ ~t~0 1)), Black: 1620#(<= (+ ~s~0 1) ~t~0), Black: 1953#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 2321#true, 16#L74true, 215#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1621#(<= ~s~0 ~t~0), Black: 3194#(and (<= (+ ~s~0 1) ~m2~0) (<= (+ 2 ~s~0) ~t~0)), 2794#(< ~s~0 ~t~0), Black: 1576#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1564#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)))]) [2023-08-04 08:59:00,824 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 08:59:00,824 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 08:59:00,824 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 08:59:00,824 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 08:59:00,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L52-->L55: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][341], [Black: 1578#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1544#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_#t~pre12#1| 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 679#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1560#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2))), Black: 1590#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 676#true, 2858#(<= (+ ~s~0 1) ~t~0), Black: 1596#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2414#(and (= ~b~0 0) (<= ~x~0 0)), Black: 1582#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), thread2Thread1of2ForFork0NotInUse, Black: 1586#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2445#(= ~b~0 0), Black: 1546#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 2395#(and (<= ~x~0 0) (= (mod ~b~0 256) 0)), Black: 2337#(= (mod ~b~0 256) 0), Black: 1570#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296))))), Black: 1584#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 56#L98-5true, Black: 1594#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), thread1Thread1of2ForFork1InUse, Black: 1592#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1574#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1580#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (not (= (+ thread2Thread1of2ForFork0_thidvar0 4294967296 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|)) (<= |ULTIMATE.start_main_#t~mem18#1| (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))))) (or (< (+ 2147483647 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|) (not (= (+ thread2Thread1of2ForFork0_thidvar0 (* 4294967296 (div |ULTIMATE.start_main_#t~mem18#1| 4294967296))) |ULTIMATE.start_main_#t~mem18#1|))) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), 95#L55true, Black: 1550#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |#pthreadsForks|) (= (+ thread1Thread1of2ForFork1_thidvar0 2) |#pthreadsForks|) (<= |#pthreadsForks| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1588#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 2317#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= |ULTIMATE.start_main_#t~mem20#1| (+ thread1Thread2of2ForFork1_thidvar0 1)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) |ULTIMATE.start_main_#t~mem20#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 3201#(<= (+ ~s~0 1) ~t~0), 1562#(and (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 291#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 903#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1965#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork1_thidvar0 1)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork1_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), Black: 285#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2849#(and (< (+ ~s~0 1) ~t~0) (< ~s~0 ~m1~0)), Black: 2838#(< ~s~0 (+ ~t~0 1)), Black: 1620#(<= (+ ~s~0 1) ~t~0), Black: 1953#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 2321#true, 16#L74true, 215#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1621#(<= ~s~0 ~t~0), 64#thread1EXITtrue, Black: 3194#(and (<= (+ ~s~0 1) ~m2~0) (<= (+ 2 ~s~0) ~t~0)), 2794#(< ~s~0 ~t~0), Black: 1576#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~asdf~1#1|)), Black: 1564#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= thread2Thread1of2ForFork0_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (or (not (= thread1Thread1of2ForFork1_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= ~x~0 1)) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork1_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork1_thidvar0 2)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) thread2Thread1of2ForFork0_thidvar0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2) |ULTIMATE.start_main_#t~pre15#1|) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork1_thidvar0))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork1_thidvar0 4294967296)))) (<= |ULTIMATE.start_main_#t~pre15#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)))]) [2023-08-04 08:59:00,836 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 08:59:00,837 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 08:59:00,837 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 08:59:00,837 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 08:59:02,185 INFO L124 PetriNetUnfolderBase]: 25668/48162 cut-off events. [2023-08-04 08:59:02,185 INFO L125 PetriNetUnfolderBase]: For 294227/300811 co-relation queries the response was YES. [2023-08-04 08:59:02,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243415 conditions, 48162 events. 25668/48162 cut-off events. For 294227/300811 co-relation queries the response was YES. Maximal size of possible extension queue 2001. Compared 480038 event pairs, 3661 based on Foata normal form. 5191/51533 useless extension candidates. Maximal degree in co-relation 240589. Up to 14164 conditions per place. [2023-08-04 08:59:02,671 INFO L140 encePairwiseOnDemand]: 232/243 looper letters, 376 selfloop transitions, 130 changer transitions 121/731 dead transitions. [2023-08-04 08:59:02,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 731 transitions, 6989 flow [2023-08-04 08:59:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-04 08:59:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-04 08:59:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2785 transitions. [2023-08-04 08:59:02,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983002325997495 [2023-08-04 08:59:02,674 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2785 transitions. [2023-08-04 08:59:02,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2785 transitions. [2023-08-04 08:59:02,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:59:02,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2785 transitions. [2023-08-04 08:59:02,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 121.08695652173913) internal successors, (2785), 23 states have internal predecessors, (2785), 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 08:59:02,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 243.0) internal successors, (5832), 24 states have internal predecessors, (5832), 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 08:59:02,681 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 243.0) internal successors, (5832), 24 states have internal predecessors, (5832), 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 08:59:02,681 INFO L175 Difference]: Start difference. First operand has 137 places, 229 transitions, 1979 flow. Second operand 23 states and 2785 transitions. [2023-08-04 08:59:02,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 731 transitions, 6989 flow [2023-08-04 08:59:04,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 731 transitions, 6661 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-08-04 08:59:04,880 INFO L231 Difference]: Finished difference. Result has 162 places, 294 transitions, 2888 flow [2023-08-04 08:59:04,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2888, PETRI_PLACES=162, PETRI_TRANSITIONS=294} [2023-08-04 08:59:04,880 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 114 predicate places. [2023-08-04 08:59:04,880 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 294 transitions, 2888 flow [2023-08-04 08:59:04,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 109.0625) internal successors, (1745), 16 states have internal predecessors, (1745), 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 08:59:04,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:59:04,881 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-04 08:59:04,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-04 08:59:05,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:59:05,085 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:59:05,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:59:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 656212951, now seen corresponding path program 5 times [2023-08-04 08:59:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:59:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162474550] [2023-08-04 08:59:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:59:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:59:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:59:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 08:59:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:59:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162474550] [2023-08-04 08:59:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162474550] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:59:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162496486] [2023-08-04 08:59:05,538 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 08:59:05,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:59:05,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:59:05,544 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:59:05,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-04 08:59:05,666 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-04 08:59:05,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 08:59:05,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 08:59:05,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:59:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 08:59:05,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:59:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 08:59:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162496486] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:59:05,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:59:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 21 [2023-08-04 08:59:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515158337] [2023-08-04 08:59:05,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:59:05,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 08:59:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:59:05,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 08:59:05,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2023-08-04 08:59:06,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 243 [2023-08-04 08:59:06,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 294 transitions, 2888 flow. Second operand has 22 states, 22 states have (on average 94.45454545454545) internal successors, (2078), 22 states have internal predecessors, (2078), 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 08:59:06,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:59:06,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 243 [2023-08-04 08:59:06,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:59:11,299 INFO L124 PetriNetUnfolderBase]: 7651/15266 cut-off events. [2023-08-04 08:59:11,299 INFO L125 PetriNetUnfolderBase]: For 108935/109838 co-relation queries the response was YES. [2023-08-04 08:59:11,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83687 conditions, 15266 events. 7651/15266 cut-off events. For 108935/109838 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 131474 event pairs, 557 based on Foata normal form. 1361/16352 useless extension candidates. Maximal degree in co-relation 83479. Up to 3346 conditions per place. [2023-08-04 08:59:11,365 INFO L140 encePairwiseOnDemand]: 222/243 looper letters, 0 selfloop transitions, 0 changer transitions 942/942 dead transitions. [2023-08-04 08:59:11,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 942 transitions, 10465 flow [2023-08-04 08:59:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-08-04 08:59:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2023-08-04 08:59:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 9148 transitions. [2023-08-04 08:59:11,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40049032484020664 [2023-08-04 08:59:11,373 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 9148 transitions. [2023-08-04 08:59:11,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 9148 transitions. [2023-08-04 08:59:11,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:59:11,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 9148 transitions. [2023-08-04 08:59:11,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 95 states, 94 states have (on average 97.31914893617021) internal successors, (9148), 94 states have internal predecessors, (9148), 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 08:59:11,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 95 states, 95 states have (on average 243.0) internal successors, (23085), 95 states have internal predecessors, (23085), 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 08:59:11,406 INFO L81 ComplementDD]: Finished complementDD. Result has 95 states, 95 states have (on average 243.0) internal successors, (23085), 95 states have internal predecessors, (23085), 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 08:59:11,406 INFO L175 Difference]: Start difference. First operand has 162 places, 294 transitions, 2888 flow. Second operand 94 states and 9148 transitions. [2023-08-04 08:59:11,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 942 transitions, 10465 flow [2023-08-04 08:59:12,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 942 transitions, 9659 flow, removed 211 selfloop flow, removed 15 redundant places. [2023-08-04 08:59:12,010 INFO L231 Difference]: Finished difference. Result has 239 places, 0 transitions, 0 flow [2023-08-04 08:59:12,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=94, PETRI_FLOW=0, PETRI_PLACES=239, PETRI_TRANSITIONS=0} [2023-08-04 08:59:12,011 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 191 predicate places. [2023-08-04 08:59:12,011 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 0 transitions, 0 flow [2023-08-04 08:59:12,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 94.45454545454545) internal successors, (2078), 22 states have internal predecessors, (2078), 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 08:59:12,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 08:59:12,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-04 08:59:12,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:59:12,225 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:59:12,226 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 08:59:12,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 144 transitions, 336 flow [2023-08-04 08:59:12,261 INFO L124 PetriNetUnfolderBase]: 118/817 cut-off events. [2023-08-04 08:59:12,261 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 08:59:12,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 817 events. 118/817 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4157 event pairs, 1 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 486. Up to 32 conditions per place. [2023-08-04 08:59:12,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 144 transitions, 336 flow [2023-08-04 08:59:12,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 100 transitions, 224 flow [2023-08-04 08:59:12,263 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 08:59:12,263 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 224 flow [2023-08-04 08:59:12,263 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 224 flow [2023-08-04 08:59:12,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 224 flow [2023-08-04 08:59:12,271 INFO L124 PetriNetUnfolderBase]: 4/206 cut-off events. [2023-08-04 08:59:12,271 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 08:59:12,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 206 events. 4/206 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 446 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 168. Up to 9 conditions per place. [2023-08-04 08:59:12,272 INFO L119 LiptonReduction]: Number of co-enabled transitions 1472 [2023-08-04 08:59:14,330 INFO L134 LiptonReduction]: Checked pairs total: 6649 [2023-08-04 08:59:14,330 INFO L136 LiptonReduction]: Total number of compositions: 77 [2023-08-04 08:59:14,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 08:59:14,331 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;@1fde145f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 08:59:14,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 08:59:14,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 08:59:14,333 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2023-08-04 08:59:14,333 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 08:59:14,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:59:14,334 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-04 08:59:14,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 08:59:14,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:59:14,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2042118930, now seen corresponding path program 1 times [2023-08-04 08:59:14,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:59:14,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338890665] [2023-08-04 08:59:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:59:14,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:59:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:59:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 08:59:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:59:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338890665] [2023-08-04 08:59:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338890665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:59:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:59:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 08:59:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415109076] [2023-08-04 08:59:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:59:14,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:59:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:59:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:59:14,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:59:14,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 221 [2023-08-04 08:59:14,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 08:59:14,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:59:14,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 221 [2023-08-04 08:59:14,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:59:14,496 INFO L124 PetriNetUnfolderBase]: 1953/3278 cut-off events. [2023-08-04 08:59:14,496 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2023-08-04 08:59:14,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6581 conditions, 3278 events. 1953/3278 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20949 event pairs, 1296 based on Foata normal form. 0/3214 useless extension candidates. Maximal degree in co-relation 1452. Up to 2830 conditions per place. [2023-08-04 08:59:14,505 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 24 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-04 08:59:14,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 148 flow [2023-08-04 08:59:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:59:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:59:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-04 08:59:14,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339366515837104 [2023-08-04 08:59:14,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-04 08:59:14,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-04 08:59:14,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:59:14,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-04 08:59:14,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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 08:59:14,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 08:59:14,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 08:59:14,509 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 3 states and 354 transitions. [2023-08-04 08:59:14,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 148 flow [2023-08-04 08:59:14,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 144 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 08:59:14,510 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 94 flow [2023-08-04 08:59:14,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-04 08:59:14,511 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-04 08:59:14,511 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 94 flow [2023-08-04 08:59:14,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 08:59:14,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:59:14,511 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 08:59:14,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-04 08:59:14,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 08:59:14,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:59:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash 139033211, now seen corresponding path program 1 times [2023-08-04 08:59:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:59:14,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212783575] [2023-08-04 08:59:14,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:59:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:59:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:59:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 08:59:14,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:59:14,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212783575] [2023-08-04 08:59:14,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212783575] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:59:14,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795376967] [2023-08-04 08:59:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:59:14,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:59:14,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:59:14,531 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:59:14,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-04 08:59:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:59:14,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 08:59:14,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:59:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 08:59:14,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:59:14,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795376967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:59:14,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:59:14,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 08:59:14,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584726753] [2023-08-04 08:59:14,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:59:14,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:59:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:59:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:59:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 08:59:14,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 221 [2023-08-04 08:59:14,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 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 08:59:14,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:59:14,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 221 [2023-08-04 08:59:14,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:59:14,755 INFO L124 PetriNetUnfolderBase]: 1929/3190 cut-off events. [2023-08-04 08:59:14,755 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2023-08-04 08:59:14,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6412 conditions, 3190 events. 1929/3190 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20222 event pairs, 944 based on Foata normal form. 16/3186 useless extension candidates. Maximal degree in co-relation 1702. Up to 2747 conditions per place. [2023-08-04 08:59:14,765 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 29 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-04 08:59:14,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 180 flow [2023-08-04 08:59:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 08:59:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 08:59:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2023-08-04 08:59:14,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194570135746607 [2023-08-04 08:59:14,767 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2023-08-04 08:59:14,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2023-08-04 08:59:14,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:59:14,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2023-08-04 08:59:14,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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 08:59:14,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 08:59:14,768 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 08:59:14,769 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 94 flow. Second operand 5 states and 574 transitions. [2023-08-04 08:59:14,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 180 flow [2023-08-04 08:59:14,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 08:59:14,769 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 108 flow [2023-08-04 08:59:14,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-04 08:59:14,770 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-04 08:59:14,770 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 108 flow [2023-08-04 08:59:14,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 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 08:59:14,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:59:14,770 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:59:14,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-04 08:59:14,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-04 08:59:14,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 08:59:14,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:59:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash 244884915, now seen corresponding path program 1 times [2023-08-04 08:59:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:59:14,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507014433] [2023-08-04 08:59:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:59:14,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:59:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:59:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 08:59:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:59:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507014433] [2023-08-04 08:59:14,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507014433] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:59:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287625106] [2023-08-04 08:59:14,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:59:14,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:59:14,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:59:15,009 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:59:15,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-04 08:59:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:59:15,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:59:15,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:59:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 08:59:15,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:59:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 08:59:15,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287625106] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:59:15,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:59:15,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 08:59:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270374986] [2023-08-04 08:59:15,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:59:15,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:59:15,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:59:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:59:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:59:15,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 221 [2023-08-04 08:59:15,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 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 08:59:15,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:59:15,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 221 [2023-08-04 08:59:15,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:59:15,243 INFO L124 PetriNetUnfolderBase]: 1650/2671 cut-off events. [2023-08-04 08:59:15,243 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2023-08-04 08:59:15,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5429 conditions, 2671 events. 1650/2671 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16043 event pairs, 629 based on Foata normal form. 4/2659 useless extension candidates. Maximal degree in co-relation 1423. Up to 2305 conditions per place. [2023-08-04 08:59:15,252 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 29 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-04 08:59:15,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 186 flow [2023-08-04 08:59:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:59:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:59:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-08-04 08:59:15,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260180995475113 [2023-08-04 08:59:15,253 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-08-04 08:59:15,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-08-04 08:59:15,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:59:15,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-08-04 08:59:15,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 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 08:59:15,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 08:59:15,254 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 08:59:15,254 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 108 flow. Second operand 4 states and 465 transitions. [2023-08-04 08:59:15,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 186 flow [2023-08-04 08:59:15,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 181 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 08:59:15,255 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 101 flow [2023-08-04 08:59:15,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-08-04 08:59:15,256 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-04 08:59:15,256 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 101 flow [2023-08-04 08:59:15,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 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 08:59:15,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:59:15,256 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:59:15,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-04 08:59:15,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-04 08:59:15,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 08:59:15,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:59:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 909738645, now seen corresponding path program 1 times [2023-08-04 08:59:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:59:15,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589278156] [2023-08-04 08:59:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:59:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:59:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:59:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 08:59:15,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:59:15,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589278156] [2023-08-04 08:59:15,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589278156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:59:15,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:59:15,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 08:59:15,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060180578] [2023-08-04 08:59:15,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:59:15,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 08:59:15,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:59:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 08:59:15,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 08:59:15,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 221 [2023-08-04 08:59:15,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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 08:59:15,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:59:15,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 221 [2023-08-04 08:59:15,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:59:15,569 INFO L124 PetriNetUnfolderBase]: 882/1515 cut-off events. [2023-08-04 08:59:15,569 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2023-08-04 08:59:15,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 1515 events. 882/1515 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8388 event pairs, 42 based on Foata normal form. 256/1766 useless extension candidates. Maximal degree in co-relation 1196. Up to 1040 conditions per place. [2023-08-04 08:59:15,572 INFO L140 encePairwiseOnDemand]: 219/221 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2023-08-04 08:59:15,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 201 flow [2023-08-04 08:59:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:59:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:59:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-08-04 08:59:15,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5350678733031674 [2023-08-04 08:59:15,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-08-04 08:59:15,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-08-04 08:59:15,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:59:15,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-08-04 08:59:15,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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 08:59:15,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 08:59:15,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 08:59:15,574 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 101 flow. Second operand 4 states and 473 transitions. [2023-08-04 08:59:15,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 201 flow [2023-08-04 08:59:15,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 194 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 08:59:15,576 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-04 08:59:15,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2023-08-04 08:59:15,577 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-04 08:59:15,577 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-04 08:59:15,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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 08:59:15,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 08:59:15,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 08:59:15,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-04 08:59:15,577 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 08:59:15,579 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (2/2) [2023-08-04 08:59:15,579 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 08:59:15,579 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 08:59:15,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 08:59:15 BasicIcfg [2023-08-04 08:59:15,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 08:59:15,584 INFO L158 Benchmark]: Toolchain (without parser) took 112996.81ms. Allocated memory was 583.0MB in the beginning and 13.4GB in the end (delta: 12.9GB). Free memory was 535.8MB in the beginning and 8.4GB in the end (delta: -7.9GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. [2023-08-04 08:59:15,585 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 373.3MB. Free memory was 326.1MB in the beginning and 325.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 08:59:15,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.38ms. Allocated memory is still 583.0MB. Free memory was 535.5MB in the beginning and 524.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-04 08:59:15,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.66ms. Allocated memory is still 583.0MB. Free memory was 524.4MB in the beginning and 522.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 08:59:15,585 INFO L158 Benchmark]: Boogie Preprocessor took 31.24ms. Allocated memory is still 583.0MB. Free memory was 522.3MB in the beginning and 520.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 08:59:15,585 INFO L158 Benchmark]: RCFGBuilder took 365.66ms. Allocated memory is still 583.0MB. Free memory was 520.8MB in the beginning and 502.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-04 08:59:15,586 INFO L158 Benchmark]: TraceAbstraction took 112405.29ms. Allocated memory was 583.0MB in the beginning and 13.4GB in the end (delta: 12.9GB). Free memory was 502.0MB in the beginning and 8.4GB in the end (delta: -7.9GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-08-04 08:59:15,589 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 373.3MB. Free memory was 326.1MB in the beginning and 325.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 165.38ms. Allocated memory is still 583.0MB. Free memory was 535.5MB in the beginning and 524.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 22.66ms. Allocated memory is still 583.0MB. Free memory was 524.4MB in the beginning and 522.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.24ms. Allocated memory is still 583.0MB. Free memory was 522.3MB in the beginning and 520.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 365.66ms. Allocated memory is still 583.0MB. Free memory was 520.8MB in the beginning and 502.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 112405.29ms. Allocated memory was 583.0MB in the beginning and 13.4GB in the end (delta: 12.9GB). Free memory was 502.0MB in the beginning and 8.4GB in the end (delta: -7.9GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 110 PlacesBefore, 31 PlacesAfterwards, 115 TransitionsBefore, 30 TransitionsAfterwards, 1280 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 98 TotalNumberOfCompositions, 4931 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3317, independent: 3177, independent conditional: 0, independent unconditional: 3177, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 724, independent: 713, independent conditional: 0, independent unconditional: 713, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3317, independent: 2464, independent conditional: 0, independent unconditional: 2464, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 724, unknown conditional: 0, unknown unconditional: 724] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 88 PlacesBefore, 23 PlacesAfterwards, 85 TransitionsBefore, 18 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 74 TotalNumberOfCompositions, 1785 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1165, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 292, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1165, independent: 769, independent conditional: 0, independent unconditional: 769, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 292, unknown conditional: 0, unknown unconditional: 292] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 129 PlacesBefore, 48 PlacesAfterwards, 134 TransitionsBefore, 47 TransitionsAfterwards, 3160 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 99 TotalNumberOfCompositions, 16225 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6831, independent: 6558, independent conditional: 0, independent unconditional: 6558, dependent: 273, dependent conditional: 0, dependent unconditional: 273, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1516, independent: 1490, independent conditional: 0, independent unconditional: 1490, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6831, independent: 5068, independent conditional: 0, independent unconditional: 5068, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 1516, unknown conditional: 0, unknown unconditional: 1516] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 282, Positive conditional cache size: 0, Positive unconditional cache size: 282, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 107 PlacesBefore, 40 PlacesAfterwards, 100 TransitionsBefore, 31 TransitionsAfterwards, 1472 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 6649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1877, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 640, independent: 615, independent conditional: 0, independent unconditional: 615, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1877, independent: 1040, independent conditional: 0, independent unconditional: 1040, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 640, unknown conditional: 0, unknown unconditional: 640] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 102]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 131 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 23 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 146 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 102.3s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 88.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3476 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3287 mSDsluCounter, 9460 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9349 mSDsCounter, 505 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15659 IncrementalHoareTripleChecker+Invalid, 16164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 505 mSolverCounterUnsat, 111 mSDtfsCounter, 15659 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1399 GetRequests, 1065 SyntacticMatches, 29 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6093 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2888occurred in iteration=15, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1265 NumberOfCodeBlocks, 1265 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1755 ConstructedInterpolants, 4 QuantifiedInterpolants, 12806 SizeOfPredicates, 72 NumberOfNonLiveVariables, 2823 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 42 InterpolantComputations, 8 PerfectInterpolantSequences, 535/653 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 131 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 146 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 9 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 42/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-04 08:59:15,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...