/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_chl-poker-hand-symm.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 02:09:55,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 02:09:55,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 02:09:55,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 02:09:55,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 02:09:55,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 02:09:55,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 02:09:55,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 02:09:55,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 02:09:55,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 02:09:55,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 02:09:55,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 02:09:55,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 02:09:55,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 02:09:55,697 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 02:09:55,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 02:09:55,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 02:09:55,697 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 02:09:55,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 02:09:55,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 02:09:55,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 02:09:55,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 02:09:55,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 02:09:55,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 02:09:55,699 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 02:09:55,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 02:09:55,699 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 02:09:55,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 02:09:55,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 02:09:55,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 02:09:55,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:09:55,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 02:09:55,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 02:09:55,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 02:09:55,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 02:09:55,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 02:09:55,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 02:09:55,702 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 02:09:55,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 02:09:55,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 02:09:55,702 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 02:09:55,702 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:09:55,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 02:09:55,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 02:09:55,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 02:09:55,903 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 02:09:55,904 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 02:09:55,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_chl-poker-hand-symm.wvr_bound2.c [2023-08-04 02:09:57,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 02:09:57,218 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 02:09:57,218 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_chl-poker-hand-symm.wvr_bound2.c [2023-08-04 02:09:57,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7ba623f/189ccd4931814e5ab29664cceaffbf95/FLAGd81e0ac21 [2023-08-04 02:09:57,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7ba623f/189ccd4931814e5ab29664cceaffbf95 [2023-08-04 02:09:57,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 02:09:57,242 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 02:09:57,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 02:09:57,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 02:09:57,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 02:09:57,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38bd99d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57, skipping insertion in model container [2023-08-04 02:09:57,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,278 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 02:09:57,489 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_chl-poker-hand-symm.wvr_bound2.c[12983,12996] [2023-08-04 02:09:57,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:09:57,498 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 02:09:57,546 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_chl-poker-hand-symm.wvr_bound2.c[12983,12996] [2023-08-04 02:09:57,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:09:57,556 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:09:57,556 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:09:57,560 INFO L206 MainTranslator]: Completed translation [2023-08-04 02:09:57,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57 WrapperNode [2023-08-04 02:09:57,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 02:09:57,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 02:09:57,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 02:09:57,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 02:09:57,565 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:09:57" (1/1) ... [2023-08-04 02:09:57,580 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:09:57" (1/1) ... [2023-08-04 02:09:57,627 INFO L138 Inliner]: procedures = 25, calls = 307, calls flagged for inlining = 69, calls inlined = 97, statements flattened = 1578 [2023-08-04 02:09:57,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 02:09:57,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 02:09:57,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 02:09:57,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 02:09:57,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 02:09:57,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 02:09:57,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 02:09:57,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 02:09:57,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (1/1) ... [2023-08-04 02:09:57,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:09:57,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:09:57,718 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:09:57,720 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:09:57,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 02:09:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 02:09:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 02:09:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 02:09:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 02:09:57,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 02:09:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 02:09:57,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 02:09:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 02:09:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 02:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 02:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 02:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 02:09:57,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 02:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 02:09:57,749 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:09:57,911 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 02:09:57,913 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 02:09:59,042 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 02:10:00,096 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 02:10:00,097 INFO L302 CfgBuilder]: Removed 16 assume(true) statements. [2023-08-04 02:10:00,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:10:00 BoogieIcfgContainer [2023-08-04 02:10:00,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 02:10:00,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 02:10:00,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 02:10:00,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 02:10:00,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 02:09:57" (1/3) ... [2023-08-04 02:10:00,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0ab630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:10:00, skipping insertion in model container [2023-08-04 02:10:00,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:09:57" (2/3) ... [2023-08-04 02:10:00,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0ab630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:10:00, skipping insertion in model container [2023-08-04 02:10:00,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:10:00" (3/3) ... [2023-08-04 02:10:00,107 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_chl-poker-hand-symm.wvr_bound2.c [2023-08-04 02:10:00,113 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 02:10:00,119 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 02:10:00,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 02:10:00,119 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 02:10:00,323 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 02:10:00,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 485 transitions, 992 flow [2023-08-04 02:10:00,524 INFO L124 PetriNetUnfolderBase]: 88/670 cut-off events. [2023-08-04 02:10:00,524 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:10:00,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 670 events. 88/670 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1948 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 465. Up to 14 conditions per place. [2023-08-04 02:10:00,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 485 transitions, 992 flow [2023-08-04 02:10:00,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 429 places, 485 transitions, 992 flow [2023-08-04 02:10:00,544 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:10:00,550 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 429 places, 485 transitions, 992 flow [2023-08-04 02:10:00,552 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 429 places, 485 transitions, 992 flow [2023-08-04 02:10:00,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 485 transitions, 992 flow [2023-08-04 02:10:00,647 INFO L124 PetriNetUnfolderBase]: 88/670 cut-off events. [2023-08-04 02:10:00,648 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:10:00,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 670 events. 88/670 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1948 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 465. Up to 14 conditions per place. [2023-08-04 02:10:00,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 18150 [2023-08-04 02:10:50,808 INFO L134 LiptonReduction]: Checked pairs total: 20000 [2023-08-04 02:10:50,809 INFO L136 LiptonReduction]: Total number of compositions: 567 [2023-08-04 02:10:50,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:10:50,841 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;@3fa1cd2d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:10:50,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:10:50,877 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:10:50,877 INFO L124 PetriNetUnfolderBase]: 16/50 cut-off events. [2023-08-04 02:10:50,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:10:50,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:10:50,878 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:10:50,879 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:10:50,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:10:50,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2001124636, now seen corresponding path program 1 times [2023-08-04 02:10:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:10:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839052995] [2023-08-04 02:10:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:10:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:10:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:10:51,298 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:10:51,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:10:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839052995] [2023-08-04 02:10:51,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839052995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:10:51,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:10:51,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:10:51,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734800566] [2023-08-04 02:10:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:10:51,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:10:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:10:51,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:10:51,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:10:51,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 1052 [2023-08-04 02:10:51,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 54 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:10:51,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:10:51,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 1052 [2023-08-04 02:10:51,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:10:52,419 INFO L124 PetriNetUnfolderBase]: 612/878 cut-off events. [2023-08-04 02:10:52,419 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 02:10:52,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 878 events. 612/878 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2745 event pairs, 240 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 1432. Up to 848 conditions per place. [2023-08-04 02:10:52,422 INFO L140 encePairwiseOnDemand]: 1042/1052 looper letters, 34 selfloop transitions, 8 changer transitions 13/57 dead transitions. [2023-08-04 02:10:52,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 242 flow [2023-08-04 02:10:52,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:10:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:10:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2023-08-04 02:10:52,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39005069708491763 [2023-08-04 02:10:52,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1231 transitions. [2023-08-04 02:10:52,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1231 transitions. [2023-08-04 02:10:52,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:10:52,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1231 transitions. [2023-08-04 02:10:52,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have 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:10:52,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1052.0) internal successors, (4208), 4 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have 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:10:52,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1052.0) internal successors, (4208), 4 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have 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:10:52,453 INFO L175 Difference]: Start difference. First operand has 39 places, 54 transitions, 130 flow. Second operand 3 states and 1231 transitions. [2023-08-04 02:10:52,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 242 flow [2023-08-04 02:10:52,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:10:52,457 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 132 flow [2023-08-04 02:10:52,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1052, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2023-08-04 02:10:52,460 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-04 02:10:52,460 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 132 flow [2023-08-04 02:10:52,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:10:52,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:10:52,461 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:10:52,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 02:10:52,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:10:52,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:10:52,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1929897217, now seen corresponding path program 1 times [2023-08-04 02:10:52,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:10:52,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587237135] [2023-08-04 02:10:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:10:52,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:10:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:10:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:10:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:10:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587237135] [2023-08-04 02:10:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587237135] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:10:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410545469] [2023-08-04 02:10:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:10:52,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:10:52,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:10:52,571 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:10:52,573 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:10:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:10:53,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:10:53,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:10:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:10:53,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:10:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410545469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:10:53,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:10:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 02:10:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066812336] [2023-08-04 02:10:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:10:53,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:10:53,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:10:53,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:10:53,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:10:53,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 1052 [2023-08-04 02:10:53,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 396.3333333333333) internal successors, (1189), 3 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have 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:10:53,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:10:53,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 1052 [2023-08-04 02:10:53,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:10:53,613 INFO L124 PetriNetUnfolderBase]: 214/323 cut-off events. [2023-08-04 02:10:53,614 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 02:10:53,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 323 events. 214/323 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 833 event pairs, 78 based on Foata normal form. 1/187 useless extension candidates. Maximal degree in co-relation 626. Up to 311 conditions per place. [2023-08-04 02:10:53,615 INFO L140 encePairwiseOnDemand]: 1042/1052 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2023-08-04 02:10:53,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 232 flow [2023-08-04 02:10:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:10:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:10:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1219 transitions. [2023-08-04 02:10:53,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3862484157160963 [2023-08-04 02:10:53,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1219 transitions. [2023-08-04 02:10:53,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1219 transitions. [2023-08-04 02:10:53,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:10:53,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1219 transitions. [2023-08-04 02:10:53,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have 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:10:53,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1052.0) internal successors, (4208), 4 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have 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:10:53,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1052.0) internal successors, (4208), 4 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have 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:10:53,627 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 132 flow. Second operand 3 states and 1219 transitions. [2023-08-04 02:10:53,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 232 flow [2023-08-04 02:10:53,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:10:53,628 INFO L231 Difference]: Finished difference. Result has 34 places, 48 transitions, 168 flow [2023-08-04 02:10:53,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1052, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=34, PETRI_TRANSITIONS=48} [2023-08-04 02:10:53,629 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2023-08-04 02:10:53,629 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 48 transitions, 168 flow [2023-08-04 02:10:53,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.3333333333333) internal successors, (1189), 3 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have 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:10:53,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:10:53,630 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:10:53,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 02:10:53,838 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:10:53,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:10:53,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:10:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1977491563, now seen corresponding path program 1 times [2023-08-04 02:10:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:10:53,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507856072] [2023-08-04 02:10:53,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:10:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:10:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:10:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:10:53,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:10:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507856072] [2023-08-04 02:10:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507856072] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:10:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392512050] [2023-08-04 02:10:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:10:53,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:10:53,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:10:53,989 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:10:53,995 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:10:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:10:54,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-04 02:10:54,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:10:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:10:54,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:10:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:10:54,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392512050] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:10:54,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:10:54,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-08-04 02:10:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083803409] [2023-08-04 02:10:54,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:10:54,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:10:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:10:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:10:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:10:54,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 1052 [2023-08-04 02:10:54,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 48 transitions, 168 flow. Second operand has 8 states, 8 states have (on average 379.0) internal successors, (3032), 8 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have 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:10:54,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:10:54,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 1052 [2023-08-04 02:10:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:10:55,243 INFO L124 PetriNetUnfolderBase]: 214/347 cut-off events. [2023-08-04 02:10:55,243 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 02:10:55,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 347 events. 214/347 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 833 event pairs, 78 based on Foata normal form. 12/222 useless extension candidates. Maximal degree in co-relation 646. Up to 307 conditions per place. [2023-08-04 02:10:55,244 INFO L140 encePairwiseOnDemand]: 1035/1052 looper letters, 30 selfloop transitions, 40 changer transitions 0/72 dead transitions. [2023-08-04 02:10:55,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 72 transitions, 404 flow [2023-08-04 02:10:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 02:10:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 02:10:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3094 transitions. [2023-08-04 02:10:55,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3676330798479088 [2023-08-04 02:10:55,251 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3094 transitions. [2023-08-04 02:10:55,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3094 transitions. [2023-08-04 02:10:55,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:10:55,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3094 transitions. [2023-08-04 02:10:55,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 386.75) internal successors, (3094), 8 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have 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:10:55,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1052.0) internal successors, (9468), 9 states have internal predecessors, (9468), 0 states have call successors, (0), 0 states have 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:10:55,269 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1052.0) internal successors, (9468), 9 states have internal predecessors, (9468), 0 states have call successors, (0), 0 states have 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:10:55,269 INFO L175 Difference]: Start difference. First operand has 34 places, 48 transitions, 168 flow. Second operand 8 states and 3094 transitions. [2023-08-04 02:10:55,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 72 transitions, 404 flow [2023-08-04 02:10:55,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 72 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:10:55,271 INFO L231 Difference]: Finished difference. Result has 43 places, 72 transitions, 398 flow [2023-08-04 02:10:55,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1052, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=398, PETRI_PLACES=43, PETRI_TRANSITIONS=72} [2023-08-04 02:10:55,271 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-04 02:10:55,272 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 72 transitions, 398 flow [2023-08-04 02:10:55,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 379.0) internal successors, (3032), 8 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have 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:10:55,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:10:55,273 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:10:55,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 02:10:55,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 02:10:55,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:10:55,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:10:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1436726620, now seen corresponding path program 2 times [2023-08-04 02:10:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:10:55,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300186554] [2023-08-04 02:10:55,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:10:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:10:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:10:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-08-04 02:10:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:10:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300186554] [2023-08-04 02:10:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300186554] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:10:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498565645] [2023-08-04 02:10:55,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:10:55,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:10:55,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:10:55,659 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:10:55,661 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:10:56,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:10:56,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:10:56,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 02:10:56,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:10:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-08-04 02:10:56,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:10:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-08-04 02:10:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498565645] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:10:56,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:10:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-04 02:10:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665494434] [2023-08-04 02:10:56,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:10:56,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 02:10:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:10:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 02:10:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2023-08-04 02:10:56,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 1052 [2023-08-04 02:10:56,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 72 transitions, 398 flow. Second operand has 12 states, 12 states have (on average 377.4166666666667) internal successors, (4529), 12 states have internal predecessors, (4529), 0 states have call successors, (0), 0 states have 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:10:56,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:10:56,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 1052 [2023-08-04 02:10:56,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:10:57,081 INFO L124 PetriNetUnfolderBase]: 214/351 cut-off events. [2023-08-04 02:10:57,082 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 02:10:57,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 351 events. 214/351 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 833 event pairs, 78 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 672. Up to 307 conditions per place. [2023-08-04 02:10:57,084 INFO L140 encePairwiseOnDemand]: 1035/1052 looper letters, 30 selfloop transitions, 44 changer transitions 0/76 dead transitions. [2023-08-04 02:10:57,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 570 flow [2023-08-04 02:10:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 02:10:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 02:10:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4203 transitions. [2023-08-04 02:10:57,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3632042862080885 [2023-08-04 02:10:57,095 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4203 transitions. [2023-08-04 02:10:57,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4203 transitions. [2023-08-04 02:10:57,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:10:57,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4203 transitions. [2023-08-04 02:10:57,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 382.09090909090907) internal successors, (4203), 11 states have internal predecessors, (4203), 0 states have call successors, (0), 0 states have 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:10:57,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1052.0) internal successors, (12624), 12 states have internal predecessors, (12624), 0 states have call successors, (0), 0 states have 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:10:57,119 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1052.0) internal successors, (12624), 12 states have internal predecessors, (12624), 0 states have call successors, (0), 0 states have 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:10:57,119 INFO L175 Difference]: Start difference. First operand has 43 places, 72 transitions, 398 flow. Second operand 11 states and 4203 transitions. [2023-08-04 02:10:57,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 570 flow [2023-08-04 02:10:57,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 488 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-08-04 02:10:57,126 INFO L231 Difference]: Finished difference. Result has 51 places, 76 transitions, 446 flow [2023-08-04 02:10:57,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1052, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=446, PETRI_PLACES=51, PETRI_TRANSITIONS=76} [2023-08-04 02:10:57,128 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-04 02:10:57,128 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 76 transitions, 446 flow [2023-08-04 02:10:57,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 377.4166666666667) internal successors, (4529), 12 states have internal predecessors, (4529), 0 states have call successors, (0), 0 states have 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:10:57,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:10:57,130 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:10:57,156 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:10:57,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:10:57,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:10:57,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:10:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1923508786, now seen corresponding path program 3 times [2023-08-04 02:10:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:10:57,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991197119] [2023-08-04 02:10:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:10:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:10:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:10:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-08-04 02:10:57,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:10:57,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991197119] [2023-08-04 02:10:57,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991197119] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:10:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880234354] [2023-08-04 02:10:57,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 02:10:57,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:10:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:10:57,631 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:10:57,633 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:10:59,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-04 02:10:59,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:10:59,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 02:10:59,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:10:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-08-04 02:10:59,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:10:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-08-04 02:10:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880234354] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:10:59,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:10:59,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-08-04 02:10:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132916167] [2023-08-04 02:10:59,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:10:59,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 02:10:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:10:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 02:10:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=200, Unknown=0, NotChecked=0, Total=380 [2023-08-04 02:11:00,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 1052 [2023-08-04 02:11:00,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 76 transitions, 446 flow. Second operand has 20 states, 20 states have (on average 376.9) internal successors, (7538), 20 states have internal predecessors, (7538), 0 states have call successors, (0), 0 states have 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:11:00,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:11:00,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 1052 [2023-08-04 02:11:00,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:11:00,908 INFO L124 PetriNetUnfolderBase]: 214/365 cut-off events. [2023-08-04 02:11:00,909 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-04 02:11:00,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 365 events. 214/365 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 833 event pairs, 78 based on Foata normal form. 14/246 useless extension candidates. Maximal degree in co-relation 655. Up to 307 conditions per place. [2023-08-04 02:11:00,911 INFO L140 encePairwiseOnDemand]: 1035/1052 looper letters, 30 selfloop transitions, 58 changer transitions 0/90 dead transitions. [2023-08-04 02:11:00,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 734 flow [2023-08-04 02:11:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 02:11:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 02:11:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 5352 transitions. [2023-08-04 02:11:00,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36338946224877783 [2023-08-04 02:11:00,920 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 5352 transitions. [2023-08-04 02:11:00,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 5352 transitions. [2023-08-04 02:11:00,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:11:00,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 5352 transitions. [2023-08-04 02:11:00,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 382.2857142857143) internal successors, (5352), 14 states have internal predecessors, (5352), 0 states have call successors, (0), 0 states have 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:11:00,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 1052.0) internal successors, (15780), 15 states have internal predecessors, (15780), 0 states have call successors, (0), 0 states have 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:11:00,946 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 1052.0) internal successors, (15780), 15 states have internal predecessors, (15780), 0 states have call successors, (0), 0 states have 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:11:00,946 INFO L175 Difference]: Start difference. First operand has 51 places, 76 transitions, 446 flow. Second operand 14 states and 5352 transitions. [2023-08-04 02:11:00,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 734 flow [2023-08-04 02:11:00,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 654 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-04 02:11:00,950 INFO L231 Difference]: Finished difference. Result has 65 places, 90 transitions, 692 flow [2023-08-04 02:11:00,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1052, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=692, PETRI_PLACES=65, PETRI_TRANSITIONS=90} [2023-08-04 02:11:00,952 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2023-08-04 02:11:00,952 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 90 transitions, 692 flow [2023-08-04 02:11:00,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 376.9) internal successors, (7538), 20 states have internal predecessors, (7538), 0 states have call successors, (0), 0 states have 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:11:00,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:11:00,954 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:11:00,963 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:11:01,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:11:01,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:11:01,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:11:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash -533283021, now seen corresponding path program 4 times [2023-08-04 02:11:01,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:11:01,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665774789] [2023-08-04 02:11:01,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:11:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:11:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:11:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-08-04 02:11:01,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:11:01,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665774789] [2023-08-04 02:11:01,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665774789] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:11:01,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364324084] [2023-08-04 02:11:01,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 02:11:01,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:11:01,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:11:01,579 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:11:01,582 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:11:02,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 02:11:02,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:11:02,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:11:02,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:11:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-08-04 02:11:02,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:11:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-08-04 02:11:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364324084] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:11:02,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:11:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2023-08-04 02:11:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809927983] [2023-08-04 02:11:02,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:11:02,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 02:11:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:11:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 02:11:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2023-08-04 02:11:03,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 1052 [2023-08-04 02:11:03,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 90 transitions, 692 flow. Second operand has 29 states, 29 states have (on average 376.62068965517244) internal successors, (10922), 29 states have internal predecessors, (10922), 0 states have call successors, (0), 0 states have 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:11:03,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:11:03,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 1052 [2023-08-04 02:11:03,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:11:03,697 INFO L124 PetriNetUnfolderBase]: 214/367 cut-off events. [2023-08-04 02:11:03,697 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-08-04 02:11:03,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 367 events. 214/367 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 833 event pairs, 78 based on Foata normal form. 2/236 useless extension candidates. Maximal degree in co-relation 683. Up to 307 conditions per place. [2023-08-04 02:11:03,698 INFO L140 encePairwiseOnDemand]: 1035/1052 looper letters, 30 selfloop transitions, 60 changer transitions 0/92 dead transitions. [2023-08-04 02:11:03,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 92 transitions, 892 flow [2023-08-04 02:11:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-04 02:11:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-04 02:11:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 7592 transitions. [2023-08-04 02:11:03,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3608365019011407 [2023-08-04 02:11:03,712 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 7592 transitions. [2023-08-04 02:11:03,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 7592 transitions. [2023-08-04 02:11:03,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:11:03,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 7592 transitions. [2023-08-04 02:11:03,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 379.6) internal successors, (7592), 20 states have internal predecessors, (7592), 0 states have call successors, (0), 0 states have 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:11:03,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 1052.0) internal successors, (22092), 21 states have internal predecessors, (22092), 0 states have call successors, (0), 0 states have 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:11:03,739 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 1052.0) internal successors, (22092), 21 states have internal predecessors, (22092), 0 states have call successors, (0), 0 states have 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:11:03,739 INFO L175 Difference]: Start difference. First operand has 65 places, 90 transitions, 692 flow. Second operand 20 states and 7592 transitions. [2023-08-04 02:11:03,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 92 transitions, 892 flow [2023-08-04 02:11:03,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 92 transitions, 820 flow, removed 28 selfloop flow, removed 1 redundant places. [2023-08-04 02:11:03,743 INFO L231 Difference]: Finished difference. Result has 84 places, 92 transitions, 770 flow [2023-08-04 02:11:03,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1052, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=770, PETRI_PLACES=84, PETRI_TRANSITIONS=92} [2023-08-04 02:11:03,743 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-04 02:11:03,744 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 92 transitions, 770 flow [2023-08-04 02:11:03,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 376.62068965517244) internal successors, (10922), 29 states have internal predecessors, (10922), 0 states have call successors, (0), 0 states have 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:11:03,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:11:03,746 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:11:03,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 02:11:03,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:11:03,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:11:03,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:11:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2064134990, now seen corresponding path program 5 times [2023-08-04 02:11:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:11:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684292864] [2023-08-04 02:11:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:11:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:11:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:11:04,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 02:11:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:11:04,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 02:11:04,269 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 02:11:04,271 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:11:04,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:11:04,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 02:11:04,272 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2023-08-04 02:11:04,274 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 02:11:04,274 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 02:11:04,274 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 02:11:04,507 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 02:11:04,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 525 places, 601 transitions, 1250 flow [2023-08-04 02:11:04,737 INFO L124 PetriNetUnfolderBase]: 229/1470 cut-off events. [2023-08-04 02:11:04,737 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:11:04,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1470 events. 229/1470 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7492 event pairs, 1 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 996. Up to 32 conditions per place. [2023-08-04 02:11:04,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 525 places, 601 transitions, 1250 flow [2023-08-04 02:11:04,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 525 places, 601 transitions, 1250 flow [2023-08-04 02:11:04,764 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:11:04,764 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 525 places, 601 transitions, 1250 flow [2023-08-04 02:11:04,765 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 525 places, 601 transitions, 1250 flow [2023-08-04 02:11:04,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 525 places, 601 transitions, 1250 flow [2023-08-04 02:11:05,040 INFO L124 PetriNetUnfolderBase]: 229/1470 cut-off events. [2023-08-04 02:11:05,041 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:11:05,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1470 events. 229/1470 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7492 event pairs, 1 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 996. Up to 32 conditions per place. [2023-08-04 02:11:05,096 INFO L119 LiptonReduction]: Number of co-enabled transitions 62700 [2023-08-04 02:12:27,472 INFO L134 LiptonReduction]: Checked pairs total: 77338 [2023-08-04 02:12:27,473 INFO L136 LiptonReduction]: Total number of compositions: 716 [2023-08-04 02:12:27,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:12:27,474 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;@3fa1cd2d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:12:27,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:12:27,519 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:12:27,519 INFO L124 PetriNetUnfolderBase]: 31/106 cut-off events. [2023-08-04 02:12:27,519 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 02:12:27,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:12:27,519 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:12:27,519 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:12:27,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:12:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -859738445, now seen corresponding path program 1 times [2023-08-04 02:12:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:12:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012588792] [2023-08-04 02:12:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:12:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:12:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:12:27,581 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:12:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:12:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012588792] [2023-08-04 02:12:27,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012588792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:12:27,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:12:27,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:12:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502304523] [2023-08-04 02:12:27,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:12:27,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:12:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:12:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:12:27,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:12:27,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 1317 [2023-08-04 02:12:27,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have 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:12:27,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:12:27,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 1317 [2023-08-04 02:12:27,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:13:03,030 INFO L124 PetriNetUnfolderBase]: 29474/35538 cut-off events. [2023-08-04 02:13:03,031 INFO L125 PetriNetUnfolderBase]: For 2205/2205 co-relation queries the response was YES. [2023-08-04 02:13:03,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71645 conditions, 35538 events. 29474/35538 cut-off events. For 2205/2205 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 129896 event pairs, 12106 based on Foata normal form. 0/17234 useless extension candidates. Maximal degree in co-relation 17948. Up to 34710 conditions per place. [2023-08-04 02:13:03,104 INFO L140 encePairwiseOnDemand]: 1307/1317 looper letters, 50 selfloop transitions, 8 changer transitions 17/79 dead transitions. [2023-08-04 02:13:03,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 352 flow [2023-08-04 02:13:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:13:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:13:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1503 transitions. [2023-08-04 02:13:03,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3804100227790433 [2023-08-04 02:13:03,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1503 transitions. [2023-08-04 02:13:03,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1503 transitions. [2023-08-04 02:13:03,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:13:03,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1503 transitions. [2023-08-04 02:13:03,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have 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:13:03,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1317.0) internal successors, (5268), 4 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have 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:13:03,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1317.0) internal successors, (5268), 4 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have 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:13:03,113 INFO L175 Difference]: Start difference. First operand has 53 places, 76 transitions, 200 flow. Second operand 3 states and 1503 transitions. [2023-08-04 02:13:03,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 352 flow [2023-08-04 02:13:03,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:13:03,117 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 182 flow [2023-08-04 02:13:03,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2023-08-04 02:13:03,118 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-04 02:13:03,119 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 182 flow [2023-08-04 02:13:03,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have 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:13:03,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:13:03,119 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:13:03,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 02:13:03,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:13:03,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:13:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 14688391, now seen corresponding path program 1 times [2023-08-04 02:13:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:13:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156715440] [2023-08-04 02:13:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:13:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:13:03,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:13:03,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156715440] [2023-08-04 02:13:03,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156715440] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:13:03,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745885207] [2023-08-04 02:13:03,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:03,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:13:03,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:13:03,215 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:13:03,216 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:13:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:03,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:13:03,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:13:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 02:13:03,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:13:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745885207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:13:03,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:13:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 02:13:03,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331303640] [2023-08-04 02:13:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:13:03,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:13:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:13:03,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:13:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:13:04,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 1317 [2023-08-04 02:13:04,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 480.6666666666667) internal successors, (1442), 3 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have 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:13:04,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:13:04,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 1317 [2023-08-04 02:13:04,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:13:13,890 INFO L124 PetriNetUnfolderBase]: 7742/9209 cut-off events. [2023-08-04 02:13:13,890 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2023-08-04 02:13:13,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18744 conditions, 9209 events. 7742/9209 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 28103 event pairs, 3126 based on Foata normal form. 1/4553 useless extension candidates. Maximal degree in co-relation 18687. Up to 9119 conditions per place. [2023-08-04 02:13:13,916 INFO L140 encePairwiseOnDemand]: 1307/1317 looper letters, 54 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2023-08-04 02:13:13,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 314 flow [2023-08-04 02:13:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:13:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:13:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1487 transitions. [2023-08-04 02:13:13,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763604150847887 [2023-08-04 02:13:13,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1487 transitions. [2023-08-04 02:13:13,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1487 transitions. [2023-08-04 02:13:13,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:13:13,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1487 transitions. [2023-08-04 02:13:13,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 495.6666666666667) internal successors, (1487), 3 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have 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:13:13,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1317.0) internal successors, (5268), 4 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have 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:13:13,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1317.0) internal successors, (5268), 4 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have 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:13:13,924 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 182 flow. Second operand 3 states and 1487 transitions. [2023-08-04 02:13:13,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 314 flow [2023-08-04 02:13:13,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 302 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 02:13:13,925 INFO L231 Difference]: Finished difference. Result has 48 places, 66 transitions, 214 flow [2023-08-04 02:13:13,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=66} [2023-08-04 02:13:13,925 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-04 02:13:13,926 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 66 transitions, 214 flow [2023-08-04 02:13:13,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.6666666666667) internal successors, (1442), 3 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have 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:13:13,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:13:13,926 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:13:13,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 02:13:14,133 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:13:14,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:13:14,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:13:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash -622901822, now seen corresponding path program 1 times [2023-08-04 02:13:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:13:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444493102] [2023-08-04 02:13:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:13:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:13:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:13:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444493102] [2023-08-04 02:13:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444493102] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:13:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092613956] [2023-08-04 02:13:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:14,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:13:14,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:13:14,247 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:13:14,249 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:13:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:15,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-04 02:13:15,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:13:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:13:15,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:13:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:13:15,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092613956] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:13:15,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:13:15,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-08-04 02:13:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526741778] [2023-08-04 02:13:15,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:13:15,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:13:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:13:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:13:15,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:13:15,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 1317 [2023-08-04 02:13:15,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 66 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 462.875) internal successors, (3703), 8 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have 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:13:15,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:13:15,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 1317 [2023-08-04 02:13:15,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:13:25,019 INFO L124 PetriNetUnfolderBase]: 7742/9233 cut-off events. [2023-08-04 02:13:25,019 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2023-08-04 02:13:25,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18791 conditions, 9233 events. 7742/9233 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 28121 event pairs, 3126 based on Foata normal form. 12/4588 useless extension candidates. Maximal degree in co-relation 18667. Up to 9115 conditions per place. [2023-08-04 02:13:25,044 INFO L140 encePairwiseOnDemand]: 1300/1317 looper letters, 46 selfloop transitions, 40 changer transitions 0/90 dead transitions. [2023-08-04 02:13:25,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 90 transitions, 482 flow [2023-08-04 02:13:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 02:13:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 02:13:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3782 transitions. [2023-08-04 02:13:25,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35895975702353833 [2023-08-04 02:13:25,049 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3782 transitions. [2023-08-04 02:13:25,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3782 transitions. [2023-08-04 02:13:25,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:13:25,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3782 transitions. [2023-08-04 02:13:25,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 472.75) internal successors, (3782), 8 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states have 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:13:25,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1317.0) internal successors, (11853), 9 states have internal predecessors, (11853), 0 states have call successors, (0), 0 states have 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:13:25,059 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1317.0) internal successors, (11853), 9 states have internal predecessors, (11853), 0 states have call successors, (0), 0 states have 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:13:25,060 INFO L175 Difference]: Start difference. First operand has 48 places, 66 transitions, 214 flow. Second operand 8 states and 3782 transitions. [2023-08-04 02:13:25,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 90 transitions, 482 flow [2023-08-04 02:13:25,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 90 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:13:25,061 INFO L231 Difference]: Finished difference. Result has 57 places, 90 transitions, 444 flow [2023-08-04 02:13:25,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=444, PETRI_PLACES=57, PETRI_TRANSITIONS=90} [2023-08-04 02:13:25,062 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-04 02:13:25,062 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 90 transitions, 444 flow [2023-08-04 02:13:25,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 462.875) internal successors, (3703), 8 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have 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:13:25,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:13:25,062 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:13:25,074 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:13:25,274 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:13:25,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:13:25,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:13:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash -593293837, now seen corresponding path program 2 times [2023-08-04 02:13:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:13:25,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826326299] [2023-08-04 02:13:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:25,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:13:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-08-04 02:13:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:13:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826326299] [2023-08-04 02:13:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826326299] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:13:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24156462] [2023-08-04 02:13:25,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:13:25,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:13:25,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:13:25,468 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:13:25,470 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:13:26,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:13:26,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:13:26,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 02:13:26,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:13:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-08-04 02:13:26,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:13:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-08-04 02:13:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24156462] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:13:26,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:13:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 02:13:26,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876221687] [2023-08-04 02:13:26,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:13:26,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 02:13:26,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:13:26,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 02:13:26,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2023-08-04 02:13:26,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 1317 [2023-08-04 02:13:26,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 90 transitions, 444 flow. Second operand has 13 states, 13 states have (on average 461.46153846153845) internal successors, (5999), 13 states have internal predecessors, (5999), 0 states have call successors, (0), 0 states have 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:13:26,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:13:26,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 1317 [2023-08-04 02:13:26,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:13:36,735 INFO L124 PetriNetUnfolderBase]: 7742/9237 cut-off events. [2023-08-04 02:13:36,735 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2023-08-04 02:13:36,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18877 conditions, 9237 events. 7742/9237 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 28145 event pairs, 3126 based on Foata normal form. 2/4581 useless extension candidates. Maximal degree in co-relation 18693. Up to 9115 conditions per place. [2023-08-04 02:13:36,761 INFO L140 encePairwiseOnDemand]: 1300/1317 looper letters, 46 selfloop transitions, 44 changer transitions 0/94 dead transitions. [2023-08-04 02:13:36,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 648 flow [2023-08-04 02:13:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 02:13:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 02:13:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5143 transitions. [2023-08-04 02:13:36,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3550079381514461 [2023-08-04 02:13:36,767 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 5143 transitions. [2023-08-04 02:13:36,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 5143 transitions. [2023-08-04 02:13:36,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:13:36,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 5143 transitions. [2023-08-04 02:13:36,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 467.54545454545456) internal successors, (5143), 11 states have internal predecessors, (5143), 0 states have call successors, (0), 0 states have 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:13:36,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1317.0) internal successors, (15804), 12 states have internal predecessors, (15804), 0 states have call successors, (0), 0 states have 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:13:36,781 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1317.0) internal successors, (15804), 12 states have internal predecessors, (15804), 0 states have call successors, (0), 0 states have 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:13:36,781 INFO L175 Difference]: Start difference. First operand has 57 places, 90 transitions, 444 flow. Second operand 11 states and 5143 transitions. [2023-08-04 02:13:36,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 648 flow [2023-08-04 02:13:36,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 566 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-08-04 02:13:36,783 INFO L231 Difference]: Finished difference. Result has 65 places, 94 transitions, 492 flow [2023-08-04 02:13:36,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=492, PETRI_PLACES=65, PETRI_TRANSITIONS=94} [2023-08-04 02:13:36,783 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-08-04 02:13:36,784 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 94 transitions, 492 flow [2023-08-04 02:13:36,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 461.46153846153845) internal successors, (5999), 13 states have internal predecessors, (5999), 0 states have call successors, (0), 0 states have 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:13:36,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:13:36,784 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:13:36,797 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:13:36,993 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:13:36,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:13:36,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:13:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash -631677394, now seen corresponding path program 3 times [2023-08-04 02:13:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:13:36,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708540960] [2023-08-04 02:13:36,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:36,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:13:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-08-04 02:13:37,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:13:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708540960] [2023-08-04 02:13:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708540960] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:13:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445569581] [2023-08-04 02:13:37,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 02:13:37,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:13:37,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:13:37,192 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:13:37,194 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:13:38,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 02:13:38,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:13:38,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:13:38,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:13:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-08-04 02:13:38,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:13:38,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445569581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:13:38,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:13:38,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-08-04 02:13:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218604781] [2023-08-04 02:13:38,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:13:38,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:13:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:13:38,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:13:38,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-04 02:13:38,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 1317 [2023-08-04 02:13:38,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 94 transitions, 492 flow. Second operand has 5 states, 5 states have (on average 506.8) internal successors, (2534), 5 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have 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:13:38,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:13:38,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 1317 [2023-08-04 02:13:38,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:13:47,990 INFO L124 PetriNetUnfolderBase]: 7686/9272 cut-off events. [2023-08-04 02:13:47,990 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2023-08-04 02:13:47,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18897 conditions, 9272 events. 7686/9272 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 29795 event pairs, 1386 based on Foata normal form. 0/4625 useless extension candidates. Maximal degree in co-relation 18648. Up to 8934 conditions per place. [2023-08-04 02:13:48,013 INFO L140 encePairwiseOnDemand]: 1313/1317 looper letters, 110 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2023-08-04 02:13:48,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 118 transitions, 768 flow [2023-08-04 02:13:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:13:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:13:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2590 transitions. [2023-08-04 02:13:48,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3933181473044799 [2023-08-04 02:13:48,016 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2590 transitions. [2023-08-04 02:13:48,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2590 transitions. [2023-08-04 02:13:48,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:13:48,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2590 transitions. [2023-08-04 02:13:48,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 518.0) internal successors, (2590), 5 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have 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:13:48,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1317.0) internal successors, (7902), 6 states have internal predecessors, (7902), 0 states have call successors, (0), 0 states have 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:13:48,022 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1317.0) internal successors, (7902), 6 states have internal predecessors, (7902), 0 states have call successors, (0), 0 states have 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:13:48,022 INFO L175 Difference]: Start difference. First operand has 65 places, 94 transitions, 492 flow. Second operand 5 states and 2590 transitions. [2023-08-04 02:13:48,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 118 transitions, 768 flow [2023-08-04 02:13:48,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 118 transitions, 687 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-08-04 02:13:48,024 INFO L231 Difference]: Finished difference. Result has 62 places, 96 transitions, 430 flow [2023-08-04 02:13:48,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=62, PETRI_TRANSITIONS=96} [2023-08-04 02:13:48,025 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-04 02:13:48,025 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 96 transitions, 430 flow [2023-08-04 02:13:48,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 506.8) internal successors, (2534), 5 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have 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:13:48,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:13:48,025 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:13:48,039 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:13:48,234 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:13:48,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:13:48,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:13:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1659259669, now seen corresponding path program 1 times [2023-08-04 02:13:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:13:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118042022] [2023-08-04 02:13:48,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:48,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:13:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-08-04 02:13:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:13:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118042022] [2023-08-04 02:13:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118042022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:13:48,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:13:48,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:13:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580720821] [2023-08-04 02:13:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:13:48,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:13:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:13:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:13:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:13:48,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 1317 [2023-08-04 02:13:48,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 96 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have 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:13:48,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:13:48,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 1317 [2023-08-04 02:13:48,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:13:57,691 INFO L124 PetriNetUnfolderBase]: 7512/9027 cut-off events. [2023-08-04 02:13:57,691 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-08-04 02:13:57,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18405 conditions, 9027 events. 7512/9027 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 27854 event pairs, 2076 based on Foata normal form. 1/4497 useless extension candidates. Maximal degree in co-relation 18195. Up to 8833 conditions per place. [2023-08-04 02:13:57,713 INFO L140 encePairwiseOnDemand]: 1314/1317 looper letters, 98 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2023-08-04 02:13:57,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 643 flow [2023-08-04 02:13:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:13:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:13:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1573 transitions. [2023-08-04 02:13:57,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3981270564414072 [2023-08-04 02:13:57,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1573 transitions. [2023-08-04 02:13:57,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1573 transitions. [2023-08-04 02:13:57,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:13:57,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1573 transitions. [2023-08-04 02:13:57,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 524.3333333333334) internal successors, (1573), 3 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have 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:13:57,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1317.0) internal successors, (5268), 4 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have 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:13:57,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1317.0) internal successors, (5268), 4 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have 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:13:57,720 INFO L175 Difference]: Start difference. First operand has 62 places, 96 transitions, 430 flow. Second operand 3 states and 1573 transitions. [2023-08-04 02:13:57,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 643 flow [2023-08-04 02:13:57,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:13:57,722 INFO L231 Difference]: Finished difference. Result has 63 places, 95 transitions, 428 flow [2023-08-04 02:13:57,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=63, PETRI_TRANSITIONS=95} [2023-08-04 02:13:57,722 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2023-08-04 02:13:57,722 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 95 transitions, 428 flow [2023-08-04 02:13:57,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have 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:13:57,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:13:57,722 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:13:57,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 02:13:57,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:13:57,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:13:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1538234226, now seen corresponding path program 1 times [2023-08-04 02:13:57,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:13:57,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395219268] [2023-08-04 02:13:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:57,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:13:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-08-04 02:13:57,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:13:57,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395219268] [2023-08-04 02:13:57,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395219268] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:13:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171783784] [2023-08-04 02:13:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:13:57,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:13:57,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:13:57,814 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:13:57,816 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:13:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:13:58,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 02:13:58,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:13:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-08-04 02:13:58,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:13:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-08-04 02:13:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171783784] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:13:58,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:13:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2023-08-04 02:13:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887527651] [2023-08-04 02:13:58,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:13:58,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-04 02:13:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:13:58,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-04 02:13:58,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2023-08-04 02:13:59,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 1317 [2023-08-04 02:13:59,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 95 transitions, 428 flow. Second operand has 16 states, 16 states have (on average 456.8125) internal successors, (7309), 16 states have internal predecessors, (7309), 0 states have call successors, (0), 0 states have 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:13:59,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:13:59,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 1317 [2023-08-04 02:13:59,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:14:07,515 INFO L124 PetriNetUnfolderBase]: 6382/7627 cut-off events. [2023-08-04 02:14:07,516 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-08-04 02:14:07,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15612 conditions, 7627 events. 6382/7627 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 22343 event pairs, 1056 based on Foata normal form. 18/3806 useless extension candidates. Maximal degree in co-relation 15367. Up to 7337 conditions per place. [2023-08-04 02:14:07,537 INFO L140 encePairwiseOnDemand]: 1298/1317 looper letters, 66 selfloop transitions, 61 changer transitions 0/130 dead transitions. [2023-08-04 02:14:07,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 130 transitions, 835 flow [2023-08-04 02:14:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-04 02:14:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-04 02:14:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 7406 transitions. [2023-08-04 02:14:07,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.351461655277145 [2023-08-04 02:14:07,546 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 7406 transitions. [2023-08-04 02:14:07,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 7406 transitions. [2023-08-04 02:14:07,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:14:07,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 7406 transitions. [2023-08-04 02:14:07,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 462.875) internal successors, (7406), 16 states have internal predecessors, (7406), 0 states have call successors, (0), 0 states have 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:14:07,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 1317.0) internal successors, (22389), 17 states have internal predecessors, (22389), 0 states have call successors, (0), 0 states have 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:14:07,561 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 1317.0) internal successors, (22389), 17 states have internal predecessors, (22389), 0 states have call successors, (0), 0 states have 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:14:07,561 INFO L175 Difference]: Start difference. First operand has 63 places, 95 transitions, 428 flow. Second operand 16 states and 7406 transitions. [2023-08-04 02:14:07,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 130 transitions, 835 flow [2023-08-04 02:14:07,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 130 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:14:07,564 INFO L231 Difference]: Finished difference. Result has 76 places, 108 transitions, 657 flow [2023-08-04 02:14:07,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=657, PETRI_PLACES=76, PETRI_TRANSITIONS=108} [2023-08-04 02:14:07,564 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2023-08-04 02:14:07,564 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 657 flow [2023-08-04 02:14:07,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 456.8125) internal successors, (7309), 16 states have internal predecessors, (7309), 0 states have call successors, (0), 0 states have 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:14:07,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:14:07,565 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:14:07,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-04 02:14:07,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 02:14:07,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:14:07,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:14:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1849394500, now seen corresponding path program 1 times [2023-08-04 02:14:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:14:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841193253] [2023-08-04 02:14:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:14:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:14:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:14:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-08-04 02:14:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:14:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841193253] [2023-08-04 02:14:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841193253] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:14:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417139836] [2023-08-04 02:14:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:14:08,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:14:08,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:14:08,101 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:14:08,103 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:14:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:14:09,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:14:09,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:14:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-08-04 02:14:09,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:14:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-08-04 02:14:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417139836] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:14:09,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:14:09,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2023-08-04 02:14:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161240131] [2023-08-04 02:14:09,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:14:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 02:14:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:14:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 02:14:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2023-08-04 02:14:10,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 1317 [2023-08-04 02:14:10,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 657 flow. Second operand has 29 states, 29 states have (on average 460.82758620689657) internal successors, (13364), 29 states have internal predecessors, (13364), 0 states have call successors, (0), 0 states have 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:14:10,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:14:10,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 1317 [2023-08-04 02:14:10,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:14:18,607 INFO L124 PetriNetUnfolderBase]: 6382/7629 cut-off events. [2023-08-04 02:14:18,607 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2023-08-04 02:14:18,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15700 conditions, 7629 events. 6382/7629 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 22349 event pairs, 2586 based on Foata normal form. 2/3792 useless extension candidates. Maximal degree in co-relation 15397. Up to 7429 conditions per place. [2023-08-04 02:14:18,625 INFO L140 encePairwiseOnDemand]: 1300/1317 looper letters, 47 selfloop transitions, 60 changer transitions 0/110 dead transitions. [2023-08-04 02:14:18,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 110 transitions, 891 flow [2023-08-04 02:14:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-04 02:14:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-04 02:14:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 9288 transitions. [2023-08-04 02:14:18,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.352619589977221 [2023-08-04 02:14:18,631 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 9288 transitions. [2023-08-04 02:14:18,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 9288 transitions. [2023-08-04 02:14:18,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:14:18,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 9288 transitions. [2023-08-04 02:14:18,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 464.4) internal successors, (9288), 20 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have 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:14:18,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 1317.0) internal successors, (27657), 21 states have internal predecessors, (27657), 0 states have call successors, (0), 0 states have 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:14:18,650 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 1317.0) internal successors, (27657), 21 states have internal predecessors, (27657), 0 states have call successors, (0), 0 states have 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:14:18,650 INFO L175 Difference]: Start difference. First operand has 76 places, 108 transitions, 657 flow. Second operand 20 states and 9288 transitions. [2023-08-04 02:14:18,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 110 transitions, 891 flow [2023-08-04 02:14:18,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 110 transitions, 769 flow, removed 31 selfloop flow, removed 6 redundant places. [2023-08-04 02:14:18,653 INFO L231 Difference]: Finished difference. Result has 90 places, 110 transitions, 685 flow [2023-08-04 02:14:18,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=685, PETRI_PLACES=90, PETRI_TRANSITIONS=110} [2023-08-04 02:14:18,653 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2023-08-04 02:14:18,654 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 110 transitions, 685 flow [2023-08-04 02:14:18,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 460.82758620689657) internal successors, (13364), 29 states have internal predecessors, (13364), 0 states have call successors, (0), 0 states have 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:14:18,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:14:18,655 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:14:18,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 02:14:18,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 02:14:18,864 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:14:18,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:14:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash -741691354, now seen corresponding path program 2 times [2023-08-04 02:14:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:14:18,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016001689] [2023-08-04 02:14:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:14:18,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:14:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:14:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-08-04 02:14:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:14:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016001689] [2023-08-04 02:14:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016001689] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:14:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190620032] [2023-08-04 02:14:18,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:14:18,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:14:18,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:14:19,001 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:14:19,003 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:14:19,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:14:19,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:14:19,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:14:19,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:14:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-08-04 02:14:19,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:14:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190620032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:14:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:14:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 02:14:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418364554] [2023-08-04 02:14:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:14:19,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:14:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:14:19,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:14:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:14:19,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 1317 [2023-08-04 02:14:19,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 110 transitions, 685 flow. Second operand has 5 states, 5 states have (on average 507.8) internal successors, (2539), 5 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have 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:14:19,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:14:19,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 1317 [2023-08-04 02:14:19,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:14:26,185 INFO L124 PetriNetUnfolderBase]: 4590/5517 cut-off events. [2023-08-04 02:14:26,185 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-08-04 02:14:26,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11475 conditions, 5517 events. 4590/5517 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 15109 event pairs, 42 based on Foata normal form. 256/2958 useless extension candidates. Maximal degree in co-relation 11119. Up to 2656 conditions per place. [2023-08-04 02:14:26,192 INFO L140 encePairwiseOnDemand]: 1314/1317 looper letters, 0 selfloop transitions, 0 changer transitions 174/174 dead transitions. [2023-08-04 02:14:26,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 174 transitions, 1155 flow [2023-08-04 02:14:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:14:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:14:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2630 transitions. [2023-08-04 02:14:26,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939255884586183 [2023-08-04 02:14:26,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2630 transitions. [2023-08-04 02:14:26,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2630 transitions. [2023-08-04 02:14:26,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:14:26,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2630 transitions. [2023-08-04 02:14:26,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 526.0) internal successors, (2630), 5 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have 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:14:26,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1317.0) internal successors, (7902), 6 states have internal predecessors, (7902), 0 states have call successors, (0), 0 states have 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:14:26,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1317.0) internal successors, (7902), 6 states have internal predecessors, (7902), 0 states have call successors, (0), 0 states have 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:14:26,202 INFO L175 Difference]: Start difference. First operand has 90 places, 110 transitions, 685 flow. Second operand 5 states and 2630 transitions. [2023-08-04 02:14:26,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 174 transitions, 1155 flow [2023-08-04 02:14:26,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 174 transitions, 1002 flow, removed 22 selfloop flow, removed 14 redundant places. [2023-08-04 02:14:26,206 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2023-08-04 02:14:26,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1317, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2023-08-04 02:14:26,206 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2023-08-04 02:14:26,207 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2023-08-04 02:14:26,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 507.8) internal successors, (2539), 5 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have 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:14:26,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:14:26,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:14:26,235 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:14:26,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 02:14:26,413 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-08-04 02:14:26,413 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 02:14:26,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 525 places, 601 transitions, 1250 flow [2023-08-04 02:14:26,693 INFO L124 PetriNetUnfolderBase]: 229/1470 cut-off events. [2023-08-04 02:14:26,693 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:14:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1470 events. 229/1470 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7492 event pairs, 1 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 996. Up to 32 conditions per place. [2023-08-04 02:14:26,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 525 places, 601 transitions, 1250 flow [2023-08-04 02:14:26,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 525 places, 601 transitions, 1250 flow [2023-08-04 02:14:26,718 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:14:26,718 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 525 places, 601 transitions, 1250 flow [2023-08-04 02:14:26,718 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 525 places, 601 transitions, 1250 flow [2023-08-04 02:14:26,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 525 places, 601 transitions, 1250 flow [2023-08-04 02:14:26,930 INFO L124 PetriNetUnfolderBase]: 229/1470 cut-off events. [2023-08-04 02:14:26,930 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:14:26,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1470 events. 229/1470 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7492 event pairs, 1 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 996. Up to 32 conditions per place. [2023-08-04 02:14:26,979 INFO L119 LiptonReduction]: Number of co-enabled transitions 62700 [2023-08-04 02:15:57,041 INFO L134 LiptonReduction]: Checked pairs total: 79055 [2023-08-04 02:15:57,042 INFO L136 LiptonReduction]: Total number of compositions: 724 [2023-08-04 02:15:57,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 02:15:57,043 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;@3fa1cd2d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:15:57,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 02:15:57,056 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:15:57,056 INFO L124 PetriNetUnfolderBase]: 12/34 cut-off events. [2023-08-04 02:15:57,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:15:57,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:15:57,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:15:57,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:15:57,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:15:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash -189854077, now seen corresponding path program 1 times [2023-08-04 02:15:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:15:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585809172] [2023-08-04 02:15:57,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:15:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:15:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:15:57,124 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:15:57,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:15:57,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585809172] [2023-08-04 02:15:57,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585809172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:15:57,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:15:57,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:15:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243662066] [2023-08-04 02:15:57,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:15:57,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:15:57,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:15:57,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:15:57,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:15:57,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 1325 [2023-08-04 02:15:57,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have 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:15:57,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:15:57,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 1325 [2023-08-04 02:15:57,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:16:36,935 INFO L124 PetriNetUnfolderBase]: 29474/35536 cut-off events. [2023-08-04 02:16:36,936 INFO L125 PetriNetUnfolderBase]: For 2217/2217 co-relation queries the response was YES. [2023-08-04 02:16:36,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71641 conditions, 35536 events. 29474/35536 cut-off events. For 2217/2217 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 130453 event pairs, 12106 based on Foata normal form. 0/17232 useless extension candidates. Maximal degree in co-relation 17948. Up to 34710 conditions per place. [2023-08-04 02:16:37,057 INFO L140 encePairwiseOnDemand]: 1319/1325 looper letters, 67 selfloop transitions, 4 changer transitions 2/77 dead transitions. [2023-08-04 02:16:37,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 344 flow [2023-08-04 02:16:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:16:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:16:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1499 transitions. [2023-08-04 02:16:37,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771069182389937 [2023-08-04 02:16:37,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1499 transitions. [2023-08-04 02:16:37,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1499 transitions. [2023-08-04 02:16:37,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:16:37,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1499 transitions. [2023-08-04 02:16:37,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 499.6666666666667) internal successors, (1499), 3 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have 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:16:37,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:16:37,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:16:37,063 INFO L175 Difference]: Start difference. First operand has 53 places, 76 transitions, 200 flow. Second operand 3 states and 1499 transitions. [2023-08-04 02:16:37,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 344 flow [2023-08-04 02:16:37,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:16:37,066 INFO L231 Difference]: Finished difference. Result has 55 places, 75 transitions, 208 flow [2023-08-04 02:16:37,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=55, PETRI_TRANSITIONS=75} [2023-08-04 02:16:37,066 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-04 02:16:37,066 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 75 transitions, 208 flow [2023-08-04 02:16:37,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have 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:16:37,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:16:37,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:16:37,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 02:16:37,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:16:37,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:16:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash -960820015, now seen corresponding path program 1 times [2023-08-04 02:16:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:16:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638249949] [2023-08-04 02:16:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:16:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:16:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:16:37,119 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:16:37,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:16:37,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638249949] [2023-08-04 02:16:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638249949] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:16:37,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:16:37,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:16:37,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539142644] [2023-08-04 02:16:37,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:16:37,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:16:37,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:16:37,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:16:37,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:16:37,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 1325 [2023-08-04 02:16:37,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 75 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have 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:16:37,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:16:37,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 1325 [2023-08-04 02:16:37,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:17:16,851 INFO L124 PetriNetUnfolderBase]: 29279/35165 cut-off events. [2023-08-04 02:17:16,852 INFO L125 PetriNetUnfolderBase]: For 2140/2140 co-relation queries the response was YES. [2023-08-04 02:17:16,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70930 conditions, 35165 events. 29279/35165 cut-off events. For 2140/2140 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 126668 event pairs, 8831 based on Foata normal form. 0/16977 useless extension candidates. Maximal degree in co-relation 70905. Up to 34445 conditions per place. [2023-08-04 02:17:16,957 INFO L140 encePairwiseOnDemand]: 1322/1325 looper letters, 78 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-04 02:17:16,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 386 flow [2023-08-04 02:17:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:17:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:17:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1588 transitions. [2023-08-04 02:17:16,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39949685534591195 [2023-08-04 02:17:16,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1588 transitions. [2023-08-04 02:17:16,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1588 transitions. [2023-08-04 02:17:16,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:17:16,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1588 transitions. [2023-08-04 02:17:16,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 529.3333333333334) internal successors, (1588), 3 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have 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:17:16,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:17:16,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:17:16,963 INFO L175 Difference]: Start difference. First operand has 55 places, 75 transitions, 208 flow. Second operand 3 states and 1588 transitions. [2023-08-04 02:17:16,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 386 flow [2023-08-04 02:17:16,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 02:17:16,970 INFO L231 Difference]: Finished difference. Result has 53 places, 76 transitions, 210 flow [2023-08-04 02:17:16,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=53, PETRI_TRANSITIONS=76} [2023-08-04 02:17:16,971 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-04 02:17:16,971 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 76 transitions, 210 flow [2023-08-04 02:17:16,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have 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:17:16,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:17:16,971 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:17:16,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 02:17:16,971 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:17:16,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:17:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash -65568727, now seen corresponding path program 1 times [2023-08-04 02:17:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:17:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050038138] [2023-08-04 02:17:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:17:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:17:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:17:17,025 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:17:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:17:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050038138] [2023-08-04 02:17:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050038138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:17:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312310169] [2023-08-04 02:17:17,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:17:17,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:17:17,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:17:17,028 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:17:17,033 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:17:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:17:18,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:17:18,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:17:18,241 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:17:18,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:17:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312310169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:17:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:17:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 02:17:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836553116] [2023-08-04 02:17:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:17:18,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:17:18,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:17:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:17:18,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:17:18,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 1325 [2023-08-04 02:17:18,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 76 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have 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:17:18,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:17:18,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 1325 [2023-08-04 02:17:18,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:17:57,682 INFO L124 PetriNetUnfolderBase]: 29259/35277 cut-off events. [2023-08-04 02:17:57,682 INFO L125 PetriNetUnfolderBase]: For 1202/1202 co-relation queries the response was YES. [2023-08-04 02:17:57,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70982 conditions, 35277 events. 29259/35277 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 128208 event pairs, 8806 based on Foata normal form. 0/17105 useless extension candidates. Maximal degree in co-relation 70952. Up to 33857 conditions per place. [2023-08-04 02:17:57,773 INFO L140 encePairwiseOnDemand]: 1322/1325 looper letters, 93 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2023-08-04 02:17:57,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 446 flow [2023-08-04 02:17:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:17:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:17:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1602 transitions. [2023-08-04 02:17:57,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4030188679245283 [2023-08-04 02:17:57,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1602 transitions. [2023-08-04 02:17:57,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1602 transitions. [2023-08-04 02:17:57,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:17:57,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1602 transitions. [2023-08-04 02:17:57,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have 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:17:57,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:17:57,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:17:57,778 INFO L175 Difference]: Start difference. First operand has 53 places, 76 transitions, 210 flow. Second operand 3 states and 1602 transitions. [2023-08-04 02:17:57,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 446 flow [2023-08-04 02:17:57,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 444 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:17:57,780 INFO L231 Difference]: Finished difference. Result has 55 places, 77 transitions, 220 flow [2023-08-04 02:17:57,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=55, PETRI_TRANSITIONS=77} [2023-08-04 02:17:57,781 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-04 02:17:57,781 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 77 transitions, 220 flow [2023-08-04 02:17:57,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have 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:17:57,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:17:57,781 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] [2023-08-04 02:17:57,791 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:17:57,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:17:57,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:17:57,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:17:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1234979300, now seen corresponding path program 1 times [2023-08-04 02:17:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:17:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978906092] [2023-08-04 02:17:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:17:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:17:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:17:58,044 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:17:58,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:17:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978906092] [2023-08-04 02:17:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978906092] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:17:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790962876] [2023-08-04 02:17:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:17:58,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:17:58,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:17:58,081 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:17:58,083 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:17:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:17:59,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:17:59,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:17:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 02:17:59,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:17:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790962876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:17:59,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:17:59,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 02:17:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666611970] [2023-08-04 02:17:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:17:59,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:17:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:17:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:17:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:17:59,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 1325 [2023-08-04 02:17:59,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 77 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have 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:17:59,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:17:59,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 1325 [2023-08-04 02:17:59,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:18:32,517 INFO L124 PetriNetUnfolderBase]: 23993/29195 cut-off events. [2023-08-04 02:18:32,517 INFO L125 PetriNetUnfolderBase]: For 1481/1481 co-relation queries the response was YES. [2023-08-04 02:18:32,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59731 conditions, 29195 events. 23993/29195 cut-off events. For 1481/1481 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 106066 event pairs, 7032 based on Foata normal form. 0/14775 useless extension candidates. Maximal degree in co-relation 59700. Up to 20683 conditions per place. [2023-08-04 02:18:32,609 INFO L140 encePairwiseOnDemand]: 1322/1325 looper letters, 105 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2023-08-04 02:18:32,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 512 flow [2023-08-04 02:18:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:18:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:18:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1613 transitions. [2023-08-04 02:18:32,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4057861635220126 [2023-08-04 02:18:32,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1613 transitions. [2023-08-04 02:18:32,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1613 transitions. [2023-08-04 02:18:32,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:18:32,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1613 transitions. [2023-08-04 02:18:32,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 537.6666666666666) internal successors, (1613), 3 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have 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:18:32,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:18:32,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:18:32,615 INFO L175 Difference]: Start difference. First operand has 55 places, 77 transitions, 220 flow. Second operand 3 states and 1613 transitions. [2023-08-04 02:18:32,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 512 flow [2023-08-04 02:18:32,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 111 transitions, 510 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:18:32,617 INFO L231 Difference]: Finished difference. Result has 57 places, 78 transitions, 230 flow [2023-08-04 02:18:32,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=57, PETRI_TRANSITIONS=78} [2023-08-04 02:18:32,618 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-04 02:18:32,618 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 78 transitions, 230 flow [2023-08-04 02:18:32,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have 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:18:32,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:18:32,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:18:32,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-04 02:18:32,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:18:32,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:18:32,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:18:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2073113253, now seen corresponding path program 1 times [2023-08-04 02:18:32,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:18:32,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693724324] [2023-08-04 02:18:32,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:18:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:18:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:18:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 02:18:32,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:18:32,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693724324] [2023-08-04 02:18:32,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693724324] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:18:32,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139477589] [2023-08-04 02:18:32,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:18:32,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:18:32,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:18:32,963 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:18:32,965 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:18:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:18:34,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:18:34,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:18:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:18:34,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:18:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139477589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:18:34,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:18:34,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 02:18:34,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557094337] [2023-08-04 02:18:34,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:18:34,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:18:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:18:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:18:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:18:34,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 1325 [2023-08-04 02:18:34,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 78 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have 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:18:34,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:18:34,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 1325 [2023-08-04 02:18:34,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:19:05,433 INFO L124 PetriNetUnfolderBase]: 23344/28550 cut-off events. [2023-08-04 02:19:05,433 INFO L125 PetriNetUnfolderBase]: For 3802/3802 co-relation queries the response was YES. [2023-08-04 02:19:05,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59967 conditions, 28550 events. 23344/28550 cut-off events. For 3802/3802 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 103306 event pairs, 8135 based on Foata normal form. 0/15091 useless extension candidates. Maximal degree in co-relation 59935. Up to 23097 conditions per place. [2023-08-04 02:19:05,517 INFO L140 encePairwiseOnDemand]: 1322/1325 looper letters, 106 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2023-08-04 02:19:05,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 112 transitions, 524 flow [2023-08-04 02:19:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:19:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:19:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1613 transitions. [2023-08-04 02:19:05,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4057861635220126 [2023-08-04 02:19:05,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1613 transitions. [2023-08-04 02:19:05,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1613 transitions. [2023-08-04 02:19:05,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:19:05,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1613 transitions. [2023-08-04 02:19:05,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 537.6666666666666) internal successors, (1613), 3 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have 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:19:05,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:19:05,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1325.0) internal successors, (5300), 4 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have 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:19:05,524 INFO L175 Difference]: Start difference. First operand has 57 places, 78 transitions, 230 flow. Second operand 3 states and 1613 transitions. [2023-08-04 02:19:05,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 112 transitions, 524 flow [2023-08-04 02:19:05,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 112 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:19:05,544 INFO L231 Difference]: Finished difference. Result has 59 places, 79 transitions, 240 flow [2023-08-04 02:19:05,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=59, PETRI_TRANSITIONS=79} [2023-08-04 02:19:05,544 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2023-08-04 02:19:05,544 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 79 transitions, 240 flow [2023-08-04 02:19:05,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have 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:19:05,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:19:05,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:19:05,556 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:19:05,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:19:05,745 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:19:05,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:19:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash -817160605, now seen corresponding path program 1 times [2023-08-04 02:19:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:19:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246445043] [2023-08-04 02:19:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:19:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:19:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:19:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:19:05,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:19:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246445043] [2023-08-04 02:19:05,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246445043] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:19:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030395386] [2023-08-04 02:19:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:19:05,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:19:05,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:19:05,861 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:19:05,863 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:19:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:19:07,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-04 02:19:07,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:19:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:19:07,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:19:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 02:19:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030395386] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:19:07,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:19:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-08-04 02:19:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070907437] [2023-08-04 02:19:07,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:19:07,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:19:07,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:19:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:19:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:19:07,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 1325 [2023-08-04 02:19:07,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 79 transitions, 240 flow. Second operand has 8 states, 8 states have (on average 460.0) internal successors, (3680), 8 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have 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:19:07,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:19:07,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 1325 [2023-08-04 02:19:07,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:19:36,497 INFO L124 PetriNetUnfolderBase]: 21248/25968 cut-off events. [2023-08-04 02:19:36,498 INFO L125 PetriNetUnfolderBase]: For 2810/2810 co-relation queries the response was YES. [2023-08-04 02:19:36,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54867 conditions, 25968 events. 21248/25968 cut-off events. For 2810/2810 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 92363 event pairs, 4239 based on Foata normal form. 8/13842 useless extension candidates. Maximal degree in co-relation 54816. Up to 25149 conditions per place. [2023-08-04 02:19:36,569 INFO L140 encePairwiseOnDemand]: 1305/1325 looper letters, 84 selfloop transitions, 35 changer transitions 1/124 dead transitions. [2023-08-04 02:19:36,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 124 transitions, 582 flow [2023-08-04 02:19:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 02:19:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 02:19:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3772 transitions. [2023-08-04 02:19:36,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3558490566037736 [2023-08-04 02:19:36,572 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3772 transitions. [2023-08-04 02:19:36,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3772 transitions. [2023-08-04 02:19:36,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:19:36,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3772 transitions. [2023-08-04 02:19:36,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 471.5) internal successors, (3772), 8 states have internal predecessors, (3772), 0 states have call successors, (0), 0 states have 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:19:36,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1325.0) internal successors, (11925), 9 states have internal predecessors, (11925), 0 states have call successors, (0), 0 states have 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:19:36,580 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1325.0) internal successors, (11925), 9 states have internal predecessors, (11925), 0 states have call successors, (0), 0 states have 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:19:36,580 INFO L175 Difference]: Start difference. First operand has 59 places, 79 transitions, 240 flow. Second operand 8 states and 3772 transitions. [2023-08-04 02:19:36,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 124 transitions, 582 flow [2023-08-04 02:19:36,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 124 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:19:36,628 INFO L231 Difference]: Finished difference. Result has 67 places, 101 transitions, 404 flow [2023-08-04 02:19:36,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2023-08-04 02:19:36,629 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2023-08-04 02:19:36,629 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 404 flow [2023-08-04 02:19:36,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 460.0) internal successors, (3680), 8 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have 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:19:36,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:19:36,629 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:19:36,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-04 02:19:36,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-04 02:19:36,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:19:36,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:19:36,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1356745065, now seen corresponding path program 1 times [2023-08-04 02:19:36,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:19:36,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934147753] [2023-08-04 02:19:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:19:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:19:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:19:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-08-04 02:19:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:19:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934147753] [2023-08-04 02:19:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934147753] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:19:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284852982] [2023-08-04 02:19:37,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:19:37,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:19:37,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:19:37,042 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:19:37,047 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:19:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:19:38,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 02:19:38,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:19:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-08-04 02:19:38,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:19:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-08-04 02:19:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284852982] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:19:38,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:19:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 02:19:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389418299] [2023-08-04 02:19:38,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:19:38,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 02:19:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:19:38,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 02:19:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-08-04 02:19:39,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 1325 [2023-08-04 02:19:39,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 404 flow. Second operand has 14 states, 14 states have (on average 459.2142857142857) internal successors, (6429), 14 states have internal predecessors, (6429), 0 states have call successors, (0), 0 states have 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:19:39,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:19:39,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 1325 [2023-08-04 02:19:39,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:20:07,110 INFO L124 PetriNetUnfolderBase]: 20304/24796 cut-off events. [2023-08-04 02:20:07,111 INFO L125 PetriNetUnfolderBase]: For 1486/1486 co-relation queries the response was YES. [2023-08-04 02:20:07,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52356 conditions, 24796 events. 20304/24796 cut-off events. For 1486/1486 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 85580 event pairs, 3682 based on Foata normal form. 65/13239 useless extension candidates. Maximal degree in co-relation 52280. Up to 18977 conditions per place. [2023-08-04 02:20:07,196 INFO L140 encePairwiseOnDemand]: 1304/1325 looper letters, 112 selfloop transitions, 47 changer transitions 1/164 dead transitions. [2023-08-04 02:20:07,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 164 transitions, 878 flow [2023-08-04 02:20:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 02:20:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 02:20:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 6072 transitions. [2023-08-04 02:20:07,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.352510885341074 [2023-08-04 02:20:07,201 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 6072 transitions. [2023-08-04 02:20:07,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 6072 transitions. [2023-08-04 02:20:07,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:20:07,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 6072 transitions. [2023-08-04 02:20:07,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 467.0769230769231) internal successors, (6072), 13 states have internal predecessors, (6072), 0 states have call successors, (0), 0 states have 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:20:07,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 1325.0) internal successors, (18550), 14 states have internal predecessors, (18550), 0 states have call successors, (0), 0 states have 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:20:07,216 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 1325.0) internal successors, (18550), 14 states have internal predecessors, (18550), 0 states have call successors, (0), 0 states have 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:20:07,216 INFO L175 Difference]: Start difference. First operand has 67 places, 101 transitions, 404 flow. Second operand 13 states and 6072 transitions. [2023-08-04 02:20:07,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 164 transitions, 878 flow [2023-08-04 02:20:07,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 164 transitions, 845 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-04 02:20:07,257 INFO L231 Difference]: Finished difference. Result has 79 places, 113 transitions, 567 flow [2023-08-04 02:20:07,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=567, PETRI_PLACES=79, PETRI_TRANSITIONS=113} [2023-08-04 02:20:07,258 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2023-08-04 02:20:07,258 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 113 transitions, 567 flow [2023-08-04 02:20:07,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 459.2142857142857) internal successors, (6429), 14 states have internal predecessors, (6429), 0 states have call successors, (0), 0 states have 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:20:07,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:20:07,260 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:20:07,278 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:20:07,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:20:07,474 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:20:07,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:20:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash 923590221, now seen corresponding path program 1 times [2023-08-04 02:20:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:20:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414134780] [2023-08-04 02:20:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:20:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:20:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:20:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-08-04 02:20:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:20:07,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414134780] [2023-08-04 02:20:07,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414134780] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:20:07,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441747150] [2023-08-04 02:20:07,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:20:07,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:20:07,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:20:07,677 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:20:07,679 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:20:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:20:08,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 02:20:08,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:20:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-08-04 02:20:09,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:20:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-08-04 02:20:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441747150] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:20:09,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:20:09,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2023-08-04 02:20:09,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748930503] [2023-08-04 02:20:09,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:20:09,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-04 02:20:09,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:20:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-04 02:20:09,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2023-08-04 02:20:09,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 1325 [2023-08-04 02:20:09,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 113 transitions, 567 flow. Second operand has 16 states, 16 states have (on average 458.3125) internal successors, (7333), 16 states have internal predecessors, (7333), 0 states have call successors, (0), 0 states have 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:20:09,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:20:09,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 1325 [2023-08-04 02:20:09,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:20:30,565 INFO L124 PetriNetUnfolderBase]: 14308/17534 cut-off events. [2023-08-04 02:20:30,565 INFO L125 PetriNetUnfolderBase]: For 4147/4147 co-relation queries the response was YES. [2023-08-04 02:20:30,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37853 conditions, 17534 events. 14308/17534 cut-off events. For 4147/4147 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 57586 event pairs, 2353 based on Foata normal form. 270/9529 useless extension candidates. Maximal degree in co-relation 37548. Up to 7032 conditions per place. [2023-08-04 02:20:30,615 INFO L140 encePairwiseOnDemand]: 1304/1325 looper letters, 123 selfloop transitions, 62 changer transitions 0/189 dead transitions. [2023-08-04 02:20:30,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 189 transitions, 1154 flow [2023-08-04 02:20:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-04 02:20:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-04 02:20:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 7461 transitions. [2023-08-04 02:20:30,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35193396226415097 [2023-08-04 02:20:30,623 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 7461 transitions. [2023-08-04 02:20:30,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 7461 transitions. [2023-08-04 02:20:30,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:20:30,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 7461 transitions. [2023-08-04 02:20:30,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 466.3125) internal successors, (7461), 16 states have internal predecessors, (7461), 0 states have call successors, (0), 0 states have 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:20:30,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 1325.0) internal successors, (22525), 17 states have internal predecessors, (22525), 0 states have call successors, (0), 0 states have 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:20:30,642 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 1325.0) internal successors, (22525), 17 states have internal predecessors, (22525), 0 states have call successors, (0), 0 states have 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:20:30,642 INFO L175 Difference]: Start difference. First operand has 79 places, 113 transitions, 567 flow. Second operand 16 states and 7461 transitions. [2023-08-04 02:20:30,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 189 transitions, 1154 flow [2023-08-04 02:20:30,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 189 transitions, 1074 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-04 02:20:30,663 INFO L231 Difference]: Finished difference. Result has 97 places, 128 transitions, 822 flow [2023-08-04 02:20:30,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=822, PETRI_PLACES=97, PETRI_TRANSITIONS=128} [2023-08-04 02:20:30,664 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2023-08-04 02:20:30,664 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 128 transitions, 822 flow [2023-08-04 02:20:30,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 458.3125) internal successors, (7333), 16 states have internal predecessors, (7333), 0 states have call successors, (0), 0 states have 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:20:30,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:20:30,665 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:20:30,677 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:20:30,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:20:30,881 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:20:30,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:20:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1312836258, now seen corresponding path program 1 times [2023-08-04 02:20:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:20:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921796156] [2023-08-04 02:20:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:20:30,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:20:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:20:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-08-04 02:20:31,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:20:31,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921796156] [2023-08-04 02:20:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921796156] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:20:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686557207] [2023-08-04 02:20:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:20:31,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:20:31,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:20:31,082 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:20:31,097 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:20:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:20:32,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 02:20:32,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:20:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2023-08-04 02:20:32,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:20:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2023-08-04 02:20:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686557207] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:20:32,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:20:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 15, 15] total 30 [2023-08-04 02:20:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571049677] [2023-08-04 02:20:32,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:20:32,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 02:20:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:20:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 02:20:32,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=565, Unknown=0, NotChecked=0, Total=870 [2023-08-04 02:20:33,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 1325 [2023-08-04 02:20:33,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 128 transitions, 822 flow. Second operand has 30 states, 30 states have (on average 457.03333333333336) internal successors, (13711), 30 states have internal predecessors, (13711), 0 states have call successors, (0), 0 states have 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:20:33,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:20:33,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 1325 [2023-08-04 02:20:33,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:20:54,628 INFO L124 PetriNetUnfolderBase]: 14280/17493 cut-off events. [2023-08-04 02:20:54,629 INFO L125 PetriNetUnfolderBase]: For 5952/5952 co-relation queries the response was YES. [2023-08-04 02:20:54,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39282 conditions, 17493 events. 14280/17493 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 57386 event pairs, 5681 based on Foata normal form. 19/9257 useless extension candidates. Maximal degree in co-relation 38880. Up to 15841 conditions per place. [2023-08-04 02:20:54,681 INFO L140 encePairwiseOnDemand]: 1304/1325 looper letters, 123 selfloop transitions, 63 changer transitions 2/192 dead transitions. [2023-08-04 02:20:54,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 192 transitions, 1346 flow [2023-08-04 02:20:54,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 02:20:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 02:20:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 10175 transitions. [2023-08-04 02:20:54,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3490566037735849 [2023-08-04 02:20:54,687 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 10175 transitions. [2023-08-04 02:20:54,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 10175 transitions. [2023-08-04 02:20:54,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:20:54,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 10175 transitions. [2023-08-04 02:20:54,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 462.5) internal successors, (10175), 22 states have internal predecessors, (10175), 0 states have call successors, (0), 0 states have 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:20:54,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 1325.0) internal successors, (30475), 23 states have internal predecessors, (30475), 0 states have call successors, (0), 0 states have 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:20:54,707 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 1325.0) internal successors, (30475), 23 states have internal predecessors, (30475), 0 states have call successors, (0), 0 states have 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:20:54,707 INFO L175 Difference]: Start difference. First operand has 97 places, 128 transitions, 822 flow. Second operand 22 states and 10175 transitions. [2023-08-04 02:20:54,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 192 transitions, 1346 flow [2023-08-04 02:20:54,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 192 transitions, 1298 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-08-04 02:20:54,736 INFO L231 Difference]: Finished difference. Result has 119 places, 129 transitions, 944 flow [2023-08-04 02:20:54,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1325, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=944, PETRI_PLACES=119, PETRI_TRANSITIONS=129} [2023-08-04 02:20:54,737 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2023-08-04 02:20:54,737 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 944 flow [2023-08-04 02:20:54,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 457.03333333333336) internal successors, (13711), 30 states have internal predecessors, (13711), 0 states have call successors, (0), 0 states have 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:20:54,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:20:54,738 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:20:54,751 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:20:54,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:20:54,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:20:54,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:20:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1975651938, now seen corresponding path program 1 times [2023-08-04 02:20:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:20:54,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390017238] [2023-08-04 02:20:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:20:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:20:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:21:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-08-04 02:21:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:21:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390017238] [2023-08-04 02:21:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390017238] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:21:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892255456] [2023-08-04 02:21:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:21:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:21:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:21:16,418 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:21:16,419 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:21:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:21:17,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-04 02:21:17,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:21:22,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:22,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:22,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:22,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:22,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:22,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:22,975 INFO L322 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-08-04 02:21:22,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 554 treesize of output 479 [2023-08-04 02:21:24,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:24,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:24,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:24,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:24,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:24,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:21:24,153 INFO L322 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-08-04 02:21:24,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 554 treesize of output 479 [2023-08-04 02:21:28,547 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:21:28,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1656 treesize of output 1314 [2023-08-04 02:21:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-08-04 02:21:55,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:22:05,450 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (+ c_~result_8~0 1) 0)) (.cse1 (<= 1 c_~result_8~0)) (.cse13 (+ c_~count_occurrences_of_2~0.offset 12)) (.cse5 (+ c_~index_of_0~0.offset 16)) (.cse17 (+ c_~index_of_4~0.offset 8)) (.cse15 (+ c_~index_of_0~0.offset 8)) (.cse12 (+ 12 c_~count_occurrences_of_6~0.offset)) (.cse6 (+ c_~index_of_4~0.offset 16)) (.cse30 (+ c_~last_index_of_3~0.offset 12)) (.cse29 (+ 12 c_~last_index_of_7~0.offset))) (and (or .cse0 (and (or .cse1 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse2 (select (select .cse4 c_~index_of_4~0.base) .cse6)) (.cse3 (select (select .cse4 c_~index_of_0~0.base) .cse5))) (or (= .cse2 .cse3) (< (+ 2147483647 .cse3) .cse2) (< (+ .cse2 2147483648) .cse3)))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse7 (select (select .cse9 c_~index_of_4~0.base) .cse6)) (.cse8 (select (select .cse9 c_~index_of_0~0.base) .cse5))) (or (= .cse7 .cse8) (< (+ 2147483647 .cse8) .cse7) (<= (+ .cse7 1) .cse8))))))) (or .cse0 (and (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse11 (select (select .cse10 c_~count_occurrences_of_2~0.base) .cse13))) (or (not (= (+ (select (select .cse10 c_~index_of_0~0.base) .cse5) 1) 0)) (= .cse11 1) (<= (select (select .cse10 c_~count_occurrences_of_6~0.base) .cse12) 1) (not (= (+ (select (select .cse10 c_~index_of_4~0.base) .cse6) 1) 0)) (< 1 .cse11))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse14 (select .cse18 c_~index_of_0~0.base)) (.cse16 (select .cse18 c_~index_of_4~0.base))) (or (not (= (+ (select .cse14 .cse5) 1) 0)) (not (= (+ (select .cse14 .cse15) 1) 0)) (= (+ (select .cse16 .cse17) 1) 0) (not (= (select (select .cse18 c_~count_occurrences_of_6~0.base) .cse12) 1)) (not (= (+ (select .cse16 .cse6) 1) 0)) (< 1 (select (select .cse18 c_~count_occurrences_of_2~0.base) .cse13)))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse19 (select .cse20 c_~index_of_0~0.base))) (or (not (= (+ (select .cse19 .cse5) 1) 0)) (not (= (+ (select .cse19 .cse15) 1) 0)) (<= (select (select .cse20 c_~count_occurrences_of_6~0.base) .cse12) 1) (not (= (+ (select (select .cse20 c_~index_of_4~0.base) .cse6) 1) 0)) (< 1 (select (select .cse20 c_~count_occurrences_of_2~0.base) .cse13)))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse23 (select .cse21 c_~index_of_4~0.base)) (.cse22 (select (select .cse21 c_~count_occurrences_of_2~0.base) .cse13))) (or (not (= (+ (select (select .cse21 c_~index_of_0~0.base) .cse5) 1) 0)) (= .cse22 1) (= (+ (select .cse23 .cse17) 1) 0) (not (= (select (select .cse21 c_~count_occurrences_of_6~0.base) .cse12) 1)) (not (= (+ (select .cse23 .cse6) 1) 0)) (< 1 .cse22))))))) (or .cse1 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse25 (select .cse24 c_~index_of_0~0.base)) (.cse28 (select (select .cse24 c_~last_index_of_3~0.base) .cse30)) (.cse27 (select (select .cse24 c_~last_index_of_7~0.base) .cse29)) (.cse26 (select .cse24 c_~index_of_4~0.base))) (or (not (= (select (select .cse24 c_~count_occurrences_of_2~0.base) .cse13) 1)) (not (= (+ (select .cse25 .cse5) 1) 0)) (= (+ (select .cse26 .cse17) 1) 0) (< (+ 2147483648 .cse27) .cse28) (= (+ (select .cse25 .cse15) 1) 0) (not (= (select (select .cse24 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse27 .cse28) (<= (+ 1 .cse28) .cse27) (not (= (+ (select .cse26 .cse6) 1) 0))))))) (or (and (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse32 (select (select .cse31 c_~count_occurrences_of_6~0.base) .cse12))) (or (<= (select (select .cse31 c_~count_occurrences_of_2~0.base) .cse13) 1) (not (= (+ (select (select .cse31 c_~index_of_0~0.base) .cse5) 1) 0)) (< 1 .cse32) (not (= (+ (select (select .cse31 c_~index_of_4~0.base) .cse6) 1) 0)) (= .cse32 1))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse34 (select .cse33 c_~index_of_4~0.base))) (or (<= (select (select .cse33 c_~count_occurrences_of_2~0.base) .cse13) 1) (not (= (+ (select (select .cse33 c_~index_of_0~0.base) .cse5) 1) 0)) (< 1 (select (select .cse33 c_~count_occurrences_of_6~0.base) .cse12)) (not (= (+ (select .cse34 .cse17) 1) 0)) (not (= (+ (select .cse34 .cse6) 1) 0)))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse36 (select .cse35 c_~index_of_0~0.base)) (.cse37 (select .cse35 c_~index_of_4~0.base))) (or (not (= (select (select .cse35 c_~count_occurrences_of_2~0.base) .cse13) 1)) (not (= (+ (select .cse36 .cse5) 1) 0)) (< 1 (select (select .cse35 c_~count_occurrences_of_6~0.base) .cse12)) (not (= (+ (select .cse37 .cse17) 1) 0)) (= (+ (select .cse36 .cse15) 1) 0) (not (= (+ (select .cse37 .cse6) 1) 0)))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse39 (select .cse38 c_~index_of_0~0.base)) (.cse40 (select (select .cse38 c_~count_occurrences_of_6~0.base) .cse12))) (or (not (= (select (select .cse38 c_~count_occurrences_of_2~0.base) .cse13) 1)) (not (= (+ (select .cse39 .cse5) 1) 0)) (< 1 .cse40) (= (+ (select .cse39 .cse15) 1) 0) (not (= (+ (select (select .cse38 c_~index_of_4~0.base) .cse6) 1) 0)) (= .cse40 1)))))) .cse1) (or (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse42 (select (select .cse43 c_~index_of_4~0.base) .cse6)) (.cse41 (select (select .cse43 c_~index_of_0~0.base) .cse5))) (or (<= (+ .cse41 1) .cse42) (= .cse42 .cse41) (< (+ .cse42 2147483648) .cse41))))) .cse1) (or .cse1 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse47 (select (select .cse44 c_~last_index_of_3~0.base) .cse30)) (.cse46 (select (select .cse44 c_~last_index_of_7~0.base) .cse29)) (.cse45 (select .cse44 c_~index_of_4~0.base))) (or (<= (select (select .cse44 c_~count_occurrences_of_2~0.base) .cse13) 1) (not (= (+ (select (select .cse44 c_~index_of_0~0.base) .cse5) 1) 0)) (= (+ (select .cse45 .cse17) 1) 0) (< (+ 2147483648 .cse46) .cse47) (not (= (select (select .cse44 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse46 .cse47) (<= (+ 1 .cse47) .cse46) (not (= (+ (select .cse45 .cse6) 1) 0))))))) (or .cse1 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse49 (select .cse48 c_~index_of_0~0.base)) (.cse51 (select (select .cse48 c_~last_index_of_3~0.base) .cse30)) (.cse50 (select (select .cse48 c_~last_index_of_7~0.base) .cse29))) (or (not (= (select (select .cse48 c_~count_occurrences_of_2~0.base) .cse13) 1)) (not (= (+ (select .cse49 .cse5) 1) 0)) (< (+ 2147483648 .cse50) .cse51) (= (+ (select .cse49 .cse15) 1) 0) (<= (select (select .cse48 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse50 .cse51) (<= (+ 1 .cse51) .cse50) (not (= (+ (select (select .cse48 c_~index_of_4~0.base) .cse6) 1) 0))))))) (or (and (<= 0 c_~result_8~0) (<= c_~result_8~0 0)) (and (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse54 (select (select .cse52 c_~count_occurrences_of_2~0.base) .cse13)) (.cse53 (select (select .cse52 c_~count_occurrences_of_6~0.base) .cse12))) (or (not (= (+ (select (select .cse52 c_~index_of_0~0.base) .cse5) 1) 0)) (< 1 .cse53) (= .cse54 1) (not (= (+ (select (select .cse52 c_~index_of_4~0.base) .cse6) 1) 0)) (< 1 .cse54) (= .cse53 1))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse55 (select .cse57 c_~index_of_0~0.base)) (.cse56 (select (select .cse57 c_~count_occurrences_of_6~0.base) .cse12))) (or (not (= (+ (select .cse55 .cse5) 1) 0)) (< 1 .cse56) (not (= (+ (select .cse55 .cse15) 1) 0)) (not (= (+ (select (select .cse57 c_~index_of_4~0.base) .cse6) 1) 0)) (< 1 (select (select .cse57 c_~count_occurrences_of_2~0.base) .cse13)) (= .cse56 1))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse60 (select .cse58 c_~index_of_4~0.base)) (.cse59 (select (select .cse58 c_~count_occurrences_of_2~0.base) .cse13))) (or (not (= (+ (select (select .cse58 c_~index_of_0~0.base) .cse5) 1) 0)) (< 1 (select (select .cse58 c_~count_occurrences_of_6~0.base) .cse12)) (= .cse59 1) (not (= (+ (select .cse60 .cse17) 1) 0)) (not (= (+ (select .cse60 .cse6) 1) 0)) (< 1 .cse59))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse61 (select .cse62 c_~index_of_0~0.base)) (.cse63 (select .cse62 c_~index_of_4~0.base))) (or (not (= (+ (select .cse61 .cse5) 1) 0)) (< 1 (select (select .cse62 c_~count_occurrences_of_6~0.base) .cse12)) (not (= (+ (select .cse61 .cse15) 1) 0)) (not (= (+ (select .cse63 .cse17) 1) 0)) (not (= (+ (select .cse63 .cse6) 1) 0)) (< 1 (select (select .cse62 c_~count_occurrences_of_2~0.base) .cse13)))))))) (or (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse66 (select (select .cse64 c_~last_index_of_3~0.base) .cse30)) (.cse65 (select (select .cse64 c_~last_index_of_7~0.base) .cse29))) (or (<= (select (select .cse64 c_~count_occurrences_of_2~0.base) .cse13) 1) (not (= (+ (select (select .cse64 c_~index_of_0~0.base) .cse5) 1) 0)) (< (+ 2147483648 .cse65) .cse66) (<= (select (select .cse64 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse65 .cse66) (<= (+ 1 .cse66) .cse65) (not (= (+ (select (select .cse64 c_~index_of_4~0.base) .cse6) 1) 0)))))) .cse1) (or .cse0 (and (or (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse69 (select (select .cse67 c_~last_index_of_7~0.base) .cse29)) (.cse68 (select (select .cse67 c_~last_index_of_3~0.base) .cse30))) (or (<= (select (select .cse67 c_~count_occurrences_of_2~0.base) .cse13) 1) (< (+ 2147483647 .cse68) .cse69) (not (= (+ (select (select .cse67 c_~index_of_0~0.base) .cse5) 1) 0)) (< (+ 2147483648 .cse69) .cse68) (<= (select (select .cse67 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse69 .cse68) (not (= (+ (select (select .cse67 c_~index_of_4~0.base) .cse6) 1) 0)))))) .cse1) (or .cse1 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse72 (select (select .cse70 c_~last_index_of_7~0.base) .cse29)) (.cse71 (select (select .cse70 c_~last_index_of_3~0.base) .cse30)) (.cse73 (select .cse70 c_~index_of_4~0.base))) (or (<= (select (select .cse70 c_~count_occurrences_of_2~0.base) .cse13) 1) (< (+ 2147483647 .cse71) .cse72) (not (= (+ (select (select .cse70 c_~index_of_0~0.base) .cse5) 1) 0)) (= (+ (select .cse73 .cse17) 1) 0) (< (+ 2147483648 .cse72) .cse71) (not (= (select (select .cse70 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse72 .cse71) (not (= (+ (select .cse73 .cse6) 1) 0))))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse77 (select .cse74 c_~index_of_4~0.base)) (.cse76 (select (select .cse74 c_~last_index_of_7~0.base) .cse29)) (.cse75 (select (select .cse74 c_~last_index_of_3~0.base) .cse30))) (or (<= (select (select .cse74 c_~count_occurrences_of_2~0.base) .cse13) 1) (< (+ 2147483647 .cse75) .cse76) (not (= (+ (select (select .cse74 c_~index_of_0~0.base) .cse5) 1) 0)) (= (+ (select .cse77 .cse17) 1) 0) (not (= (select (select .cse74 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse76 .cse75) (not (= (+ (select .cse77 .cse6) 1) 0)) (<= (+ .cse76 1) .cse75))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse80 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse81 (select .cse80 c_~index_of_0~0.base)) (.cse79 (select (select .cse80 c_~last_index_of_7~0.base) .cse29)) (.cse78 (select (select .cse80 c_~last_index_of_3~0.base) .cse30))) (or (< (+ 2147483647 .cse78) .cse79) (not (= (select (select .cse80 c_~count_occurrences_of_2~0.base) .cse13) 1)) (not (= (+ (select .cse81 .cse5) 1) 0)) (= (+ (select .cse81 .cse15) 1) 0) (<= (select (select .cse80 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse79 .cse78) (not (= (+ (select (select .cse80 c_~index_of_4~0.base) .cse6) 1) 0)) (<= (+ .cse79 1) .cse78))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse84 (select (select .cse82 c_~last_index_of_7~0.base) .cse29)) (.cse83 (select (select .cse82 c_~last_index_of_3~0.base) .cse30))) (or (<= (select (select .cse82 c_~count_occurrences_of_2~0.base) .cse13) 1) (< (+ 2147483647 .cse83) .cse84) (not (= (+ (select (select .cse82 c_~index_of_0~0.base) .cse5) 1) 0)) (<= (select (select .cse82 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse84 .cse83) (not (= (+ (select (select .cse82 c_~index_of_4~0.base) .cse6) 1) 0)) (<= (+ .cse84 1) .cse83))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse88 (select .cse87 c_~index_of_0~0.base)) (.cse89 (select .cse87 c_~index_of_4~0.base)) (.cse86 (select (select .cse87 c_~last_index_of_7~0.base) .cse29)) (.cse85 (select (select .cse87 c_~last_index_of_3~0.base) .cse30))) (or (< (+ 2147483647 .cse85) .cse86) (not (= (select (select .cse87 c_~count_occurrences_of_2~0.base) .cse13) 1)) (not (= (+ (select .cse88 .cse5) 1) 0)) (= (+ (select .cse89 .cse17) 1) 0) (= (+ (select .cse88 .cse15) 1) 0) (not (= (select (select .cse87 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse86 .cse85) (not (= (+ (select .cse89 .cse6) 1) 0)) (<= (+ .cse86 1) .cse85))))) (or (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse93 (select .cse92 c_~index_of_0~0.base)) (.cse91 (select (select .cse92 c_~last_index_of_7~0.base) .cse29)) (.cse90 (select (select .cse92 c_~last_index_of_3~0.base) .cse30))) (or (< (+ 2147483647 .cse90) .cse91) (not (= (select (select .cse92 c_~count_occurrences_of_2~0.base) .cse13) 1)) (not (= (+ (select .cse93 .cse5) 1) 0)) (< (+ 2147483648 .cse91) .cse90) (= (+ (select .cse93 .cse15) 1) 0) (<= (select (select .cse92 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse91 .cse90) (not (= (+ (select (select .cse92 c_~index_of_4~0.base) .cse6) 1) 0)))))) .cse1) (or .cse1 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse96 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse97 (select .cse96 c_~index_of_0~0.base)) (.cse95 (select (select .cse96 c_~last_index_of_7~0.base) .cse29)) (.cse94 (select (select .cse96 c_~last_index_of_3~0.base) .cse30)) (.cse98 (select .cse96 c_~index_of_4~0.base))) (or (< (+ 2147483647 .cse94) .cse95) (not (= (select (select .cse96 c_~count_occurrences_of_2~0.base) .cse13) 1)) (not (= (+ (select .cse97 .cse5) 1) 0)) (= (+ (select .cse98 .cse17) 1) 0) (< (+ 2147483648 .cse95) .cse94) (= (+ (select .cse97 .cse15) 1) 0) (not (= (select (select .cse96 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse95 .cse94) (not (= (+ (select .cse98 .cse6) 1) 0))))))))))) is different from false [2023-08-04 02:22:16,790 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse111 (select |c_#memory_int| c_~index_of_4~0.base)) (.cse13 (+ c_~index_of_4~0.offset 16)) (.cse110 (select |c_#memory_int| c_~index_of_0~0.base)) (.cse11 (+ c_~index_of_0~0.offset 16)) (.cse12 (+ 12 c_~count_occurrences_of_6~0.offset)) (.cse8 (+ c_~count_occurrences_of_2~0.offset 12))) (let ((.cse73 (select (select |c_#memory_int| c_~count_occurrences_of_2~0.base) .cse8)) (.cse70 (select (select |c_#memory_int| c_~count_occurrences_of_6~0.base) .cse12)) (.cse14 (+ c_~last_index_of_3~0.offset 12)) (.cse15 (+ 12 c_~last_index_of_7~0.offset)) (.cse21 (+ c_~index_of_0~0.offset 8)) (.cse35 (+ c_~index_of_4~0.offset 8)) (.cse61 (select .cse110 .cse11)) (.cse63 (select .cse111 .cse13))) (let ((.cse60 (+ 1 .cse63)) (.cse62 (+ .cse61 1)) (.cse23 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse146 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse147 (select (select .cse146 c_~count_occurrences_of_2~0.base) .cse8))) (or (not (= (+ (select (select .cse146 c_~index_of_0~0.base) .cse11) 1) 0)) (= .cse147 1) (<= (select (select .cse146 c_~count_occurrences_of_6~0.base) .cse12) 1) (not (= (+ (select (select .cse146 c_~index_of_4~0.base) .cse13) 1) 0)) (< 1 .cse147)))))) (.cse24 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse145 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse143 (select .cse145 c_~index_of_0~0.base)) (.cse144 (select .cse145 c_~index_of_4~0.base))) (or (not (= (+ (select .cse143 .cse11) 1) 0)) (not (= (+ (select .cse143 .cse21) 1) 0)) (= (+ (select .cse144 .cse35) 1) 0) (not (= (select (select .cse145 c_~count_occurrences_of_6~0.base) .cse12) 1)) (not (= (+ (select .cse144 .cse13) 1) 0)) (< 1 (select (select .cse145 c_~count_occurrences_of_2~0.base) .cse8))))))) (.cse44 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse142 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse141 (select .cse142 c_~index_of_0~0.base))) (or (not (= (+ (select .cse141 .cse11) 1) 0)) (not (= (+ (select .cse141 .cse21) 1) 0)) (<= (select (select .cse142 c_~count_occurrences_of_6~0.base) .cse12) 1) (not (= (+ (select (select .cse142 c_~index_of_4~0.base) .cse13) 1) 0)) (< 1 (select (select .cse142 c_~count_occurrences_of_2~0.base) .cse8))))))) (.cse47 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse138 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse140 (select .cse138 c_~index_of_4~0.base)) (.cse139 (select (select .cse138 c_~count_occurrences_of_2~0.base) .cse8))) (or (not (= (+ (select (select .cse138 c_~index_of_0~0.base) .cse11) 1) 0)) (= .cse139 1) (= (+ (select .cse140 .cse35) 1) 0) (not (= (select (select .cse138 c_~count_occurrences_of_6~0.base) .cse12) 1)) (not (= (+ (select .cse140 .cse13) 1) 0)) (< 1 .cse139)))))) (.cse16 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse136 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse137 (select (select .cse136 c_~count_occurrences_of_6~0.base) .cse12))) (or (<= (select (select .cse136 c_~count_occurrences_of_2~0.base) .cse8) 1) (not (= (+ (select (select .cse136 c_~index_of_0~0.base) .cse11) 1) 0)) (< 1 .cse137) (not (= (+ (select (select .cse136 c_~index_of_4~0.base) .cse13) 1) 0)) (= .cse137 1)))))) (.cse41 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse134 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse135 (select .cse134 c_~index_of_4~0.base))) (or (<= (select (select .cse134 c_~count_occurrences_of_2~0.base) .cse8) 1) (not (= (+ (select (select .cse134 c_~index_of_0~0.base) .cse11) 1) 0)) (< 1 (select (select .cse134 c_~count_occurrences_of_6~0.base) .cse12)) (not (= (+ (select .cse135 .cse35) 1) 0)) (not (= (+ (select .cse135 .cse13) 1) 0))))))) (.cse42 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse131 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse132 (select .cse131 c_~index_of_0~0.base)) (.cse133 (select .cse131 c_~index_of_4~0.base))) (or (not (= (select (select .cse131 c_~count_occurrences_of_2~0.base) .cse8) 1)) (not (= (+ (select .cse132 .cse11) 1) 0)) (< 1 (select (select .cse131 c_~count_occurrences_of_6~0.base) .cse12)) (not (= (+ (select .cse133 .cse35) 1) 0)) (= (+ (select .cse132 .cse21) 1) 0) (not (= (+ (select .cse133 .cse13) 1) 0))))))) (.cse48 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse129 (select .cse128 c_~index_of_0~0.base)) (.cse130 (select (select .cse128 c_~count_occurrences_of_6~0.base) .cse12))) (or (not (= (select (select .cse128 c_~count_occurrences_of_2~0.base) .cse8) 1)) (not (= (+ (select .cse129 .cse11) 1) 0)) (< 1 .cse130) (= (+ (select .cse129 .cse21) 1) 0) (not (= (+ (select (select .cse128 c_~index_of_4~0.base) .cse13) 1) 0)) (= .cse130 1)))))) (.cse25 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse124 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse127 (select .cse124 c_~index_of_4~0.base)) (.cse126 (select (select .cse124 c_~last_index_of_7~0.base) .cse15)) (.cse125 (select (select .cse124 c_~last_index_of_3~0.base) .cse14))) (or (<= (select (select .cse124 c_~count_occurrences_of_2~0.base) .cse8) 1) (< (+ 2147483647 .cse125) .cse126) (not (= (+ (select (select .cse124 c_~index_of_0~0.base) .cse11) 1) 0)) (= (+ (select .cse127 .cse35) 1) 0) (not (= (select (select .cse124 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse126 .cse125) (not (= (+ (select .cse127 .cse13) 1) 0)) (<= (+ .cse126 1) .cse125)))))) (.cse26 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse122 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse123 (select .cse122 c_~index_of_0~0.base)) (.cse121 (select (select .cse122 c_~last_index_of_7~0.base) .cse15)) (.cse120 (select (select .cse122 c_~last_index_of_3~0.base) .cse14))) (or (< (+ 2147483647 .cse120) .cse121) (not (= (select (select .cse122 c_~count_occurrences_of_2~0.base) .cse8) 1)) (not (= (+ (select .cse123 .cse11) 1) 0)) (= (+ (select .cse123 .cse21) 1) 0) (<= (select (select .cse122 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse121 .cse120) (not (= (+ (select (select .cse122 c_~index_of_4~0.base) .cse13) 1) 0)) (<= (+ .cse121 1) .cse120)))))) (.cse43 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse117 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse119 (select (select .cse117 c_~last_index_of_7~0.base) .cse15)) (.cse118 (select (select .cse117 c_~last_index_of_3~0.base) .cse14))) (or (<= (select (select .cse117 c_~count_occurrences_of_2~0.base) .cse8) 1) (< (+ 2147483647 .cse118) .cse119) (not (= (+ (select (select .cse117 c_~index_of_0~0.base) .cse11) 1) 0)) (<= (select (select .cse117 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse119 .cse118) (not (= (+ (select (select .cse117 c_~index_of_4~0.base) .cse13) 1) 0)) (<= (+ .cse119 1) .cse118)))))) (.cse46 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse114 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse115 (select .cse114 c_~index_of_0~0.base)) (.cse116 (select .cse114 c_~index_of_4~0.base)) (.cse113 (select (select .cse114 c_~last_index_of_7~0.base) .cse15)) (.cse112 (select (select .cse114 c_~last_index_of_3~0.base) .cse14))) (or (< (+ 2147483647 .cse112) .cse113) (not (= (select (select .cse114 c_~count_occurrences_of_2~0.base) .cse8) 1)) (not (= (+ (select .cse115 .cse11) 1) 0)) (= (+ (select .cse116 .cse35) 1) 0) (= (+ (select .cse115 .cse21) 1) 0) (not (= (select (select .cse114 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse113 .cse112) (not (= (+ (select .cse116 .cse13) 1) 0)) (<= (+ .cse113 1) .cse112)))))) (.cse71 (= .cse70 1)) (.cse72 (= (+ (select .cse111 .cse35) 1) 0)) (.cse75 (= .cse73 1)) (.cse74 (= (+ (select .cse110 .cse21) 1) 0))) (let ((.cse0 (< 1 .cse73)) (.cse1 (and .cse75 (not .cse74))) (.cse3 (< 1 .cse70)) (.cse4 (and .cse71 (not .cse72))) (.cse56 (and .cse25 .cse26 .cse43 .cse46)) (.cse58 (and .cse16 .cse41 .cse42 .cse48)) (.cse22 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse107 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse109 (select (select .cse107 c_~last_index_of_3~0.base) .cse14)) (.cse108 (select (select .cse107 c_~last_index_of_7~0.base) .cse15))) (or (<= (select (select .cse107 c_~count_occurrences_of_2~0.base) .cse8) 1) (not (= (+ (select (select .cse107 c_~index_of_0~0.base) .cse11) 1) 0)) (< (+ 2147483648 .cse108) .cse109) (<= (select (select .cse107 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse108 .cse109) (<= (+ 1 .cse109) .cse108) (not (= (+ (select (select .cse107 c_~index_of_4~0.base) .cse13) 1) 0))))))) (.cse51 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse104 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse106 (select (select .cse104 c_~count_occurrences_of_2~0.base) .cse8)) (.cse105 (select (select .cse104 c_~count_occurrences_of_6~0.base) .cse12))) (or (not (= (+ (select (select .cse104 c_~index_of_0~0.base) .cse11) 1) 0)) (< 1 .cse105) (= .cse106 1) (not (= (+ (select (select .cse104 c_~index_of_4~0.base) .cse13) 1) 0)) (< 1 .cse106) (= .cse105 1)))))) (.cse45 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse101 (select (select .cse103 c_~index_of_4~0.base) .cse13)) (.cse102 (select (select .cse103 c_~index_of_0~0.base) .cse11))) (or (= .cse101 .cse102) (< (+ 2147483647 .cse102) .cse101) (<= (+ .cse101 1) .cse102)))))) (.cse52 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse100 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse98 (select .cse100 c_~index_of_0~0.base)) (.cse99 (select (select .cse100 c_~count_occurrences_of_6~0.base) .cse12))) (or (not (= (+ (select .cse98 .cse11) 1) 0)) (< 1 .cse99) (not (= (+ (select .cse98 .cse21) 1) 0)) (not (= (+ (select (select .cse100 c_~index_of_4~0.base) .cse13) 1) 0)) (< 1 (select (select .cse100 c_~count_occurrences_of_2~0.base) .cse8)) (= .cse99 1)))))) (.cse36 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse97 (select (select .cse94 c_~last_index_of_3~0.base) .cse14)) (.cse96 (select (select .cse94 c_~last_index_of_7~0.base) .cse15)) (.cse95 (select .cse94 c_~index_of_4~0.base))) (or (<= (select (select .cse94 c_~count_occurrences_of_2~0.base) .cse8) 1) (not (= (+ (select (select .cse94 c_~index_of_0~0.base) .cse11) 1) 0)) (= (+ (select .cse95 .cse35) 1) 0) (< (+ 2147483648 .cse96) .cse97) (not (= (select (select .cse94 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse96 .cse97) (<= (+ 1 .cse97) .cse96) (not (= (+ (select .cse95 .cse13) 1) 0))))))) (.cse49 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse90 (select .cse89 c_~index_of_0~0.base)) (.cse93 (select (select .cse89 c_~last_index_of_3~0.base) .cse14)) (.cse92 (select (select .cse89 c_~last_index_of_7~0.base) .cse15)) (.cse91 (select .cse89 c_~index_of_4~0.base))) (or (not (= (select (select .cse89 c_~count_occurrences_of_2~0.base) .cse8) 1)) (not (= (+ (select .cse90 .cse11) 1) 0)) (= (+ (select .cse91 .cse35) 1) 0) (< (+ 2147483648 .cse92) .cse93) (= (+ (select .cse90 .cse21) 1) 0) (not (= (select (select .cse89 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse92 .cse93) (<= (+ 1 .cse93) .cse92) (not (= (+ (select .cse91 .cse13) 1) 0))))))) (.cse6 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse88 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse87 (select (select .cse88 c_~index_of_4~0.base) .cse13)) (.cse86 (select (select .cse88 c_~index_of_0~0.base) .cse11))) (or (<= (+ .cse86 1) .cse87) (= .cse87 .cse86) (< (+ .cse87 2147483648) .cse86)))))) (.cse55 (and .cse23 .cse24 .cse44 .cse47)) (.cse50 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse83 (select .cse82 c_~index_of_0~0.base)) (.cse85 (select (select .cse82 c_~last_index_of_3~0.base) .cse14)) (.cse84 (select (select .cse82 c_~last_index_of_7~0.base) .cse15))) (or (not (= (select (select .cse82 c_~count_occurrences_of_2~0.base) .cse8) 1)) (not (= (+ (select .cse83 .cse11) 1) 0)) (< (+ 2147483648 .cse84) .cse85) (= (+ (select .cse83 .cse21) 1) 0) (<= (select (select .cse82 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse84 .cse85) (<= (+ 1 .cse85) .cse84) (not (= (+ (select (select .cse82 c_~index_of_4~0.base) .cse13) 1) 0))))))) (.cse57 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse81 (select .cse79 c_~index_of_4~0.base)) (.cse80 (select (select .cse79 c_~count_occurrences_of_2~0.base) .cse8))) (or (not (= (+ (select (select .cse79 c_~index_of_0~0.base) .cse11) 1) 0)) (< 1 (select (select .cse79 c_~count_occurrences_of_6~0.base) .cse12)) (= .cse80 1) (not (= (+ (select .cse81 .cse35) 1) 0)) (not (= (+ (select .cse81 .cse13) 1) 0)) (< 1 .cse80)))))) (.cse59 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse76 (select .cse77 c_~index_of_0~0.base)) (.cse78 (select .cse77 c_~index_of_4~0.base))) (or (not (= (+ (select .cse76 .cse11) 1) 0)) (< 1 (select (select .cse77 c_~count_occurrences_of_6~0.base) .cse12)) (not (= (+ (select .cse76 .cse21) 1) 0)) (not (= (+ (select .cse78 .cse35) 1) 0)) (not (= (+ (select .cse78 .cse13) 1) 0)) (< 1 (select (select .cse77 c_~count_occurrences_of_2~0.base) .cse8))))))) (.cse2 (not (= .cse62 0))) (.cse65 (and (<= .cse73 1) (or .cse74 (not .cse75)))) (.cse5 (not (= .cse60 0))) (.cse64 (and (<= .cse70 1) (or (not .cse71) .cse72)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse10 (select (select .cse7 c_~last_index_of_7~0.base) .cse15)) (.cse9 (select (select .cse7 c_~last_index_of_3~0.base) .cse14))) (or (<= (select (select .cse7 c_~count_occurrences_of_2~0.base) .cse8) 1) (< (+ 2147483647 .cse9) .cse10) (not (= (+ (select (select .cse7 c_~index_of_0~0.base) .cse11) 1) 0)) (< (+ 2147483648 .cse10) .cse9) (<= (select (select .cse7 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse10 .cse9) (not (= (+ (select (select .cse7 c_~index_of_4~0.base) .cse13) 1) 0)))))) .cse16 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse20 (select .cse19 c_~index_of_0~0.base)) (.cse18 (select (select .cse19 c_~last_index_of_7~0.base) .cse15)) (.cse17 (select (select .cse19 c_~last_index_of_3~0.base) .cse14))) (or (< (+ 2147483647 .cse17) .cse18) (not (= (select (select .cse19 c_~count_occurrences_of_2~0.base) .cse8) 1)) (not (= (+ (select .cse20 .cse11) 1) 0)) (< (+ 2147483648 .cse18) .cse17) (= (+ (select .cse20 .cse21) 1) 0) (<= (select (select .cse19 c_~count_occurrences_of_6~0.base) .cse12) 1) (= .cse18 .cse17) (not (= (+ (select (select .cse19 c_~index_of_4~0.base) .cse13) 1) 0)))))) .cse22 .cse23 .cse24 .cse25 .cse26 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse27 (select (select .cse29 c_~index_of_4~0.base) .cse13)) (.cse28 (select (select .cse29 c_~index_of_0~0.base) .cse11))) (or (= .cse27 .cse28) (< (+ 2147483647 .cse28) .cse27) (< (+ .cse27 2147483648) .cse28))))) (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse33 (select .cse32 c_~index_of_0~0.base)) (.cse31 (select (select .cse32 c_~last_index_of_7~0.base) .cse15)) (.cse30 (select (select .cse32 c_~last_index_of_3~0.base) .cse14)) (.cse34 (select .cse32 c_~index_of_4~0.base))) (or (< (+ 2147483647 .cse30) .cse31) (not (= (select (select .cse32 c_~count_occurrences_of_2~0.base) .cse8) 1)) (not (= (+ (select .cse33 .cse11) 1) 0)) (= (+ (select .cse34 .cse35) 1) 0) (< (+ 2147483648 .cse31) .cse30) (= (+ (select .cse33 .cse21) 1) 0) (not (= (select (select .cse32 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse31 .cse30) (not (= (+ (select .cse34 .cse13) 1) 0)))))) .cse36 (forall ((v_ArrVal_3564 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3564))) (let ((.cse39 (select (select .cse37 c_~last_index_of_7~0.base) .cse15)) (.cse38 (select (select .cse37 c_~last_index_of_3~0.base) .cse14)) (.cse40 (select .cse37 c_~index_of_4~0.base))) (or (<= (select (select .cse37 c_~count_occurrences_of_2~0.base) .cse8) 1) (< (+ 2147483647 .cse38) .cse39) (not (= (+ (select (select .cse37 c_~index_of_0~0.base) .cse11) 1) 0)) (= (+ (select .cse40 .cse35) 1) 0) (< (+ 2147483648 .cse39) .cse38) (not (= (select (select .cse37 c_~count_occurrences_of_6~0.base) .cse12) 1)) (= .cse39 .cse38) (not (= (+ (select .cse40 .cse13) 1) 0)))))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50)) (or (let ((.cse54 (<= .cse62 .cse63)) (.cse53 (<= .cse60 .cse61))) (and .cse51 .cse52 (or .cse53 .cse49) (or .cse54 .cse55) (or .cse6 .cse53) (or .cse54 .cse56) (or .cse53 .cse50) (or .cse54 .cse45) .cse57 (or .cse53 .cse22) (or .cse53 .cse58) .cse59 (or .cse53 .cse36))) (< (+ 2147483647 .cse63) .cse61) (< (+ .cse61 2147483648) .cse63) (= .cse61 .cse63)) (or .cse0 .cse1 (and .cse6 .cse51 .cse16 .cse52 .cse22 .cse36 .cse41 .cse42 .cse57 .cse48 .cse49 .cse50 .cse59) .cse2 .cse5 .cse64) (or .cse2 .cse3 .cse4 (and .cse51 .cse52 .cse23 .cse24 .cse25 .cse26 .cse43 .cse57 .cse44 .cse45 .cse46 .cse47 .cse59) .cse65 .cse5) (let ((.cse69 (select (select |c_#memory_int| c_~last_index_of_3~0.base) .cse14)) (.cse68 (select (select |c_#memory_int| c_~last_index_of_7~0.base) .cse15))) (or (let ((.cse66 (<= (+ 1 .cse69) .cse68)) (.cse67 (<= (+ .cse68 1) .cse69))) (and (or .cse66 .cse56) (or .cse67 .cse58) (or .cse67 .cse22) .cse51 (or .cse66 .cse45) .cse52 (or .cse67 .cse36) (or .cse67 .cse49) (or .cse6 .cse67) (or .cse66 .cse55) (or .cse67 .cse50) .cse57 .cse59)) .cse2 (= .cse68 .cse69) (< (+ 2147483647 .cse68) .cse69) .cse65 .cse5 .cse64 (< (+ 2147483648 .cse69) .cse68)))))))) is different from false [2023-08-04 02:22:35,383 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:35,390 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 26487 treesize of output 20071 [2023-08-04 02:22:38,020 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:38,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 16855 treesize of output 17028 [2023-08-04 02:22:38,903 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:38,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 16783 treesize of output 16820 [2023-08-04 02:22:40,011 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:40,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 16763 treesize of output 16864 [2023-08-04 02:22:41,382 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:41,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 16739 treesize of output 16812 [2023-08-04 02:22:42,747 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:42,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 16675 treesize of output 16776 [2023-08-04 02:22:44,415 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:44,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 16651 treesize of output 16824 [2023-08-04 02:22:46,073 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:46,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 16579 treesize of output 16652 [2023-08-04 02:22:48,041 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:48,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 16515 treesize of output 16634 [2023-08-04 02:22:49,977 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:22:49,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 16447 treesize of output 16510 Received shutdown request... [2023-08-04 02:22:51,241 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 02:22:51,242 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 02:22:51,248 WARN L265 SmtUtils]: Removed 1 from assertion stack [2023-08-04 02:22:51,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 02:22:51,267 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 02:22:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-04 02:22:51,465 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 102 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-171-5-14-23-15-4-14-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-170-5-14-23-15-4-14-3-2-2-1 context. [2023-08-04 02:22:51,465 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:22:51,466 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (2/2) [2023-08-04 02:22:51,467 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 02:22:51,467 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 02:22:51,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 02:22:51 BasicIcfg [2023-08-04 02:22:51,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 02:22:51,470 INFO L158 Benchmark]: Toolchain (without parser) took 774228.73ms. Allocated memory was 369.1MB in the beginning and 5.6GB in the end (delta: 5.2GB). Free memory was 323.6MB in the beginning and 4.1GB in the end (delta: -3.8GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-08-04 02:22:51,470 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 369.1MB. Free memory is still 325.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 02:22:51,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.10ms. Allocated memory is still 369.1MB. Free memory was 323.3MB in the beginning and 302.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-04 02:22:51,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.52ms. Allocated memory is still 369.1MB. Free memory was 302.7MB in the beginning and 294.8MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2023-08-04 02:22:51,471 INFO L158 Benchmark]: Boogie Preprocessor took 57.07ms. Allocated memory is still 369.1MB. Free memory was 294.8MB in the beginning and 287.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2023-08-04 02:22:51,471 INFO L158 Benchmark]: RCFGBuilder took 2414.34ms. Allocated memory was 369.1MB in the beginning and 467.7MB in the end (delta: 98.6MB). Free memory was 287.2MB in the beginning and 381.7MB in the end (delta: -94.5MB). Peak memory consumption was 241.4MB. Max. memory is 16.0GB. [2023-08-04 02:22:51,471 INFO L158 Benchmark]: TraceAbstraction took 771368.59ms. Allocated memory was 467.7MB in the beginning and 5.6GB in the end (delta: 5.1GB). Free memory was 380.7MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-08-04 02:22:51,472 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 369.1MB. Free memory is still 325.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 317.10ms. Allocated memory is still 369.1MB. Free memory was 323.3MB in the beginning and 302.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.52ms. Allocated memory is still 369.1MB. Free memory was 302.7MB in the beginning and 294.8MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * Boogie Preprocessor took 57.07ms. Allocated memory is still 369.1MB. Free memory was 294.8MB in the beginning and 287.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * RCFGBuilder took 2414.34ms. Allocated memory was 369.1MB in the beginning and 467.7MB in the end (delta: 98.6MB). Free memory was 287.2MB in the beginning and 381.7MB in the end (delta: -94.5MB). Peak memory consumption was 241.4MB. Max. memory is 16.0GB. * TraceAbstraction took 771368.59ms. Allocated memory was 467.7MB in the beginning and 5.6GB in the end (delta: 5.1GB). Free memory was 380.7MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.3s, 429 PlacesBefore, 39 PlacesAfterwards, 485 TransitionsBefore, 54 TransitionsAfterwards, 18150 CoEnabledTransitionPairs, 7 FixpointIterations, 263 TrivialSequentialCompositions, 150 ConcurrentSequentialCompositions, 77 TrivialYvCompositions, 36 ConcurrentYvCompositions, 41 ChoiceCompositions, 567 TotalNumberOfCompositions, 20000 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18275, independent: 18218, independent conditional: 0, independent unconditional: 18218, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9671, independent: 9640, independent conditional: 0, independent unconditional: 9640, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18275, independent: 8578, independent conditional: 0, independent unconditional: 8578, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 9671, unknown conditional: 0, unknown unconditional: 9671] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.7s, 525 PlacesBefore, 53 PlacesAfterwards, 601 TransitionsBefore, 76 TransitionsAfterwards, 62700 CoEnabledTransitionPairs, 7 FixpointIterations, 267 TrivialSequentialCompositions, 252 ConcurrentSequentialCompositions, 77 TrivialYvCompositions, 67 ConcurrentYvCompositions, 53 ChoiceCompositions, 716 TotalNumberOfCompositions, 77338 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65675, independent: 65571, independent conditional: 0, independent unconditional: 65571, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 31477, independent: 31408, independent conditional: 0, independent unconditional: 31408, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 65675, independent: 34163, independent conditional: 0, independent unconditional: 34163, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 31477, unknown conditional: 0, unknown unconditional: 31477] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 314, Positive conditional cache size: 0, Positive unconditional cache size: 314, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.3s, 525 PlacesBefore, 53 PlacesAfterwards, 601 TransitionsBefore, 76 TransitionsAfterwards, 62700 CoEnabledTransitionPairs, 8 FixpointIterations, 266 TrivialSequentialCompositions, 259 ConcurrentSequentialCompositions, 79 TrivialYvCompositions, 67 ConcurrentYvCompositions, 53 ChoiceCompositions, 724 TotalNumberOfCompositions, 79055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67147, independent: 67037, independent conditional: 0, independent unconditional: 67037, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 31649, independent: 31581, independent conditional: 0, independent unconditional: 31581, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 67147, independent: 35456, independent conditional: 0, independent unconditional: 35456, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 31649, unknown conditional: 0, unknown unconditional: 31649] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 317, Positive conditional cache size: 0, Positive unconditional cache size: 317, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 235]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 102 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-171-5-14-23-15-4-14-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-170-5-14-23-15-4-14-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 517 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 63.9s, OverallIterations: 7, TraceHistogramMax: 13, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 50.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3576 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2856 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6174 IncrementalHoareTripleChecker+Invalid, 6611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 437 mSolverCounterUnsat, 104 mSDtfsCounter, 6174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 331 SyntacticMatches, 17 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 973 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2880 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 967/1280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 609 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 201.9s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 109.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 83.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3666 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2920 mSDsluCounter, 317 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 451 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7664 IncrementalHoareTripleChecker+Invalid, 8115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 451 mSolverCounterUnsat, 199 mSDtfsCounter, 7664 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 539 SyntacticMatches, 16 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=685occurred in iteration=8, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 823 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1019 ConstructedInterpolants, 0 QuantifiedInterpolants, 1479 SizeOfPredicates, 5 NumberOfNonLiveVariables, 4504 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 1928/2247 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 609 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 505.1s, OverallIterations: 10, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 286.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 90.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3776 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3173 mSDsluCounter, 746 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 512 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9429 IncrementalHoareTripleChecker+Invalid, 9859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 234 mSDtfsCounter, 9429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=944occurred in iteration=9, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 1271 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3742 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 1086/1301 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown