/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure1-alt.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 02:54:25,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 02:54:25,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 02:54:25,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 02:54:25,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 02:54:25,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 02:54:25,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 02:54:25,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 02:54:25,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 02:54:25,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 02:54:25,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 02:54:25,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 02:54:25,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 02:54:25,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 02:54:25,320 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 02:54:25,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 02:54:25,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 02:54:25,321 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 02:54:25,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 02:54:25,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 02:54:25,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 02:54:25,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 02:54:25,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 02:54:25,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 02:54:25,324 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 02:54:25,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 02:54:25,324 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 02:54:25,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 02:54:25,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 02:54:25,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 02:54:25,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:54:25,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 02:54:25,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 02:54:25,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 02:54:25,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 02:54:25,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 02:54:25,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 02:54:25,327 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 02:54:25,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 02:54:25,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 02:54:25,328 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 02:54:25,328 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 -> INSUFFICIENT_FIRST [2023-08-04 02:54:25,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 02:54:25,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 02:54:25,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 02:54:25,598 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 02:54:25,598 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 02:54:25,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure1-alt.wvr_bound2.c [2023-08-04 02:54:26,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 02:54:27,038 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 02:54:27,039 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure1-alt.wvr_bound2.c [2023-08-04 02:54:27,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7579ef6/65803ba86a14488992c64163171dda44/FLAGc6f897392 [2023-08-04 02:54:27,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7579ef6/65803ba86a14488992c64163171dda44 [2023-08-04 02:54:27,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 02:54:27,076 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 02:54:27,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 02:54:27,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 02:54:27,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 02:54:27,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4252b338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27, skipping insertion in model container [2023-08-04 02:54:27,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,108 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 02:54:27,296 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure1-alt.wvr_bound2.c[2249,2262] [2023-08-04 02:54:27,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:54:27,310 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 02:54:27,349 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure1-alt.wvr_bound2.c[2249,2262] [2023-08-04 02:54:27,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:54:27,359 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:54:27,359 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:54:27,365 INFO L206 MainTranslator]: Completed translation [2023-08-04 02:54:27,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27 WrapperNode [2023-08-04 02:54:27,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 02:54:27,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 02:54:27,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 02:54:27,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 02:54:27,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,412 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2023-08-04 02:54:27,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 02:54:27,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 02:54:27,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 02:54:27,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 02:54:27,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 02:54:27,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 02:54:27,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 02:54:27,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 02:54:27,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (1/1) ... [2023-08-04 02:54:27,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:54:27,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:27,480 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 02:54:27,493 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 02:54:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 02:54:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 02:54:27,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 02:54:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 02:54:27,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 02:54:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 02:54:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 02:54:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 02:54:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 02:54:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 02:54:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 02:54:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 02:54:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 02:54:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 02:54:27,518 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 02:54:27,597 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 02:54:27,599 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 02:54:27,844 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 02:54:27,895 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 02:54:27,895 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 02:54:27,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:54:27 BoogieIcfgContainer [2023-08-04 02:54:27,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 02:54:27,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 02:54:27,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 02:54:27,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 02:54:27,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 02:54:27" (1/3) ... [2023-08-04 02:54:27,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e55f339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:54:27, skipping insertion in model container [2023-08-04 02:54:27,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:27" (2/3) ... [2023-08-04 02:54:27,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e55f339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:54:27, skipping insertion in model container [2023-08-04 02:54:27,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:54:27" (3/3) ... [2023-08-04 02:54:27,910 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-figure1-alt.wvr_bound2.c [2023-08-04 02:54:27,918 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 02:54:27,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 02:54:27,927 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 02:54:27,927 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 02:54:28,011 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 02:54:28,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 114 transitions, 250 flow [2023-08-04 02:54:28,172 INFO L124 PetriNetUnfolderBase]: 33/254 cut-off events. [2023-08-04 02:54:28,172 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:54:28,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 254 events. 33/254 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 848 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 139. Up to 8 conditions per place. [2023-08-04 02:54:28,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 114 transitions, 250 flow [2023-08-04 02:54:28,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 114 transitions, 250 flow [2023-08-04 02:54:28,189 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:28,200 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 114 transitions, 250 flow [2023-08-04 02:54:28,203 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 114 transitions, 250 flow [2023-08-04 02:54:28,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 114 transitions, 250 flow [2023-08-04 02:54:28,255 INFO L124 PetriNetUnfolderBase]: 33/254 cut-off events. [2023-08-04 02:54:28,256 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:54:28,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 254 events. 33/254 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 848 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 139. Up to 8 conditions per place. [2023-08-04 02:54:28,270 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 02:54:30,528 INFO L134 LiptonReduction]: Checked pairs total: 3016 [2023-08-04 02:54:30,528 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-04 02:54:30,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:54:30,546 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;@46ee6ed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:30,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:54:30,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:30,552 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2023-08-04 02:54:30,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:54:30,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:30,553 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 02:54:30,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:30,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash 798037067, now seen corresponding path program 1 times [2023-08-04 02:54:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649634489] [2023-08-04 02:54:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:54:30,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 02:54:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:54:30,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 02:54:30,751 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 02:54:30,752 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:54:30,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:54:30,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 02:54:30,754 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 02:54:30,760 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 02:54:30,761 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 02:54:30,761 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 02:54:30,788 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 02:54:30,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:30,871 INFO L124 PetriNetUnfolderBase]: 134/829 cut-off events. [2023-08-04 02:54:30,871 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:30,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 829 events. 134/829 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4223 event pairs, 1 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-04 02:54:30,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:30,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:30,881 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:30,881 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:30,882 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:30,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:30,968 INFO L124 PetriNetUnfolderBase]: 134/829 cut-off events. [2023-08-04 02:54:30,969 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:30,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 829 events. 134/829 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4223 event pairs, 1 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-04 02:54:30,990 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 02:54:33,500 INFO L134 LiptonReduction]: Checked pairs total: 8705 [2023-08-04 02:54:33,501 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-04 02:54:33,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:54:33,503 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;@46ee6ed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:33,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:54:33,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:33,511 INFO L124 PetriNetUnfolderBase]: 7/67 cut-off events. [2023-08-04 02:54:33,511 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 02:54:33,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:33,511 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 02:54:33,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:33,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1148916396, now seen corresponding path program 1 times [2023-08-04 02:54:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788616818] [2023-08-04 02:54:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:33,671 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 02:54:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788616818] [2023-08-04 02:54:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788616818] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661245304] [2023-08-04 02:54:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:33,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:33,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:33,676 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 02:54:33,687 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 02:54:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:33,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:33,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:33,793 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 02:54:33,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:33,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661245304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:33,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:33,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 02:54:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412459080] [2023-08-04 02:54:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:33,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:33,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:33,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:54:33,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-04 02:54:33,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 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 02:54:33,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:33,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-04 02:54:33,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:34,727 INFO L124 PetriNetUnfolderBase]: 8629/11206 cut-off events. [2023-08-04 02:54:34,727 INFO L125 PetriNetUnfolderBase]: For 1019/1019 co-relation queries the response was YES. [2023-08-04 02:54:34,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22676 conditions, 11206 events. 8629/11206 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 49221 event pairs, 2466 based on Foata normal form. 0/6363 useless extension candidates. Maximal degree in co-relation 6877. Up to 10703 conditions per place. [2023-08-04 02:54:34,766 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 23 selfloop transitions, 5 changer transitions 17/52 dead transitions. [2023-08-04 02:54:34,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 234 flow [2023-08-04 02:54:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-08-04 02:54:34,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46613545816733065 [2023-08-04 02:54:34,784 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-08-04 02:54:34,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-08-04 02:54:34,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:34,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-08-04 02:54:34,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 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 02:54:34,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 02:54:34,800 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 02:54:34,801 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 5 states and 585 transitions. [2023-08-04 02:54:34,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 234 flow [2023-08-04 02:54:34,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:34,808 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 91 flow [2023-08-04 02:54:34,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 02:54:34,812 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 02:54:34,812 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 91 flow [2023-08-04 02:54:34,813 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 02:54:34,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:34,813 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 02:54:34,827 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 02:54:35,025 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 02:54:35,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:35,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash 612081948, now seen corresponding path program 1 times [2023-08-04 02:54:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:35,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940661473] [2023-08-04 02:54:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:35,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940661473] [2023-08-04 02:54:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940661473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:54:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404068826] [2023-08-04 02:54:35,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:35,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:35,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:54:35,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-04 02:54:35,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 02:54:35,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:35,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-04 02:54:35,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:35,258 INFO L124 PetriNetUnfolderBase]: 1760/2333 cut-off events. [2023-08-04 02:54:35,258 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-08-04 02:54:35,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2333 events. 1760/2333 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8317 event pairs, 685 based on Foata normal form. 1/1402 useless extension candidates. Maximal degree in co-relation 1396. Up to 2189 conditions per place. [2023-08-04 02:54:35,273 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 21 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 02:54:35,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 140 flow [2023-08-04 02:54:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-04 02:54:35,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648074369189907 [2023-08-04 02:54:35,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-04 02:54:35,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-04 02:54:35,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:35,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-04 02:54:35,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 02:54:35,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 02:54:35,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 02:54:35,279 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 91 flow. Second operand 3 states and 350 transitions. [2023-08-04 02:54:35,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 140 flow [2023-08-04 02:54:35,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 137 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:35,281 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 87 flow [2023-08-04 02:54:35,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-08-04 02:54:35,282 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 02:54:35,282 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 87 flow [2023-08-04 02:54:35,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 02:54:35,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:35,282 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:35,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 02:54:35,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:35,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash 794468992, now seen corresponding path program 1 times [2023-08-04 02:54:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283338882] [2023-08-04 02:54:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:35,346 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 02:54:35,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:35,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283338882] [2023-08-04 02:54:35,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283338882] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:35,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546097194] [2023-08-04 02:54:35,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:35,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:35,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:35,355 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 02:54:35,356 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 02:54:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:35,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:35,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:35,429 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 02:54:35,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:35,457 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 02:54:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546097194] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:35,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:35,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:54:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763197208] [2023-08-04 02:54:35,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:35,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-04 02:54:35,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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 02:54:35,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:35,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-04 02:54:35,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:35,632 INFO L124 PetriNetUnfolderBase]: 1432/1870 cut-off events. [2023-08-04 02:54:35,632 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-08-04 02:54:35,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1870 events. 1432/1870 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6183 event pairs, 357 based on Foata normal form. 3/1117 useless extension candidates. Maximal degree in co-relation 2803. Up to 1729 conditions per place. [2023-08-04 02:54:35,644 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-04 02:54:35,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 150 flow [2023-08-04 02:54:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-08-04 02:54:35,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45717131474103584 [2023-08-04 02:54:35,647 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-08-04 02:54:35,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-08-04 02:54:35,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:35,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-08-04 02:54:35,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 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 02:54:35,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 02:54:35,651 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 02:54:35,651 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 87 flow. Second operand 4 states and 459 transitions. [2023-08-04 02:54:35,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 150 flow [2023-08-04 02:54:35,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:35,654 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 84 flow [2023-08-04 02:54:35,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-04 02:54:35,656 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-08-04 02:54:35,656 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 84 flow [2023-08-04 02:54:35,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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 02:54:35,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:35,659 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:35,667 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 02:54:35,864 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,SelfDestructingSolverStorable3 [2023-08-04 02:54:35,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:35,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1473242237, now seen corresponding path program 1 times [2023-08-04 02:54:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245877913] [2023-08-04 02:54:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:54:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245877913] [2023-08-04 02:54:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245877913] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571308240] [2023-08-04 02:54:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:35,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:35,991 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 02:54:35,994 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 02:54:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:36,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:36,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:54:36,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571308240] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 02:54:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494121551] [2023-08-04 02:54:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:36,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:54:36,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-04 02:54:36,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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 02:54:36,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:36,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-04 02:54:36,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:36,218 INFO L124 PetriNetUnfolderBase]: 1000/1330 cut-off events. [2023-08-04 02:54:36,218 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-04 02:54:36,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1330 events. 1000/1330 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4468 event pairs, 43 based on Foata normal form. 81/871 useless extension candidates. Maximal degree in co-relation 1017. Up to 558 conditions per place. [2023-08-04 02:54:36,222 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2023-08-04 02:54:36,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2023-08-04 02:54:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2023-08-04 02:54:36,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613545816733068 [2023-08-04 02:54:36,224 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2023-08-04 02:54:36,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2023-08-04 02:54:36,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:36,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2023-08-04 02:54:36,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 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 02:54:36,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 02:54:36,228 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 02:54:36,228 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 84 flow. Second operand 5 states and 579 transitions. [2023-08-04 02:54:36,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2023-08-04 02:54:36,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 02:54:36,230 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-08-04 02:54:36,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2023-08-04 02:54:36,231 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 02:54:36,231 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-08-04 02:54:36,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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 02:54:36,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:54:36,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:54:36,240 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 02:54:36,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:36,438 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 02:54:36,438 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 02:54:36,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:36,504 INFO L124 PetriNetUnfolderBase]: 134/829 cut-off events. [2023-08-04 02:54:36,504 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:36,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 829 events. 134/829 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4223 event pairs, 1 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-04 02:54:36,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:36,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:36,513 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:36,513 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:36,513 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:36,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 140 transitions, 328 flow [2023-08-04 02:54:36,569 INFO L124 PetriNetUnfolderBase]: 134/829 cut-off events. [2023-08-04 02:54:36,569 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:36,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 829 events. 134/829 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4223 event pairs, 1 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-04 02:54:36,589 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 02:54:38,593 INFO L134 LiptonReduction]: Checked pairs total: 8653 [2023-08-04 02:54:38,594 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-04 02:54:38,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 02:54:38,596 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;@46ee6ed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:38,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 02:54:38,598 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:38,598 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 02:54:38,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:54:38,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:38,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 02:54:38,598 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:38,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash 809648777, now seen corresponding path program 1 times [2023-08-04 02:54:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:38,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571224453] [2023-08-04 02:54:38,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:38,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:38,629 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 02:54:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571224453] [2023-08-04 02:54:38,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571224453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:38,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:38,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:54:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550759597] [2023-08-04 02:54:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:38,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:38,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:38,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:54:38,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 252 [2023-08-04 02:54:38,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 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 02:54:38,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:38,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 252 [2023-08-04 02:54:38,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:39,235 INFO L124 PetriNetUnfolderBase]: 8526/11037 cut-off events. [2023-08-04 02:54:39,236 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2023-08-04 02:54:39,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22380 conditions, 11037 events. 8526/11037 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47458 event pairs, 3472 based on Foata normal form. 0/6248 useless extension candidates. Maximal degree in co-relation 6836. Up to 10600 conditions per place. [2023-08-04 02:54:39,365 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-04 02:54:39,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 216 flow [2023-08-04 02:54:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-04 02:54:39,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2023-08-04 02:54:39,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-04 02:54:39,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-04 02:54:39,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:39,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-04 02:54:39,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 02:54:39,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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 02:54:39,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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 02:54:39,374 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 366 transitions. [2023-08-04 02:54:39,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 216 flow [2023-08-04 02:54:39,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:54:39,377 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 134 flow [2023-08-04 02:54:39,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-08-04 02:54:39,379 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 02:54:39,379 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 134 flow [2023-08-04 02:54:39,379 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 02:54:39,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:39,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 02:54:39,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:39,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1887726263, now seen corresponding path program 1 times [2023-08-04 02:54:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176288558] [2023-08-04 02:54:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:39,423 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 02:54:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176288558] [2023-08-04 02:54:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176288558] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099066571] [2023-08-04 02:54:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:39,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:39,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:39,425 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 02:54:39,448 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 02:54:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:39,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:39,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:39,489 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 02:54:39,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:39,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099066571] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:39,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:39,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 02:54:39,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884876250] [2023-08-04 02:54:39,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:39,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:39,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:39,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:39,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:39,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 252 [2023-08-04 02:54:39,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 134 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 02:54:39,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:39,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 252 [2023-08-04 02:54:39,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:40,134 INFO L124 PetriNetUnfolderBase]: 8488/11014 cut-off events. [2023-08-04 02:54:40,134 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2023-08-04 02:54:40,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22260 conditions, 11014 events. 8488/11014 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 49212 event pairs, 3438 based on Foata normal form. 0/6262 useless extension candidates. Maximal degree in co-relation 22230. Up to 10389 conditions per place. [2023-08-04 02:54:40,180 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-04 02:54:40,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 234 flow [2023-08-04 02:54:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-04 02:54:40,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2023-08-04 02:54:40,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-04 02:54:40,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-04 02:54:40,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:40,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-04 02:54:40,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 02:54:40,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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 02:54:40,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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 02:54:40,185 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 134 flow. Second operand 3 states and 369 transitions. [2023-08-04 02:54:40,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 234 flow [2023-08-04 02:54:40,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 02:54:40,189 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 138 flow [2023-08-04 02:54:40,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2023-08-04 02:54:40,191 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-04 02:54:40,191 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 138 flow [2023-08-04 02:54:40,191 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 02:54:40,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:40,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:40,199 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 02:54:40,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:40,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:40,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash 342770939, now seen corresponding path program 1 times [2023-08-04 02:54:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:40,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669486323] [2023-08-04 02:54:40,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:40,442 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 02:54:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:40,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669486323] [2023-08-04 02:54:40,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669486323] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:40,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798657707] [2023-08-04 02:54:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:40,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:40,444 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 02:54:40,446 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 02:54:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:40,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:40,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:40,513 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 02:54:40,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:40,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798657707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:40,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:40,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 02:54:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826553456] [2023-08-04 02:54:40,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:40,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:40,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:40,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:40,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 252 [2023-08-04 02:54:40,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 138 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 02:54:40,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:40,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 252 [2023-08-04 02:54:40,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:41,104 INFO L124 PetriNetUnfolderBase]: 7283/9572 cut-off events. [2023-08-04 02:54:41,104 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2023-08-04 02:54:41,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19645 conditions, 9572 events. 7283/9572 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 42990 event pairs, 2490 based on Foata normal form. 0/5673 useless extension candidates. Maximal degree in co-relation 6727. Up to 6828 conditions per place. [2023-08-04 02:54:41,159 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 47 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 02:54:41,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 274 flow [2023-08-04 02:54:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 02:54:41,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2023-08-04 02:54:41,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 02:54:41,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 02:54:41,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:41,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 02:54:41,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 02:54:41,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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 02:54:41,165 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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 02:54:41,165 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 138 flow. Second operand 3 states and 375 transitions. [2023-08-04 02:54:41,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 274 flow [2023-08-04 02:54:41,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:41,167 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 148 flow [2023-08-04 02:54:41,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-04 02:54:41,168 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 02:54:41,168 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 148 flow [2023-08-04 02:54:41,168 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 02:54:41,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:41,168 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 02:54:41,177 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 02:54:41,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:41,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:41,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:41,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1077522986, now seen corresponding path program 1 times [2023-08-04 02:54:41,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510300395] [2023-08-04 02:54:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:41,424 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 02:54:41,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:41,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510300395] [2023-08-04 02:54:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510300395] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:41,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873352786] [2023-08-04 02:54:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:41,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:41,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:41,429 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 02:54:41,431 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 02:54:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:41,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:41,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:41,508 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 02:54:41,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873352786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:41,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:41,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 02:54:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143904738] [2023-08-04 02:54:41,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:41,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:41,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:41,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:41,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 252 [2023-08-04 02:54:41,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 148 flow. Second operand has 3 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 02:54:41,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:41,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 252 [2023-08-04 02:54:41,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:41,994 INFO L124 PetriNetUnfolderBase]: 7160/9501 cut-off events. [2023-08-04 02:54:41,995 INFO L125 PetriNetUnfolderBase]: For 1501/1501 co-relation queries the response was YES. [2023-08-04 02:54:42,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20205 conditions, 9501 events. 7160/9501 cut-off events. For 1501/1501 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 42801 event pairs, 2789 based on Foata normal form. 0/5933 useless extension candidates. Maximal degree in co-relation 7255. Up to 7262 conditions per place. [2023-08-04 02:54:42,032 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-04 02:54:42,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 286 flow [2023-08-04 02:54:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 02:54:42,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2023-08-04 02:54:42,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 02:54:42,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 02:54:42,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:42,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 02:54:42,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 02:54:42,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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 02:54:42,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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 02:54:42,036 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 148 flow. Second operand 3 states and 375 transitions. [2023-08-04 02:54:42,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 286 flow [2023-08-04 02:54:42,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:42,043 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 158 flow [2023-08-04 02:54:42,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-04 02:54:42,043 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-04 02:54:42,043 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 158 flow [2023-08-04 02:54:42,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 02:54:42,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:42,044 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] [2023-08-04 02:54:42,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-04 02:54:42,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:42,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:42,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1965580912, now seen corresponding path program 1 times [2023-08-04 02:54:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:42,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476560996] [2023-08-04 02:54:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:42,307 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 02:54:42,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:42,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476560996] [2023-08-04 02:54:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476560996] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:42,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058237105] [2023-08-04 02:54:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:42,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:42,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:42,310 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 02:54:42,313 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 02:54:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:42,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:42,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:42,383 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 02:54:42,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:42,397 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 02:54:42,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058237105] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:42,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:42,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 02:54:42,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434059096] [2023-08-04 02:54:42,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:42,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:54:42,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:42,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:54:42,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:54:42,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 252 [2023-08-04 02:54:42,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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 02:54:42,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:42,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 252 [2023-08-04 02:54:42,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:42,853 INFO L124 PetriNetUnfolderBase]: 6453/8554 cut-off events. [2023-08-04 02:54:42,853 INFO L125 PetriNetUnfolderBase]: For 1163/1163 co-relation queries the response was YES. [2023-08-04 02:54:42,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18389 conditions, 8554 events. 6453/8554 cut-off events. For 1163/1163 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 38171 event pairs, 1919 based on Foata normal form. 3/5405 useless extension candidates. Maximal degree in co-relation 12362. Up to 8125 conditions per place. [2023-08-04 02:54:42,899 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 41 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-04 02:54:42,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 264 flow [2023-08-04 02:54:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-04 02:54:42,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4712301587301587 [2023-08-04 02:54:42,901 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-04 02:54:42,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-04 02:54:42,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:42,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-04 02:54:42,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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 02:54:42,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 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 02:54:42,905 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 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 02:54:42,905 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 158 flow. Second operand 4 states and 475 transitions. [2023-08-04 02:54:42,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 264 flow [2023-08-04 02:54:42,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:42,925 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 170 flow [2023-08-04 02:54:42,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-04 02:54:42,926 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-04 02:54:42,926 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 170 flow [2023-08-04 02:54:42,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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 02:54:42,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:42,927 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] [2023-08-04 02:54:42,931 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 02:54:43,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:43,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:43,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1969366834, now seen corresponding path program 1 times [2023-08-04 02:54:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:43,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892020203] [2023-08-04 02:54:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:43,186 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 02:54:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892020203] [2023-08-04 02:54:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892020203] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653173656] [2023-08-04 02:54:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:43,190 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 02:54:43,193 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 02:54:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:43,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:43,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:43,261 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 02:54:43,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:43,275 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 02:54:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653173656] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:43,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:43,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:54:43,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707613334] [2023-08-04 02:54:43,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:43,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:43,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:43,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:43,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 252 [2023-08-04 02:54:43,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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 02:54:43,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:43,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 252 [2023-08-04 02:54:43,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:43,685 INFO L124 PetriNetUnfolderBase]: 6114/8098 cut-off events. [2023-08-04 02:54:43,685 INFO L125 PetriNetUnfolderBase]: For 777/777 co-relation queries the response was YES. [2023-08-04 02:54:43,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 8098 events. 6114/8098 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 36611 event pairs, 1699 based on Foata normal form. 27/5129 useless extension candidates. Maximal degree in co-relation 11398. Up to 6552 conditions per place. [2023-08-04 02:54:43,719 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 49 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 02:54:43,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 308 flow [2023-08-04 02:54:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 02:54:43,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-04 02:54:43,721 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 02:54:43,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 02:54:43,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:43,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 02:54:43,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 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 02:54:43,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 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 02:54:43,724 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 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 02:54:43,724 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 170 flow. Second operand 4 states and 483 transitions. [2023-08-04 02:54:43,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 308 flow [2023-08-04 02:54:43,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 299 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 02:54:43,737 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 175 flow [2023-08-04 02:54:43,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-08-04 02:54:43,737 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-04 02:54:43,737 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 175 flow [2023-08-04 02:54:43,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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 02:54:43,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:43,738 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] [2023-08-04 02:54:43,743 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 02:54:43,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 02:54:43,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:43,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash 774018399, now seen corresponding path program 1 times [2023-08-04 02:54:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:43,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958905570] [2023-08-04 02:54:43,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:43,982 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 02:54:43,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:43,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958905570] [2023-08-04 02:54:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958905570] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:43,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289557245] [2023-08-04 02:54:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:43,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:43,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:43,984 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 02:54:43,987 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 02:54:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:44,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:44,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:44,062 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 02:54:44,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:44,074 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 02:54:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289557245] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:44,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:44,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:54:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009881720] [2023-08-04 02:54:44,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:44,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 252 [2023-08-04 02:54:44,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 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 02:54:44,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:44,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 252 [2023-08-04 02:54:44,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:44,409 INFO L124 PetriNetUnfolderBase]: 4136/5529 cut-off events. [2023-08-04 02:54:44,409 INFO L125 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES. [2023-08-04 02:54:44,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11980 conditions, 5529 events. 4136/5529 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22775 event pairs, 747 based on Foata normal form. 108/3585 useless extension candidates. Maximal degree in co-relation 10556. Up to 2080 conditions per place. [2023-08-04 02:54:44,427 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-04 02:54:44,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 346 flow [2023-08-04 02:54:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 02:54:44,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-04 02:54:44,429 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 02:54:44,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 02:54:44,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:44,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 02:54:44,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:44,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 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 02:54:44,432 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 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 02:54:44,432 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 175 flow. Second operand 4 states and 489 transitions. [2023-08-04 02:54:44,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 346 flow [2023-08-04 02:54:44,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 02:54:44,440 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 186 flow [2023-08-04 02:54:44,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-04 02:54:44,440 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-04 02:54:44,441 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 186 flow [2023-08-04 02:54:44,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 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 02:54:44,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:44,441 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] [2023-08-04 02:54:44,448 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 02:54:44,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:44,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:44,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash 614120141, now seen corresponding path program 1 times [2023-08-04 02:54:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31013641] [2023-08-04 02:54:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:44,706 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 02:54:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31013641] [2023-08-04 02:54:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31013641] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30107702] [2023-08-04 02:54:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:44,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:44,708 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 02:54:44,729 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 02:54:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:44,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:44,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:44,806 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 02:54:44,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:44,818 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 02:54:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30107702] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:44,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:54:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828911458] [2023-08-04 02:54:44,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:44,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:44,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:44,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 252 [2023-08-04 02:54:44,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 186 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 02:54:44,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:44,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 252 [2023-08-04 02:54:44,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:45,129 INFO L124 PetriNetUnfolderBase]: 4120/5502 cut-off events. [2023-08-04 02:54:45,130 INFO L125 PetriNetUnfolderBase]: For 2154/2154 co-relation queries the response was YES. [2023-08-04 02:54:45,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12516 conditions, 5502 events. 4120/5502 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22648 event pairs, 1861 based on Foata normal form. 13/3471 useless extension candidates. Maximal degree in co-relation 11102. Up to 4661 conditions per place. [2023-08-04 02:54:45,155 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 55 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2023-08-04 02:54:45,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 358 flow [2023-08-04 02:54:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 02:54:45,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-04 02:54:45,157 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 02:54:45,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 02:54:45,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:45,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 02:54:45,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 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 02:54:45,161 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 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 02:54:45,161 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 186 flow. Second operand 4 states and 489 transitions. [2023-08-04 02:54:45,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 358 flow [2023-08-04 02:54:45,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:45,174 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 190 flow [2023-08-04 02:54:45,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-04 02:54:45,174 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 02:54:45,175 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 190 flow [2023-08-04 02:54:45,175 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 02:54:45,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:45,175 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] [2023-08-04 02:54:45,180 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 02:54:45,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 02:54:45,378 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:45,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash 761805999, now seen corresponding path program 1 times [2023-08-04 02:54:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630238384] [2023-08-04 02:54:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:54:45,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:45,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630238384] [2023-08-04 02:54:45,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630238384] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:45,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711002451] [2023-08-04 02:54:45,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:45,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:45,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:45,799 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 02:54:45,802 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 02:54:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:45,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:54:45,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:54:46,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:54:46,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711002451] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:46,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:46,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-08-04 02:54:46,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338710503] [2023-08-04 02:54:46,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:46,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-04 02:54:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-04 02:54:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-08-04 02:54:46,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 252 [2023-08-04 02:54:46,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 190 flow. Second operand has 17 states, 17 states have (on average 105.29411764705883) internal successors, (1790), 17 states have internal predecessors, (1790), 0 states have call successors, (0), 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 02:54:46,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:46,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 252 [2023-08-04 02:54:46,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:47,282 INFO L124 PetriNetUnfolderBase]: 4901/6837 cut-off events. [2023-08-04 02:54:47,282 INFO L125 PetriNetUnfolderBase]: For 3969/3969 co-relation queries the response was YES. [2023-08-04 02:54:47,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16319 conditions, 6837 events. 4901/6837 cut-off events. For 3969/3969 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 32915 event pairs, 433 based on Foata normal form. 1/5008 useless extension candidates. Maximal degree in co-relation 15942. Up to 4623 conditions per place. [2023-08-04 02:54:47,327 INFO L140 encePairwiseOnDemand]: 242/252 looper letters, 153 selfloop transitions, 11 changer transitions 10/180 dead transitions. [2023-08-04 02:54:47,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 180 transitions, 1182 flow [2023-08-04 02:54:47,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:54:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:54:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-08-04 02:54:47,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49036281179138325 [2023-08-04 02:54:47,330 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-08-04 02:54:47,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-08-04 02:54:47,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:47,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-08-04 02:54:47,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 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 02:54:47,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:47,335 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:47,335 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 190 flow. Second operand 7 states and 865 transitions. [2023-08-04 02:54:47,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 180 transitions, 1182 flow [2023-08-04 02:54:47,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 180 transitions, 1143 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-04 02:54:47,360 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 271 flow [2023-08-04 02:54:47,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=271, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2023-08-04 02:54:47,360 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-04 02:54:47,360 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 271 flow [2023-08-04 02:54:47,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 105.29411764705883) internal successors, (1790), 17 states have internal predecessors, (1790), 0 states have call successors, (0), 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 02:54:47,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:47,361 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] [2023-08-04 02:54:47,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-04 02:54:47,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 02:54:47,567 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:47,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -873495083, now seen corresponding path program 2 times [2023-08-04 02:54:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:47,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178509882] [2023-08-04 02:54:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:47,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:54:48,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:48,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178509882] [2023-08-04 02:54:48,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178509882] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:48,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491063511] [2023-08-04 02:54:48,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:54:48,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:48,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:48,198 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 02:54:48,201 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 02:54:48,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:54:48,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:54:48,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:54:48,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:54:48,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491063511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:48,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:48,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2023-08-04 02:54:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048989489] [2023-08-04 02:54:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:48,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:54:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:54:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-08-04 02:54:48,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 252 [2023-08-04 02:54:48,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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 02:54:48,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:48,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 252 [2023-08-04 02:54:48,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:49,459 INFO L124 PetriNetUnfolderBase]: 5267/7679 cut-off events. [2023-08-04 02:54:49,460 INFO L125 PetriNetUnfolderBase]: For 12223/12650 co-relation queries the response was YES. [2023-08-04 02:54:49,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25212 conditions, 7679 events. 5267/7679 cut-off events. For 12223/12650 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 41245 event pairs, 777 based on Foata normal form. 418/7827 useless extension candidates. Maximal degree in co-relation 24601. Up to 4494 conditions per place. [2023-08-04 02:54:49,523 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 143 selfloop transitions, 27 changer transitions 8/185 dead transitions. [2023-08-04 02:54:49,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 185 transitions, 1254 flow [2023-08-04 02:54:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:54:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:54:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-04 02:54:49,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852607709750567 [2023-08-04 02:54:49,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-04 02:54:49,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-04 02:54:49,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:49,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-04 02:54:49,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 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 02:54:49,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:49,532 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:49,532 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 271 flow. Second operand 7 states and 856 transitions. [2023-08-04 02:54:49,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 185 transitions, 1254 flow [2023-08-04 02:54:49,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 185 transitions, 1244 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-04 02:54:49,563 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 440 flow [2023-08-04 02:54:49,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-08-04 02:54:49,564 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2023-08-04 02:54:49,564 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 440 flow [2023-08-04 02:54:49,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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 02:54:49,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:49,565 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] [2023-08-04 02:54:49,571 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 02:54:49,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 02:54:49,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:49,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 658236645, now seen corresponding path program 1 times [2023-08-04 02:54:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582787934] [2023-08-04 02:54:49,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,367 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 02:54:50,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:50,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582787934] [2023-08-04 02:54:50,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582787934] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:50,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487289959] [2023-08-04 02:54:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:50,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:50,369 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 02:54:50,372 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 02:54:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:54:50,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:54:50,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487289959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:50,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:50,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2023-08-04 02:54:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535466876] [2023-08-04 02:54:50,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:50,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:54:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:54:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-08-04 02:54:50,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 252 [2023-08-04 02:54:50,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 440 flow. Second operand has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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 02:54:50,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:50,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 252 [2023-08-04 02:54:50,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:51,928 INFO L124 PetriNetUnfolderBase]: 6342/9543 cut-off events. [2023-08-04 02:54:51,928 INFO L125 PetriNetUnfolderBase]: For 22929/24482 co-relation queries the response was YES. [2023-08-04 02:54:51,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35009 conditions, 9543 events. 6342/9543 cut-off events. For 22929/24482 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 56339 event pairs, 823 based on Foata normal form. 1229/10280 useless extension candidates. Maximal degree in co-relation 34009. Up to 4682 conditions per place. [2023-08-04 02:54:51,972 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 143 selfloop transitions, 41 changer transitions 13/206 dead transitions. [2023-08-04 02:54:51,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 206 transitions, 1555 flow [2023-08-04 02:54:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:54:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:54:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-08-04 02:54:51,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846938775510204 [2023-08-04 02:54:51,975 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-08-04 02:54:51,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-08-04 02:54:51,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:51,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-08-04 02:54:51,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 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 02:54:51,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:51,981 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:51,981 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 440 flow. Second operand 7 states and 855 transitions. [2023-08-04 02:54:51,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 206 transitions, 1555 flow [2023-08-04 02:54:52,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 206 transitions, 1512 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:52,025 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 632 flow [2023-08-04 02:54:52,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=632, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2023-08-04 02:54:52,026 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2023-08-04 02:54:52,026 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 632 flow [2023-08-04 02:54:52,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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 02:54:52,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:52,026 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] [2023-08-04 02:54:52,033 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 02:54:52,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 02:54:52,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:52,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash 425727503, now seen corresponding path program 3 times [2023-08-04 02:54:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091117557] [2023-08-04 02:54:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:52,593 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 02:54:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091117557] [2023-08-04 02:54:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091117557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:52,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:54:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63389924] [2023-08-04 02:54:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:52,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:54:52,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:54:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 02:54:52,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 252 [2023-08-04 02:54:52,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 632 flow. Second operand has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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 02:54:52,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:52,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 252 [2023-08-04 02:54:52,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:53,960 INFO L124 PetriNetUnfolderBase]: 7820/12396 cut-off events. [2023-08-04 02:54:53,960 INFO L125 PetriNetUnfolderBase]: For 37311/39171 co-relation queries the response was YES. [2023-08-04 02:54:54,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49603 conditions, 12396 events. 7820/12396 cut-off events. For 37311/39171 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 82225 event pairs, 1164 based on Foata normal form. 1663/13440 useless extension candidates. Maximal degree in co-relation 48055. Up to 4945 conditions per place. [2023-08-04 02:54:54,050 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 156 selfloop transitions, 53 changer transitions 16/235 dead transitions. [2023-08-04 02:54:54,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 235 transitions, 1939 flow [2023-08-04 02:54:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:54:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:54:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2023-08-04 02:54:54,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2023-08-04 02:54:54,053 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2023-08-04 02:54:54,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2023-08-04 02:54:54,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:54,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2023-08-04 02:54:54,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 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 02:54:54,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:54,058 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:54,058 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 632 flow. Second operand 7 states and 873 transitions. [2023-08-04 02:54:54,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 235 transitions, 1939 flow [2023-08-04 02:54:54,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 235 transitions, 1846 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:54,196 INFO L231 Difference]: Finished difference. Result has 94 places, 107 transitions, 821 flow [2023-08-04 02:54:54,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=821, PETRI_PLACES=94, PETRI_TRANSITIONS=107} [2023-08-04 02:54:54,197 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2023-08-04 02:54:54,197 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 107 transitions, 821 flow [2023-08-04 02:54:54,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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 02:54:54,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:54,197 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] [2023-08-04 02:54:54,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 02:54:54,198 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:54,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 414701051, now seen corresponding path program 4 times [2023-08-04 02:54:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184509518] [2023-08-04 02:54:54,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:54,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:54:54,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:54,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184509518] [2023-08-04 02:54:54,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184509518] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:54,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907488724] [2023-08-04 02:54:54,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 02:54:54,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:54,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:54,764 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 02:54:54,767 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 02:54:54,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 02:54:54,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:54:54,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:54:54,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:55,226 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 02:54:55,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907488724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:55,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:55,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2023-08-04 02:54:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42988002] [2023-08-04 02:54:55,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:55,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:54:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:54:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-08-04 02:54:55,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 252 [2023-08-04 02:54:55,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 107 transitions, 821 flow. Second operand has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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 02:54:55,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:55,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 252 [2023-08-04 02:54:55,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:56,574 INFO L124 PetriNetUnfolderBase]: 8679/13802 cut-off events. [2023-08-04 02:54:56,574 INFO L125 PetriNetUnfolderBase]: For 55032/57272 co-relation queries the response was YES. [2023-08-04 02:54:56,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59243 conditions, 13802 events. 8679/13802 cut-off events. For 55032/57272 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 93203 event pairs, 1558 based on Foata normal form. 1890/15083 useless extension candidates. Maximal degree in co-relation 57048. Up to 5564 conditions per place. [2023-08-04 02:54:56,686 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 140 selfloop transitions, 141 changer transitions 9/299 dead transitions. [2023-08-04 02:54:56,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 299 transitions, 2832 flow [2023-08-04 02:54:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:54:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:54:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-08-04 02:54:56,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48072562358276644 [2023-08-04 02:54:56,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-08-04 02:54:56,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-08-04 02:54:56,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:56,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-08-04 02:54:56,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 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 02:54:56,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:56,694 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:54:56,694 INFO L175 Difference]: Start difference. First operand has 94 places, 107 transitions, 821 flow. Second operand 7 states and 848 transitions. [2023-08-04 02:54:56,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 299 transitions, 2832 flow [2023-08-04 02:54:56,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 299 transitions, 2608 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 02:54:56,826 INFO L231 Difference]: Finished difference. Result has 102 places, 195 transitions, 1862 flow [2023-08-04 02:54:56,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1862, PETRI_PLACES=102, PETRI_TRANSITIONS=195} [2023-08-04 02:54:56,827 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2023-08-04 02:54:56,827 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 195 transitions, 1862 flow [2023-08-04 02:54:56,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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 02:54:56,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:56,828 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] [2023-08-04 02:54:56,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 02:54:57,028 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 02:54:57,028 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:57,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1407855151, now seen corresponding path program 1 times [2023-08-04 02:54:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848052135] [2023-08-04 02:54:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:54:57,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:57,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848052135] [2023-08-04 02:54:57,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848052135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:57,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:57,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:54:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288127251] [2023-08-04 02:54:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:57,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:54:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:57,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:54:57,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 02:54:57,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 252 [2023-08-04 02:54:57,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 195 transitions, 1862 flow. Second operand has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 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 02:54:57,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:57,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 252 [2023-08-04 02:54:57,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:59,928 INFO L124 PetriNetUnfolderBase]: 11643/18784 cut-off events. [2023-08-04 02:54:59,928 INFO L125 PetriNetUnfolderBase]: For 85814/88184 co-relation queries the response was YES. [2023-08-04 02:55:00,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87041 conditions, 18784 events. 11643/18784 cut-off events. For 85814/88184 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 136114 event pairs, 1808 based on Foata normal form. 2228/19980 useless extension candidates. Maximal degree in co-relation 83641. Up to 6407 conditions per place. [2023-08-04 02:55:00,060 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 159 selfloop transitions, 181 changer transitions 12/365 dead transitions. [2023-08-04 02:55:00,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 365 transitions, 3823 flow [2023-08-04 02:55:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:55:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:55:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2023-08-04 02:55:00,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931972789115646 [2023-08-04 02:55:00,063 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2023-08-04 02:55:00,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2023-08-04 02:55:00,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:00,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2023-08-04 02:55:00,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 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 02:55:00,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:55:00,068 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:55:00,069 INFO L175 Difference]: Start difference. First operand has 102 places, 195 transitions, 1862 flow. Second operand 7 states and 870 transitions. [2023-08-04 02:55:00,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 365 transitions, 3823 flow [2023-08-04 02:55:00,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 365 transitions, 3644 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:00,311 INFO L231 Difference]: Finished difference. Result has 110 places, 241 transitions, 2648 flow [2023-08-04 02:55:00,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1727, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2648, PETRI_PLACES=110, PETRI_TRANSITIONS=241} [2023-08-04 02:55:00,311 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2023-08-04 02:55:00,312 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 241 transitions, 2648 flow [2023-08-04 02:55:00,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 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 02:55:00,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:00,312 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] [2023-08-04 02:55:00,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 02:55:00,312 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:00,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 84040887, now seen corresponding path program 2 times [2023-08-04 02:55:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:00,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745143042] [2023-08-04 02:55:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:00,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:00,839 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 02:55:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745143042] [2023-08-04 02:55:00,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745143042] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093795260] [2023-08-04 02:55:00,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:00,841 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 02:55:00,845 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 02:55:00,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:00,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:00,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:55:00,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:01,365 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 02:55:01,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:55:01,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093795260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:01,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:55:01,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2023-08-04 02:55:01,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352255664] [2023-08-04 02:55:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:01,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:55:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:01,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:55:01,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-08-04 02:55:01,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 252 [2023-08-04 02:55:01,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 241 transitions, 2648 flow. Second operand has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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 02:55:01,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:01,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 252 [2023-08-04 02:55:01,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:04,661 INFO L124 PetriNetUnfolderBase]: 14832/24770 cut-off events. [2023-08-04 02:55:04,661 INFO L125 PetriNetUnfolderBase]: For 149791/154148 co-relation queries the response was YES. [2023-08-04 02:55:04,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122099 conditions, 24770 events. 14832/24770 cut-off events. For 149791/154148 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 196817 event pairs, 3267 based on Foata normal form. 3941/27702 useless extension candidates. Maximal degree in co-relation 116721. Up to 7491 conditions per place. [2023-08-04 02:55:04,924 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 147 selfloop transitions, 269 changer transitions 13/439 dead transitions. [2023-08-04 02:55:04,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 439 transitions, 5302 flow [2023-08-04 02:55:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:55:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:55:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-08-04 02:55:04,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481859410430839 [2023-08-04 02:55:04,927 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-08-04 02:55:04,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-08-04 02:55:04,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:04,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-08-04 02:55:04,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 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 02:55:04,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:55:04,932 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:55:04,932 INFO L175 Difference]: Start difference. First operand has 110 places, 241 transitions, 2648 flow. Second operand 7 states and 850 transitions. [2023-08-04 02:55:04,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 439 transitions, 5302 flow [2023-08-04 02:55:05,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 439 transitions, 4937 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 02:55:05,409 INFO L231 Difference]: Finished difference. Result has 117 places, 328 transitions, 4157 flow [2023-08-04 02:55:05,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=2403, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4157, PETRI_PLACES=117, PETRI_TRANSITIONS=328} [2023-08-04 02:55:05,409 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2023-08-04 02:55:05,409 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 328 transitions, 4157 flow [2023-08-04 02:55:05,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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 02:55:05,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:05,410 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] [2023-08-04 02:55:05,417 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 02:55:05,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:05,616 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:05,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash -903874375, now seen corresponding path program 2 times [2023-08-04 02:55:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497575957] [2023-08-04 02:55:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 02:55:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497575957] [2023-08-04 02:55:06,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497575957] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744868031] [2023-08-04 02:55:06,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:06,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:06,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:06,429 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 02:55:06,433 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 02:55:06,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:06,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:06,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:55:06,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:55:06,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:55:07,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744868031] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:07,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 23 [2023-08-04 02:55:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607652835] [2023-08-04 02:55:07,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:07,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-04 02:55:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:07,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-04 02:55:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2023-08-04 02:55:08,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 252 [2023-08-04 02:55:08,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 328 transitions, 4157 flow. Second operand has 24 states, 24 states have (on average 83.54166666666667) internal successors, (2005), 24 states have internal predecessors, (2005), 0 states have call successors, (0), 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 02:55:08,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:08,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 252 [2023-08-04 02:55:08,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:16,083 INFO L124 PetriNetUnfolderBase]: 27658/45016 cut-off events. [2023-08-04 02:55:16,084 INFO L125 PetriNetUnfolderBase]: For 379747/393315 co-relation queries the response was YES. [2023-08-04 02:55:16,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245316 conditions, 45016 events. 27658/45016 cut-off events. For 379747/393315 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 365153 event pairs, 3209 based on Foata normal form. 7104/50002 useless extension candidates. Maximal degree in co-relation 235212. Up to 10133 conditions per place. [2023-08-04 02:55:16,559 INFO L140 encePairwiseOnDemand]: 228/252 looper letters, 477 selfloop transitions, 1639 changer transitions 55/2182 dead transitions. [2023-08-04 02:55:16,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 2182 transitions, 31668 flow [2023-08-04 02:55:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-08-04 02:55:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-08-04 02:55:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 5172 transitions. [2023-08-04 02:55:16,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34786117836965297 [2023-08-04 02:55:16,571 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 5172 transitions. [2023-08-04 02:55:16,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 5172 transitions. [2023-08-04 02:55:16,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:16,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 5172 transitions. [2023-08-04 02:55:16,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 87.66101694915254) internal successors, (5172), 59 states have internal predecessors, (5172), 0 states have call successors, (0), 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 02:55:16,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 252.0) internal successors, (15120), 60 states have internal predecessors, (15120), 0 states have call successors, (0), 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 02:55:16,602 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 252.0) internal successors, (15120), 60 states have internal predecessors, (15120), 0 states have call successors, (0), 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 02:55:16,602 INFO L175 Difference]: Start difference. First operand has 117 places, 328 transitions, 4157 flow. Second operand 59 states and 5172 transitions. [2023-08-04 02:55:16,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 2182 transitions, 31668 flow [2023-08-04 02:55:17,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 2182 transitions, 29665 flow, removed 90 selfloop flow, removed 2 redundant places. [2023-08-04 02:55:17,860 INFO L231 Difference]: Finished difference. Result has 206 places, 1696 transitions, 26715 flow [2023-08-04 02:55:17,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3855, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=26715, PETRI_PLACES=206, PETRI_TRANSITIONS=1696} [2023-08-04 02:55:17,861 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places. [2023-08-04 02:55:17,861 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 1696 transitions, 26715 flow [2023-08-04 02:55:17,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 83.54166666666667) internal successors, (2005), 24 states have internal predecessors, (2005), 0 states have call successors, (0), 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 02:55:17,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:17,862 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] [2023-08-04 02:55:17,866 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 02:55:18,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:18,063 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:18,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1654040707, now seen corresponding path program 5 times [2023-08-04 02:55:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:18,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733728591] [2023-08-04 02:55:18,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:18,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 02:55:18,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:18,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733728591] [2023-08-04 02:55:18,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733728591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:18,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560112527] [2023-08-04 02:55:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:18,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:55:18,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:55:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 02:55:18,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 252 [2023-08-04 02:55:18,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 1696 transitions, 26715 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 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 02:55:18,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:18,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 252 [2023-08-04 02:55:18,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:30,841 INFO L124 PetriNetUnfolderBase]: 25261/44412 cut-off events. [2023-08-04 02:55:30,841 INFO L125 PetriNetUnfolderBase]: For 573277/578646 co-relation queries the response was YES. [2023-08-04 02:55:31,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286751 conditions, 44412 events. 25261/44412 cut-off events. For 573277/578646 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 401654 event pairs, 5304 based on Foata normal form. 3933/47062 useless extension candidates. Maximal degree in co-relation 271796. Up to 15696 conditions per place. [2023-08-04 02:55:31,824 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 341 selfloop transitions, 1573 changer transitions 34/1996 dead transitions. [2023-08-04 02:55:31,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 1996 transitions, 33960 flow [2023-08-04 02:55:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:55:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:55:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2023-08-04 02:55:31,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931972789115646 [2023-08-04 02:55:31,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2023-08-04 02:55:31,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2023-08-04 02:55:31,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:31,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2023-08-04 02:55:31,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 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 02:55:31,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:55:31,830 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:55:31,830 INFO L175 Difference]: Start difference. First operand has 206 places, 1696 transitions, 26715 flow. Second operand 7 states and 870 transitions. [2023-08-04 02:55:31,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 1996 transitions, 33960 flow [2023-08-04 02:55:36,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1996 transitions, 33489 flow, removed 123 selfloop flow, removed 8 redundant places. [2023-08-04 02:55:36,559 INFO L231 Difference]: Finished difference. Result has 208 places, 1738 transitions, 31807 flow [2023-08-04 02:55:36,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=26483, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1531, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=31807, PETRI_PLACES=208, PETRI_TRANSITIONS=1738} [2023-08-04 02:55:36,560 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 167 predicate places. [2023-08-04 02:55:36,561 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 1738 transitions, 31807 flow [2023-08-04 02:55:36,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 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 02:55:36,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:36,561 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] [2023-08-04 02:55:36,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-04 02:55:36,561 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:36,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash -609972421, now seen corresponding path program 6 times [2023-08-04 02:55:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:36,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467146415] [2023-08-04 02:55:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:36,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 02:55:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:36,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467146415] [2023-08-04 02:55:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467146415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:36,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:36,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672825737] [2023-08-04 02:55:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:36,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:55:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:55:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 02:55:36,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 252 [2023-08-04 02:55:36,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 1738 transitions, 31807 flow. Second operand has 7 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 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 02:55:36,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:36,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 252 [2023-08-04 02:55:36,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:47,735 INFO L124 PetriNetUnfolderBase]: 23322/41649 cut-off events. [2023-08-04 02:55:47,735 INFO L125 PetriNetUnfolderBase]: For 591967/604710 co-relation queries the response was YES. [2023-08-04 02:55:48,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275651 conditions, 41649 events. 23322/41649 cut-off events. For 591967/604710 co-relation queries the response was YES. Maximal size of possible extension queue 1613. Compared 381006 event pairs, 6446 based on Foata normal form. 4944/44979 useless extension candidates. Maximal degree in co-relation 260495. Up to 12908 conditions per place. [2023-08-04 02:55:48,716 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 225 selfloop transitions, 1597 changer transitions 30/1885 dead transitions. [2023-08-04 02:55:48,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1885 transitions, 37074 flow [2023-08-04 02:55:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:55:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:55:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2023-08-04 02:55:48,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2023-08-04 02:55:48,719 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2023-08-04 02:55:48,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2023-08-04 02:55:48,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:48,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2023-08-04 02:55:48,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 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 02:55:48,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:55:48,723 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:55:48,723 INFO L175 Difference]: Start difference. First operand has 208 places, 1738 transitions, 31807 flow. Second operand 7 states and 876 transitions. [2023-08-04 02:55:48,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 1885 transitions, 37074 flow [2023-08-04 02:55:56,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 1885 transitions, 35390 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-04 02:55:56,207 INFO L231 Difference]: Finished difference. Result has 215 places, 1742 transitions, 34099 flow [2023-08-04 02:55:56,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=30161, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1592, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=34099, PETRI_PLACES=215, PETRI_TRANSITIONS=1742} [2023-08-04 02:55:56,209 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 174 predicate places. [2023-08-04 02:55:56,209 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 1742 transitions, 34099 flow [2023-08-04 02:55:56,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 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 02:55:56,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:56,210 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] [2023-08-04 02:55:56,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-04 02:55:56,210 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:56,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1477026219, now seen corresponding path program 7 times [2023-08-04 02:55:56,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:56,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927249983] [2023-08-04 02:55:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:56,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:55:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927249983] [2023-08-04 02:55:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927249983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:56,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:56,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861156278] [2023-08-04 02:55:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:56,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:55:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:55:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 02:55:56,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 252 [2023-08-04 02:55:56,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 1742 transitions, 34099 flow. Second operand has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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 02:55:56,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:56,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 252 [2023-08-04 02:55:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:56:09,368 INFO L124 PetriNetUnfolderBase]: 24612/42917 cut-off events. [2023-08-04 02:56:09,368 INFO L125 PetriNetUnfolderBase]: For 682064/687199 co-relation queries the response was YES. [2023-08-04 02:56:10,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297795 conditions, 42917 events. 24612/42917 cut-off events. For 682064/687199 co-relation queries the response was YES. Maximal size of possible extension queue 1549. Compared 382143 event pairs, 4865 based on Foata normal form. 3693/45323 useless extension candidates. Maximal degree in co-relation 282245. Up to 15695 conditions per place. [2023-08-04 02:56:10,142 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 351 selfloop transitions, 1575 changer transitions 35/2009 dead transitions. [2023-08-04 02:56:10,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 2009 transitions, 40860 flow [2023-08-04 02:56:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:56:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:56:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2023-08-04 02:56:10,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914965986394558 [2023-08-04 02:56:10,143 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2023-08-04 02:56:10,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2023-08-04 02:56:10,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:56:10,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2023-08-04 02:56:10,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 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 02:56:10,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:56:10,146 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:56:10,146 INFO L175 Difference]: Start difference. First operand has 215 places, 1742 transitions, 34099 flow. Second operand 7 states and 867 transitions. [2023-08-04 02:56:10,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 2009 transitions, 40860 flow [2023-08-04 02:56:14,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 2009 transitions, 38294 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-04 02:56:14,873 INFO L231 Difference]: Finished difference. Result has 221 places, 1746 transitions, 35326 flow [2023-08-04 02:56:14,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=31561, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=35326, PETRI_PLACES=221, PETRI_TRANSITIONS=1746} [2023-08-04 02:56:14,875 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 180 predicate places. [2023-08-04 02:56:14,875 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 1746 transitions, 35326 flow [2023-08-04 02:56:14,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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 02:56:14,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:14,876 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] [2023-08-04 02:56:14,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-04 02:56:14,876 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:14,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash -610356155, now seen corresponding path program 8 times [2023-08-04 02:56:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71677097] [2023-08-04 02:56:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:56:15,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71677097] [2023-08-04 02:56:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71677097] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:56:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841910053] [2023-08-04 02:56:15,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:56:15,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:15,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:56:15,220 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 02:56:15,223 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 02:56:15,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:56:15,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:56:15,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:56:15,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:56:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:56:15,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:56:15,785 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 02:56:15,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841910053] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 02:56:15,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 02:56:15,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 15 [2023-08-04 02:56:15,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287778100] [2023-08-04 02:56:15,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:56:15,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:56:15,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:15,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:56:15,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-08-04 02:56:15,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 252 [2023-08-04 02:56:15,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 1746 transitions, 35326 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 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 02:56:15,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:15,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 252 [2023-08-04 02:56:15,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:56:28,754 INFO L124 PetriNetUnfolderBase]: 24162/43501 cut-off events. [2023-08-04 02:56:28,755 INFO L125 PetriNetUnfolderBase]: For 754694/768453 co-relation queries the response was YES. [2023-08-04 02:56:29,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299387 conditions, 43501 events. 24162/43501 cut-off events. For 754694/768453 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 403385 event pairs, 6989 based on Foata normal form. 5733/47698 useless extension candidates. Maximal degree in co-relation 282110. Up to 14129 conditions per place. [2023-08-04 02:56:29,738 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 263 selfloop transitions, 1672 changer transitions 30/1998 dead transitions. [2023-08-04 02:56:29,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1998 transitions, 43076 flow [2023-08-04 02:56:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:56:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:56:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-08-04 02:56:29,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812925170068027 [2023-08-04 02:56:29,739 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-08-04 02:56:29,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-08-04 02:56:29,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:56:29,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-08-04 02:56:29,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 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 02:56:29,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:56:29,742 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 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 02:56:29,742 INFO L175 Difference]: Start difference. First operand has 221 places, 1746 transitions, 35326 flow. Second operand 7 states and 849 transitions. [2023-08-04 02:56:29,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1998 transitions, 43076 flow [2023-08-04 02:56:35,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1998 transitions, 40301 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-04 02:56:35,748 INFO L231 Difference]: Finished difference. Result has 228 places, 1841 transitions, 39592 flow [2023-08-04 02:56:35,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=32721, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1577, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=39592, PETRI_PLACES=228, PETRI_TRANSITIONS=1841} [2023-08-04 02:56:35,750 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places. [2023-08-04 02:56:35,750 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 1841 transitions, 39592 flow [2023-08-04 02:56:35,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 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 02:56:35,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:35,750 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] [2023-08-04 02:56:35,754 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 02:56:35,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:35,951 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:35,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 137189889, now seen corresponding path program 3 times [2023-08-04 02:56:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:35,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075976085] [2023-08-04 02:56:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:56:36,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075976085] [2023-08-04 02:56:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075976085] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:56:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067971250] [2023-08-04 02:56:36,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 02:56:36,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:36,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:56:36,184 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 02:56:36,186 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 02:56:36,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 02:56:36,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:56:36,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:56:36,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:56:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:56:36,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:56:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:56:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067971250] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:56:36,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:56:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-08-04 02:56:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592574413] [2023-08-04 02:56:36,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:56:36,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-04 02:56:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-04 02:56:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2023-08-04 02:56:36,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 252 [2023-08-04 02:56:36,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 1841 transitions, 39592 flow. Second operand has 17 states, 17 states have (on average 102.47058823529412) internal successors, (1742), 17 states have internal predecessors, (1742), 0 states have call successors, (0), 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 02:56:36,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:36,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 252 [2023-08-04 02:56:36,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:56:57,362 INFO L124 PetriNetUnfolderBase]: 33288/60154 cut-off events. [2023-08-04 02:56:57,362 INFO L125 PetriNetUnfolderBase]: For 1058743/1062305 co-relation queries the response was YES. [2023-08-04 02:56:58,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443750 conditions, 60154 events. 33288/60154 cut-off events. For 1058743/1062305 co-relation queries the response was YES. Maximal size of possible extension queue 2136. Compared 582240 event pairs, 4155 based on Foata normal form. 2763/61671 useless extension candidates. Maximal degree in co-relation 416639. Up to 13598 conditions per place. [2023-08-04 02:56:58,579 INFO L140 encePairwiseOnDemand]: 242/252 looper letters, 510 selfloop transitions, 2219 changer transitions 70/2829 dead transitions. [2023-08-04 02:56:58,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 2829 transitions, 62439 flow [2023-08-04 02:56:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 02:56:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 02:56:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1289 transitions. [2023-08-04 02:56:58,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465007215007215 [2023-08-04 02:56:58,581 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1289 transitions. [2023-08-04 02:56:58,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1289 transitions. [2023-08-04 02:56:58,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:56:58,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1289 transitions. [2023-08-04 02:56:58,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.18181818181819) internal successors, (1289), 11 states have internal predecessors, (1289), 0 states have call successors, (0), 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 02:56:58,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 252.0) internal successors, (3024), 12 states have internal predecessors, (3024), 0 states have call successors, (0), 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 02:56:58,584 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 252.0) internal successors, (3024), 12 states have internal predecessors, (3024), 0 states have call successors, (0), 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 02:56:58,584 INFO L175 Difference]: Start difference. First operand has 228 places, 1841 transitions, 39592 flow. Second operand 11 states and 1289 transitions. [2023-08-04 02:56:58,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 2829 transitions, 62439 flow [2023-08-04 02:57:11,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 2829 transitions, 59983 flow, removed 73 selfloop flow, removed 2 redundant places. [2023-08-04 02:57:11,782 INFO L231 Difference]: Finished difference. Result has 242 places, 2397 transitions, 55653 flow [2023-08-04 02:57:11,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=37793, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1667, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=55653, PETRI_PLACES=242, PETRI_TRANSITIONS=2397} [2023-08-04 02:57:11,784 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 201 predicate places. [2023-08-04 02:57:11,784 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 2397 transitions, 55653 flow [2023-08-04 02:57:11,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 102.47058823529412) internal successors, (1742), 17 states have internal predecessors, (1742), 0 states have call successors, (0), 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 02:57:11,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:57:11,785 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] [2023-08-04 02:57:11,796 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 02:57:11,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:57:11,985 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:57:11,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:57:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash -10423222, now seen corresponding path program 1 times [2023-08-04 02:57:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:57:11,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864548502] [2023-08-04 02:57:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:57:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:57:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:57:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:57:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:57:12,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864548502] [2023-08-04 02:57:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864548502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:57:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:57:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:57:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619507279] [2023-08-04 02:57:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:57:12,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:57:12,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:57:12,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:57:12,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:57:12,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 252 [2023-08-04 02:57:12,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 2397 transitions, 55653 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 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 02:57:12,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:57:12,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 252 [2023-08-04 02:57:12,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:57:40,504 INFO L124 PetriNetUnfolderBase]: 36118/68605 cut-off events. [2023-08-04 02:57:40,504 INFO L125 PetriNetUnfolderBase]: For 1398173/1404910 co-relation queries the response was YES. [2023-08-04 02:57:41,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490837 conditions, 68605 events. 36118/68605 cut-off events. For 1398173/1404910 co-relation queries the response was YES. Maximal size of possible extension queue 2643. Compared 715503 event pairs, 8422 based on Foata normal form. 7887/74784 useless extension candidates. Maximal degree in co-relation 462930. Up to 28913 conditions per place. [2023-08-04 02:57:42,004 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 1237 selfloop transitions, 1003 changer transitions 63/2339 dead transitions. [2023-08-04 02:57:42,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 2339 transitions, 55563 flow [2023-08-04 02:57:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:57:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:57:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-04 02:57:42,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2023-08-04 02:57:42,005 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-04 02:57:42,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-04 02:57:42,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:57:42,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-04 02:57:42,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 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 02:57:42,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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 02:57:42,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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 02:57:42,007 INFO L175 Difference]: Start difference. First operand has 242 places, 2397 transitions, 55653 flow. Second operand 5 states and 642 transitions. [2023-08-04 02:57:42,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 2339 transitions, 55563 flow [2023-08-04 02:58:01,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 2339 transitions, 52918 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-04 02:58:01,250 INFO L231 Difference]: Finished difference. Result has 246 places, 2132 transitions, 49680 flow [2023-08-04 02:58:01,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=45980, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=997, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=49680, PETRI_PLACES=246, PETRI_TRANSITIONS=2132} [2023-08-04 02:58:01,252 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 205 predicate places. [2023-08-04 02:58:01,252 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 2132 transitions, 49680 flow [2023-08-04 02:58:01,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 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 02:58:01,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:58:01,252 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] [2023-08-04 02:58:01,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-04 02:58:01,252 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:58:01,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:58:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1702202354, now seen corresponding path program 1 times [2023-08-04 02:58:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:58:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722502944] [2023-08-04 02:58:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:58:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:58:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:58:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:58:01,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:58:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722502944] [2023-08-04 02:58:01,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722502944] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:58:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130809461] [2023-08-04 02:58:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:58:01,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:58:01,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:58:01,301 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 02:58:01,340 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 02:58:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:58:01,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:58:01,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:58:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:58:01,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:58:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:58:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130809461] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:58:01,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:58:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 02:58:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093585599] [2023-08-04 02:58:01,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:58:01,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:58:01,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:58:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:58:01,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:58:01,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 252 [2023-08-04 02:58:01,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 2132 transitions, 49680 flow. Second operand has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 0 states have call successors, (0), 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 02:58:01,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:58:01,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 252 [2023-08-04 02:58:01,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:58:26,915 INFO L124 PetriNetUnfolderBase]: 34134/64273 cut-off events. [2023-08-04 02:58:26,915 INFO L125 PetriNetUnfolderBase]: For 1391712/1398168 co-relation queries the response was YES. [2023-08-04 02:58:28,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468745 conditions, 64273 events. 34134/64273 cut-off events. For 1391712/1398168 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 651617 event pairs, 14411 based on Foata normal form. 4856/68274 useless extension candidates. Maximal degree in co-relation 439279. Up to 47171 conditions per place. [2023-08-04 02:58:28,632 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 1247 selfloop transitions, 970 changer transitions 0/2253 dead transitions. [2023-08-04 02:58:28,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 2253 transitions, 55282 flow [2023-08-04 02:58:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:58:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:58:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-04 02:58:28,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031746031746032 [2023-08-04 02:58:28,633 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-04 02:58:28,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-04 02:58:28,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:58:28,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-04 02:58:28,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 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 02:58:28,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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 02:58:28,635 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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 02:58:28,635 INFO L175 Difference]: Start difference. First operand has 246 places, 2132 transitions, 49680 flow. Second operand 5 states and 634 transitions. [2023-08-04 02:58:28,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 2253 transitions, 55282 flow [2023-08-04 02:58:44,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 2253 transitions, 54312 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:58:44,230 INFO L231 Difference]: Finished difference. Result has 250 places, 2133 transitions, 50660 flow [2023-08-04 02:58:44,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=48710, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=969, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50660, PETRI_PLACES=250, PETRI_TRANSITIONS=2133} [2023-08-04 02:58:44,232 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places. [2023-08-04 02:58:44,232 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 2133 transitions, 50660 flow [2023-08-04 02:58:44,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 0 states have call successors, (0), 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 02:58:44,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:58:44,233 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] [2023-08-04 02:58:44,237 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 02:58:44,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:58:44,433 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:58:44,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:58:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash -957488090, now seen corresponding path program 2 times [2023-08-04 02:58:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:58:44,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631258226] [2023-08-04 02:58:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:58:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:58:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:58:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:58:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:58:44,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631258226] [2023-08-04 02:58:44,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631258226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:58:44,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:58:44,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:58:44,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521245967] [2023-08-04 02:58:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:58:44,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:58:44,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:58:44,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:58:44,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:58:44,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 252 [2023-08-04 02:58:44,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 2133 transitions, 50660 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:58:44,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:58:44,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 252 [2023-08-04 02:58:44,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:59:18,285 INFO L124 PetriNetUnfolderBase]: 40481/78874 cut-off events. [2023-08-04 02:59:18,286 INFO L125 PetriNetUnfolderBase]: For 1876523/1884576 co-relation queries the response was YES. [2023-08-04 02:59:20,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566156 conditions, 78874 events. 40481/78874 cut-off events. For 1876523/1884576 co-relation queries the response was YES. Maximal size of possible extension queue 3142. Compared 859955 event pairs, 13523 based on Foata normal form. 10010/87984 useless extension candidates. Maximal degree in co-relation 541792. Up to 31265 conditions per place. [2023-08-04 02:59:20,227 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 1028 selfloop transitions, 1195 changer transitions 99/2358 dead transitions. [2023-08-04 02:59:20,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 2358 transitions, 57127 flow [2023-08-04 02:59:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:59:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:59:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-04 02:59:20,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2023-08-04 02:59:20,228 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-04 02:59:20,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-04 02:59:20,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:59:20,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-04 02:59:20,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 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 02:59:20,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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 02:59:20,230 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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 02:59:20,230 INFO L175 Difference]: Start difference. First operand has 250 places, 2133 transitions, 50660 flow. Second operand 5 states and 637 transitions. [2023-08-04 02:59:20,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 2358 transitions, 57127 flow [2023-08-04 02:59:44,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 2358 transitions, 56003 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-04 02:59:44,765 INFO L231 Difference]: Finished difference. Result has 254 places, 2138 transitions, 53343 flow [2023-08-04 02:59:44,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=42482, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=923, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=53343, PETRI_PLACES=254, PETRI_TRANSITIONS=2138} [2023-08-04 02:59:44,767 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 213 predicate places. [2023-08-04 02:59:44,767 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 2138 transitions, 53343 flow [2023-08-04 02:59:44,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:59:44,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:59:44,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] [2023-08-04 02:59:44,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-04 02:59:44,768 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:59:44,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:59:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1646563986, now seen corresponding path program 2 times [2023-08-04 02:59:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:59:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55333286] [2023-08-04 02:59:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:59:44,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:59:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:59:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:59:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:59:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55333286] [2023-08-04 02:59:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55333286] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:59:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132342435] [2023-08-04 02:59:44,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:59:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:59:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:59:44,823 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 02:59:44,824 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 02:59:44,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:59:44,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:59:44,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:59:44,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:59:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:59:44,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:59:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:59:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132342435] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:59:44,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:59:44,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 02:59:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186542867] [2023-08-04 02:59:44,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:59:44,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 02:59:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:59:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 02:59:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:59:45,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 252 [2023-08-04 02:59:45,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 2138 transitions, 53343 flow. Second operand has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 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 02:59:45,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:59:45,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 252 [2023-08-04 02:59:45,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:59:47,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([806] L51-4-->L51-4: Formula: (and (not (= |v_thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1_14| 0)) (= (+ |v_thread2Thread2of2ForFork1_~i~1#1_47| 1) |v_thread2Thread2of2ForFork1_~i~1#1_46|) (= |v_thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1_14| (ite (< 0 v_~counter~0_181) 1 0)) (= v_~counter~0_181 (+ v_~counter~0_180 1)) (< |v_thread2Thread2of2ForFork1_~i~1#1_47| v_~N2~0_149) (= |v_thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1_14| |v_thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1_14|)) InVars {~counter~0=v_~counter~0_181, thread2Thread2of2ForFork1_~i~1#1=|v_thread2Thread2of2ForFork1_~i~1#1_47|, ~N2~0=v_~N2~0_149} OutVars{~counter~0=v_~counter~0_180, thread2Thread2of2ForFork1_#t~post3#1=|v_thread2Thread2of2ForFork1_#t~post3#1_24|, thread2Thread2of2ForFork1_~i~1#1=|v_thread2Thread2of2ForFork1_~i~1#1_46|, thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1_14|, thread2Thread2of2ForFork1_#t~post4#1=|v_thread2Thread2of2ForFork1_#t~post4#1_14|, ~N2~0=v_~N2~0_149, thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[~counter~0, thread2Thread2of2ForFork1_#t~post3#1, thread2Thread2of2ForFork1_~i~1#1, thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork1_#t~post4#1, thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1][496], [Black: 800#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 3338#true, Black: 267#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 3340#(= thread1Thread1of2ForFork0_~i~0 0), Black: 3341#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 1809#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3344#(and (<= ~N1~0 0) (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 1721#(and (<= 0 ~N2~0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1807#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1811#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1672#(and (<= 0 ~N2~0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 600#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 424#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 9#L71-6true, Black: 1822#(and (= ~counter~0 0) (or (= ~N2~0 ~N1~0) (and (<= 0 ~N2~0) (< ~N2~0 (+ ~N1~0 1))))), Black: 1823#(and (or (and (<= 0 ~N2~0) (= thread1Thread1of2ForFork0_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), Black: 1824#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 1315#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (or (= thread1Thread1of2ForFork0_~i~0 0) (<= ~N1~0 ~N2~0))), Black: 1319#(and (<= ~N1~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= ~N1~0 ~N2~0)), Black: 1321#(and (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= ~N1~0 ~N2~0)), Black: 1317#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1043#(and (<= 0 ~N2~0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 2324#(and (<= 0 ~N2~0) (<= ~N2~0 0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2296#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) |#pthreadsForks|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (<= |#pthreadsForks| (+ thread1Thread2of2ForFork0_thidvar0 1)) (= ~counter~0 0)), Black: 2312#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), 3334#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N1~0)), Black: 2356#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2328#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), 50#L41-4true, Black: 2302#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 1992#(and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= |#pthreadsForks| (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2364#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2308#(and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2304#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2348#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2344#(and (<= 0 ~N2~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2350#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2338#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2340#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 421#true, Black: 2322#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2310#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2370#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2336#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2366#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2354#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2352#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2320#(and (<= 0 ~N2~0) (<= ~N2~0 0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2326#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2318#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2372#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2358#(and (<= 0 ~N2~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2362#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2360#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2346#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2294#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (<= |#pthreadsForks| (+ thread1Thread2of2ForFork0_thidvar0 1)) (= ~counter~0 0)), 37#L51-4true, Black: 2316#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2368#(and (<= 0 ~N2~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 1639#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1641#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1530#(and (<= 0 ~N2~0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 2413#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 1637#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 2411#(and (or (and (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (or (and (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0)) (< ~N2~0 ~N1~0))) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), Black: 2412#(and (= ~counter~0 0) (or (and (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (<= ~N1~0 ~N2~0)) (= ~N2~0 ~N1~0))), Black: 2410#(and (or (and (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (<= 0 ~N1~0)) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), 1033#true, Black: 1652#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (= ~counter~0 0) (<= ~N1~0 ~N2~0)), Black: 1653#(and (= ~counter~0 0) (or (and (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (<= ~N1~0 ~N2~0)) (= ~N2~0 ~N1~0))), Black: 1654#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), thread1Thread1of2ForFork0InUse, Black: 2424#(and (or (= ~N2~0 ~N1~0) (and (<= 0 ~N1~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= ~N1~0 ~N2~0))) (= ~counter~0 0)), Black: 2425#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 2423#(and (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of2ForFork0_~i~0 0)) (<= ~N1~0 ~N2~0)) (or (and (<= 0 ~N1~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)) (< ~N2~0 ~N1~0))) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), thread2Thread1of2ForFork1InUse, 55#L41-4true, Black: 2436#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 2434#(and (or (and (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (or (and (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0)) (< ~N2~0 ~N1~0))) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), Black: 2435#(and (= ~counter~0 0) (or (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= ~N2~0 ~N1~0))), 1995#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 273#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2727#(and (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< 0 ~N2~0)) (or (= ~N1~0 (+ ~counter~0 ~N2~0)) (< |thread2Thread1of2ForFork1_~i~1#1| ~N2~0))), Black: 2725#(and (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< |thread2Thread1of2ForFork1_~i~1#1| ~N2~0)) (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< 0 ~N2~0)) (or (< thread1Thread1of2ForFork0_~i~0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< |thread2Thread1of2ForFork1_~i~1#1| ~N2~0))), Black: 2588#(= ~N1~0 (+ ~counter~0 ~N2~0)), Black: 2723#(and (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< |thread2Thread1of2ForFork1_~i~1#1| ~N2~0)) (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< 0 ~N2~0))), Black: 1979#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1900#(and (<= 0 ~N2~0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1981#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1896#(and (<= 0 ~N2~0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), 2#L51-4true, Black: 1341#(and (<= 0 ~N2~0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1476#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1478#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1387#(and (<= 0 ~N2~0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1480#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 203#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 3027#(and (<= ~N2~0 0) (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (<= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3025#(and (<= ~N2~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= ~N1~0 ~N2~0)), Black: 3023#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3021#(and (<= ~N2~0 0) (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3029#(and (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= ~N1~0 ~N2~0)), Black: 3019#(and (<= 0 ~N2~0) (<= ~N2~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3039#(= thread1Thread1of2ForFork0_~i~0 0), Black: 3046#(and (<= ~N1~0 0) (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 3043#(and (<= ~N1~0 0) (= thread1Thread1of2ForFork0_~i~0 0)), 3633#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~N1~0))]) [2023-08-04 02:59:47,018 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-04 02:59:47,018 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 02:59:47,018 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 02:59:47,018 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 02:59:48,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([806] L51-4-->L51-4: Formula: (and (not (= |v_thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1_14| 0)) (= (+ |v_thread2Thread2of2ForFork1_~i~1#1_47| 1) |v_thread2Thread2of2ForFork1_~i~1#1_46|) (= |v_thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1_14| (ite (< 0 v_~counter~0_181) 1 0)) (= v_~counter~0_181 (+ v_~counter~0_180 1)) (< |v_thread2Thread2of2ForFork1_~i~1#1_47| v_~N2~0_149) (= |v_thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1_14| |v_thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1_14|)) InVars {~counter~0=v_~counter~0_181, thread2Thread2of2ForFork1_~i~1#1=|v_thread2Thread2of2ForFork1_~i~1#1_47|, ~N2~0=v_~N2~0_149} OutVars{~counter~0=v_~counter~0_180, thread2Thread2of2ForFork1_#t~post3#1=|v_thread2Thread2of2ForFork1_#t~post3#1_24|, thread2Thread2of2ForFork1_~i~1#1=|v_thread2Thread2of2ForFork1_~i~1#1_46|, thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1_14|, thread2Thread2of2ForFork1_#t~post4#1=|v_thread2Thread2of2ForFork1_#t~post4#1_14|, ~N2~0=v_~N2~0_149, thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[~counter~0, thread2Thread2of2ForFork1_#t~post3#1, thread2Thread2of2ForFork1_~i~1#1, thread2Thread2of2ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork1_#t~post4#1, thread2Thread2of2ForFork1_assume_abort_if_not_~cond#1][496], [32#thread1EXITtrue, Black: 800#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 3338#true, Black: 267#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 3340#(= thread1Thread1of2ForFork0_~i~0 0), Black: 3341#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 1809#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3344#(and (<= ~N1~0 0) (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 1721#(and (<= 0 ~N2~0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1807#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1811#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1672#(and (<= 0 ~N2~0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 600#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 424#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 9#L71-6true, Black: 1822#(and (= ~counter~0 0) (or (= ~N2~0 ~N1~0) (and (<= 0 ~N2~0) (< ~N2~0 (+ ~N1~0 1))))), Black: 1823#(and (or (and (<= 0 ~N2~0) (= thread1Thread1of2ForFork0_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), Black: 1824#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 1315#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (or (= thread1Thread1of2ForFork0_~i~0 0) (<= ~N1~0 ~N2~0))), Black: 1319#(and (<= ~N1~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= ~N1~0 ~N2~0)), Black: 1321#(and (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= ~N1~0 ~N2~0)), Black: 1317#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1043#(and (<= 0 ~N2~0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 2324#(and (<= 0 ~N2~0) (<= ~N2~0 0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2296#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) |#pthreadsForks|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (<= |#pthreadsForks| (+ thread1Thread2of2ForFork0_thidvar0 1)) (= ~counter~0 0)), Black: 2312#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), 3334#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N1~0)), Black: 2356#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2328#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2302#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 1992#(and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= |#pthreadsForks| (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2364#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2308#(and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2304#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2348#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2344#(and (<= 0 ~N2~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2350#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2338#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2340#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 421#true, Black: 2322#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2310#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2370#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2336#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2366#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2354#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2352#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2320#(and (<= 0 ~N2~0) (<= ~N2~0 0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2326#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) |ULTIMATE.start_main_#t~pre11#1|) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2318#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2372#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2358#(and (<= 0 ~N2~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2362#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2360#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2346#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2294#(and (<= 0 ~N2~0) (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) |#pthreadsForks|) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (<= |#pthreadsForks| (+ thread1Thread2of2ForFork0_thidvar0 1)) (= ~counter~0 0)), 37#L51-4true, Black: 2316#(and (<= 0 ~N2~0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 ~N1~0) (= ~counter~0 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 2368#(and (<= 0 ~N2~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) 2147483647) (or (not (= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0 4294967296))) (<= |ULTIMATE.start_main_#t~mem16#1| (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) 2147483647))) (<= 0 ~N1~0) (= ~counter~0 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (not (= (+ (* (div |ULTIMATE.start_main_#t~mem16#1| 4294967296) 4294967296) thread1Thread2of2ForFork0_thidvar0) |ULTIMATE.start_main_#t~mem16#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 1639#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1641#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1530#(and (<= 0 ~N2~0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 2413#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 1637#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 2411#(and (or (and (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (or (and (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0)) (< ~N2~0 ~N1~0))) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), Black: 2412#(and (= ~counter~0 0) (or (and (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (<= ~N1~0 ~N2~0)) (= ~N2~0 ~N1~0))), Black: 2410#(and (or (and (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (<= 0 ~N1~0)) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), 1033#true, Black: 1652#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (= ~counter~0 0) (<= ~N1~0 ~N2~0)), Black: 1653#(and (= ~counter~0 0) (or (and (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (<= ~N1~0 ~N2~0)) (= ~N2~0 ~N1~0))), Black: 1654#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), thread1Thread1of2ForFork0InUse, Black: 2424#(and (or (= ~N2~0 ~N1~0) (and (<= 0 ~N1~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (<= ~N1~0 ~N2~0))) (= ~counter~0 0)), Black: 2425#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 2423#(and (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of2ForFork0_~i~0 0)) (<= ~N1~0 ~N2~0)) (or (and (<= 0 ~N1~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)) (< ~N2~0 ~N1~0))) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), thread2Thread1of2ForFork1InUse, 55#L41-4true, Black: 2436#(and (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 2434#(and (or (and (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (or (and (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0)) (< ~N2~0 ~N1~0))) (= ~N2~0 ~N1~0)) (= ~counter~0 0)), Black: 2435#(and (= ~counter~0 0) (or (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= ~N2~0 ~N1~0))), 1995#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= (+ thread1Thread2of2ForFork0_thidvar0 1) thread2Thread1of2ForFork1_thidvar0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread2of2ForFork0_thidvar0 1))), Black: 273#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2727#(and (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< 0 ~N2~0)) (or (= ~N1~0 (+ ~counter~0 ~N2~0)) (< |thread2Thread1of2ForFork1_~i~1#1| ~N2~0))), Black: 2725#(and (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< |thread2Thread1of2ForFork1_~i~1#1| ~N2~0)) (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< 0 ~N2~0)) (or (< thread1Thread1of2ForFork0_~i~0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< |thread2Thread1of2ForFork1_~i~1#1| ~N2~0))), Black: 2588#(= ~N1~0 (+ ~counter~0 ~N2~0)), Black: 2723#(and (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< |thread2Thread1of2ForFork1_~i~1#1| ~N2~0)) (or (< 0 ~N1~0) (= ~N1~0 (+ ~counter~0 ~N2~0)) (< 0 ~N2~0))), Black: 1979#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1900#(and (<= 0 ~N2~0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1981#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1896#(and (<= 0 ~N2~0) (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), 2#L51-4true, Black: 1341#(and (<= 0 ~N2~0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 1476#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1478#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1387#(and (<= 0 ~N2~0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1480#(and (<= 0 ~N2~0) (<= ~N1~0 0) (<= ~N2~0 0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 203#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 3027#(and (<= ~N2~0 0) (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (<= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3025#(and (<= ~N2~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= ~N1~0 ~N2~0)), Black: 3023#(and (<= 0 ~N2~0) (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3021#(and (<= ~N2~0 0) (or (<= ~N1~0 ~N2~0) (and (<= 0 ~N2~0) (= thread1Thread2of2ForFork0_~i~0 0))) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3029#(and (<= ~N2~0 0) (<= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0) (<= ~N1~0 ~N2~0)), Black: 3019#(and (<= 0 ~N2~0) (<= ~N2~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 ~N1~0) (= ~counter~0 0)), Black: 3039#(= thread1Thread1of2ForFork0_~i~0 0), Black: 3046#(and (<= ~N1~0 0) (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 3043#(and (<= ~N1~0 0) (= thread1Thread1of2ForFork0_~i~0 0)), 3633#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~N1~0))]) [2023-08-04 02:59:48,068 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-04 02:59:48,068 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 02:59:48,068 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 02:59:48,068 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 03:00:16,557 INFO L124 PetriNetUnfolderBase]: 39346/76268 cut-off events. [2023-08-04 03:00:16,557 INFO L125 PetriNetUnfolderBase]: For 1746158/1753347 co-relation queries the response was YES. [2023-08-04 03:00:18,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565177 conditions, 76268 events. 39346/76268 cut-off events. For 1746158/1753347 co-relation queries the response was YES. Maximal size of possible extension queue 2974. Compared 821285 event pairs, 14075 based on Foata normal form. 5520/80749 useless extension candidates. Maximal degree in co-relation 542729. Up to 31257 conditions per place. [2023-08-04 03:00:18,519 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 1144 selfloop transitions, 1182 changer transitions 40/2402 dead transitions. [2023-08-04 03:00:18,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 2402 transitions, 60800 flow [2023-08-04 03:00:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 03:00:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 03:00:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2023-08-04 03:00:18,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054563492063492 [2023-08-04 03:00:18,520 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2023-08-04 03:00:18,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2023-08-04 03:00:18,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:00:18,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2023-08-04 03:00:18,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 0 states have call successors, (0), 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 03:00:18,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 252.0) internal successors, (2268), 9 states have internal predecessors, (2268), 0 states have call successors, (0), 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 03:00:18,523 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 252.0) internal successors, (2268), 9 states have internal predecessors, (2268), 0 states have call successors, (0), 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 03:00:18,523 INFO L175 Difference]: Start difference. First operand has 254 places, 2138 transitions, 53343 flow. Second operand 8 states and 1019 transitions. [2023-08-04 03:00:18,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 2402 transitions, 60800 flow [2023-08-04 03:00:43,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 2402 transitions, 59839 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 03:00:43,668 INFO L231 Difference]: Finished difference. Result has 262 places, 2141 transitions, 54978 flow [2023-08-04 03:00:43,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=52382, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=54978, PETRI_PLACES=262, PETRI_TRANSITIONS=2141} [2023-08-04 03:00:43,670 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 221 predicate places. [2023-08-04 03:00:43,671 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 2141 transitions, 54978 flow [2023-08-04 03:00:43,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 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 03:00:43,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:00:43,671 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] [2023-08-04 03:00:43,677 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 03:00:43,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:00:43,874 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:00:43,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:00:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash -598617006, now seen corresponding path program 1 times [2023-08-04 03:00:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:00:43,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660814852] [2023-08-04 03:00:43,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:00:43,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:00:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:00:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:00:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:00:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660814852] [2023-08-04 03:00:43,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660814852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:00:43,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:00:43,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 03:00:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697791585] [2023-08-04 03:00:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:00:43,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:00:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:00:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:00:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:00:43,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 252 [2023-08-04 03:00:43,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 2141 transitions, 54978 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:00:43,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:00:43,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 252 [2023-08-04 03:00:43,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:01:17,393 INFO L124 PetriNetUnfolderBase]: 39980/77138 cut-off events. [2023-08-04 03:01:17,394 INFO L125 PetriNetUnfolderBase]: For 1821907/1829233 co-relation queries the response was YES. [2023-08-04 03:01:19,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574469 conditions, 77138 events. 39980/77138 cut-off events. For 1821907/1829233 co-relation queries the response was YES. Maximal size of possible extension queue 3008. Compared 826405 event pairs, 14751 based on Foata normal form. 5636/82231 useless extension candidates. Maximal degree in co-relation 563254. Up to 30771 conditions per place. [2023-08-04 03:01:19,543 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 1059 selfloop transitions, 1178 changer transitions 40/2313 dead transitions. [2023-08-04 03:01:19,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 2313 transitions, 61588 flow [2023-08-04 03:01:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:01:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:01:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-04 03:01:19,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063492063492063 [2023-08-04 03:01:19,545 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-04 03:01:19,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-04 03:01:19,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:01:19,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-04 03:01:19,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 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 03:01:19,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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 03:01:19,547 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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 03:01:19,547 INFO L175 Difference]: Start difference. First operand has 262 places, 2141 transitions, 54978 flow. Second operand 5 states and 638 transitions. [2023-08-04 03:01:19,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 2313 transitions, 61588 flow [2023-08-04 03:01:45,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 2313 transitions, 59220 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-04 03:01:45,800 INFO L231 Difference]: Finished difference. Result has 262 places, 2142 transitions, 55185 flow [2023-08-04 03:01:45,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=52612, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=964, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=55185, PETRI_PLACES=262, PETRI_TRANSITIONS=2142} [2023-08-04 03:01:45,802 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 221 predicate places. [2023-08-04 03:01:45,802 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 2142 transitions, 55185 flow [2023-08-04 03:01:45,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:01:45,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:01:45,803 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] [2023-08-04 03:01:45,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-04 03:01:45,803 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:01:45,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:01:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash -694979408, now seen corresponding path program 2 times [2023-08-04 03:01:45,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:01:45,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958046854] [2023-08-04 03:01:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:01:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:01:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:01:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 03:01:45,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:01:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958046854] [2023-08-04 03:01:45,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958046854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:01:45,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:01:45,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 03:01:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150720172] [2023-08-04 03:01:45,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:01:45,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:01:45,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:01:45,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:01:45,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:01:45,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 252 [2023-08-04 03:01:45,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 2142 transitions, 55185 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 03:01:45,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:01:45,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 252 [2023-08-04 03:01:45,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand