/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 TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:02:46,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:02:46,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:02:46,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:02:46,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:02:46,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:02:46,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:02:46,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:02:46,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:02:46,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:02:46,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:02:46,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:02:46,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:02:46,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:02:46,301 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:02:46,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:02:46,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:02:46,302 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:02:46,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:02:46,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:02:46,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:02:46,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:02:46,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:02:46,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:02:46,304 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:02:46,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:02:46,304 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:02:46,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:02:46,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:02:46,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:02:46,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:02:46,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:02:46,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:02:46,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:02:46,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:02:46,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:02:46,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:02:46,306 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:02:46,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:02:46,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:02:46,306 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:02:46,306 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 -> TOGETHER [2023-08-03 21:02:46,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:02:46,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:02:46,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:02:46,486 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:02:46,486 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:02:46,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c [2023-08-03 21:02:47,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:02:47,563 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:02:47,564 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c [2023-08-03 21:02:47,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbb24100/88238888f67148e5bc57072260df9cbd/FLAG098d01760 [2023-08-03 21:02:47,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbb24100/88238888f67148e5bc57072260df9cbd [2023-08-03 21:02:47,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:02:47,579 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:02:47,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:02:47,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:02:47,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:02:47,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41be9343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47, skipping insertion in model container [2023-08-03 21:02:47,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,602 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:02:47,703 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c[3149,3162] [2023-08-03 21:02:47,706 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:02:47,711 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:02:47,725 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c[3149,3162] [2023-08-03 21:02:47,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:02:47,732 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 21:02:47,732 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 21:02:47,736 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:02:47,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47 WrapperNode [2023-08-03 21:02:47,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:02:47,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:02:47,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:02:47,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:02:47,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,762 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 239 [2023-08-03 21:02:47,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:02:47,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:02:47,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:02:47,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:02:47,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:02:47,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:02:47,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:02:47,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:02:47,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (1/1) ... [2023-08-03 21:02:47,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:02:47,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:02:47,816 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-03 21:02:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:02:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 21:02:47,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 21:02:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 21:02:47,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 21:02:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:02:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:02:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:02:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 21:02:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 21:02:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-03 21:02:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:02:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:02:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:02:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:02:47,843 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 21:02:47,819 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-03 21:02:47,940 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:02:47,941 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:02:48,248 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:02:48,309 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:02:48,310 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-08-03 21:02:48,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:02:48 BoogieIcfgContainer [2023-08-03 21:02:48,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:02:48,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:02:48,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:02:48,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:02:48,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:02:47" (1/3) ... [2023-08-03 21:02:48,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eda5ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:02:48, skipping insertion in model container [2023-08-03 21:02:48,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:02:47" (2/3) ... [2023-08-03 21:02:48,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eda5ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:02:48, skipping insertion in model container [2023-08-03 21:02:48,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:02:48" (3/3) ... [2023-08-03 21:02:48,334 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-two-queue.wvr_bound2.c [2023-08-03 21:02:48,339 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:02:48,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:02:48,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 21:02:48,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:02:48,391 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-03 21:02:48,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 200 transitions, 422 flow [2023-08-03 21:02:48,533 INFO L124 PetriNetUnfolderBase]: 40/340 cut-off events. [2023-08-03 21:02:48,533 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 21:02:48,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 340 events. 40/340 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 877 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-03 21:02:48,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 200 transitions, 422 flow [2023-08-03 21:02:48,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 200 transitions, 422 flow [2023-08-03 21:02:48,544 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:02:48,554 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 200 transitions, 422 flow [2023-08-03 21:02:48,557 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 200 transitions, 422 flow [2023-08-03 21:02:48,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 200 transitions, 422 flow [2023-08-03 21:02:48,604 INFO L124 PetriNetUnfolderBase]: 40/340 cut-off events. [2023-08-03 21:02:48,604 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 21:02:48,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 340 events. 40/340 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 877 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-03 21:02:48,610 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-03 21:02:53,537 INFO L134 LiptonReduction]: Checked pairs total: 4895 [2023-08-03 21:02:53,538 INFO L136 LiptonReduction]: Total number of compositions: 195 [2023-08-03 21:02:53,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:02:53,550 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;@2e31ef99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:02:53,550 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:02:53,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:02:53,553 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2023-08-03 21:02:53,553 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:02:53,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:02:53,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:02:53,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:02:53,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:02:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1968411867, now seen corresponding path program 1 times [2023-08-03 21:02:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:02:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134662735] [2023-08-03 21:02:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:02:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:02:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:02:53,770 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-03 21:02:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:02:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134662735] [2023-08-03 21:02:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134662735] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:02:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:02:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:02:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483370503] [2023-08-03 21:02:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:02:53,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:02:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:02:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:02:53,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:02:53,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 395 [2023-08-03 21:02:53,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:02:53,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:02:53,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 395 [2023-08-03 21:02:53,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:02:53,900 INFO L124 PetriNetUnfolderBase]: 334/574 cut-off events. [2023-08-03 21:02:53,900 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-03 21:02:53,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 574 events. 334/574 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2205 event pairs, 105 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 976. Up to 543 conditions per place. [2023-08-03 21:02:53,904 INFO L140 encePairwiseOnDemand]: 391/395 looper letters, 34 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-03 21:02:53,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 174 flow [2023-08-03 21:02:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:02:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:02:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2023-08-03 21:02:53,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675105485232067 [2023-08-03 21:02:53,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2023-08-03 21:02:53,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2023-08-03 21:02:53,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:02:53,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2023-08-03 21:02:53,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:02:53,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:02:53,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:02:53,934 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 94 flow. Second operand 3 states and 554 transitions. [2023-08-03 21:02:53,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 174 flow [2023-08-03 21:02:53,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:02:53,939 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 100 flow [2023-08-03 21:02:53,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2023-08-03 21:02:53,946 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2023-08-03 21:02:53,946 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 100 flow [2023-08-03 21:02:53,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:02:53,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:02:53,947 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:02:53,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:02:53,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:02:53,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:02:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 947611101, now seen corresponding path program 1 times [2023-08-03 21:02:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:02:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864408573] [2023-08-03 21:02:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:02:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:02:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:02:53,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:02:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:02:54,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:02:54,028 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:02:54,029 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 21:02:54,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 21:02:54,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 21:02:54,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 21:02:54,031 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 21:02:54,033 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:02:54,033 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:02:54,060 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-03 21:02:54,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 226 transitions, 500 flow [2023-08-03 21:02:54,147 INFO L124 PetriNetUnfolderBase]: 141/915 cut-off events. [2023-08-03 21:02:54,147 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 21:02:54,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 915 events. 141/915 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4245 event pairs, 2 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 573. Up to 32 conditions per place. [2023-08-03 21:02:54,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 226 transitions, 500 flow [2023-08-03 21:02:54,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 226 transitions, 500 flow [2023-08-03 21:02:54,155 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:02:54,156 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 226 transitions, 500 flow [2023-08-03 21:02:54,156 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 226 transitions, 500 flow [2023-08-03 21:02:54,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 226 transitions, 500 flow [2023-08-03 21:02:54,233 INFO L124 PetriNetUnfolderBase]: 141/915 cut-off events. [2023-08-03 21:02:54,233 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 21:02:54,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 915 events. 141/915 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4245 event pairs, 2 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 573. Up to 32 conditions per place. [2023-08-03 21:02:54,248 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-03 21:02:58,532 INFO L134 LiptonReduction]: Checked pairs total: 27582 [2023-08-03 21:02:58,532 INFO L136 LiptonReduction]: Total number of compositions: 195 [2023-08-03 21:02:58,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:02:58,534 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;@2e31ef99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:02:58,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:02:58,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:02:58,536 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2023-08-03 21:02:58,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:02:58,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:02:58,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:02:58,537 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:02:58,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:02:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2026463864, now seen corresponding path program 1 times [2023-08-03 21:02:58,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:02:58,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565187086] [2023-08-03 21:02:58,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:02:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:02:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:02:58,587 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-03 21:02:58,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:02:58,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565187086] [2023-08-03 21:02:58,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565187086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:02:58,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:02:58,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:02:58,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344556600] [2023-08-03 21:02:58,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:02:58,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:02:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:02:58,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:02:58,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:02:58,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 421 [2023-08-03 21:02:58,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:02:58,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:02:58,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 421 [2023-08-03 21:02:58,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:02:59,969 INFO L124 PetriNetUnfolderBase]: 16934/24170 cut-off events. [2023-08-03 21:02:59,969 INFO L125 PetriNetUnfolderBase]: For 2244/2244 co-relation queries the response was YES. [2023-08-03 21:02:59,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47739 conditions, 24170 events. 16934/24170 cut-off events. For 2244/2244 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 147794 event pairs, 8831 based on Foata normal form. 0/22435 useless extension candidates. Maximal degree in co-relation 12364. Up to 22095 conditions per place. [2023-08-03 21:03:00,083 INFO L140 encePairwiseOnDemand]: 417/421 looper letters, 49 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-03 21:03:00,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 280 flow [2023-08-03 21:03:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:03:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:03:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-08-03 21:03:00,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837688044338876 [2023-08-03 21:03:00,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-08-03 21:03:00,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-08-03 21:03:00,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:00,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-08-03 21:03:00,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:00,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:00,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:00,089 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 168 flow. Second operand 3 states and 611 transitions. [2023-08-03 21:03:00,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 280 flow [2023-08-03 21:03:00,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:03:00,094 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 178 flow [2023-08-03 21:03:00,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2023-08-03 21:03:00,095 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2023-08-03 21:03:00,095 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 178 flow [2023-08-03 21:03:00,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:00,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:00,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:00,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 21:03:00,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:00,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash -401124713, now seen corresponding path program 1 times [2023-08-03 21:03:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129518712] [2023-08-03 21:03:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:03:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129518712] [2023-08-03 21:03:00,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129518712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:00,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:03:00,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:03:00,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049335617] [2023-08-03 21:03:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:00,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:03:00,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:00,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:03:00,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:03:00,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 421 [2023-08-03 21:03:00,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:00,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:00,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 421 [2023-08-03 21:03:00,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:01,528 INFO L124 PetriNetUnfolderBase]: 16914/23988 cut-off events. [2023-08-03 21:03:01,528 INFO L125 PetriNetUnfolderBase]: For 2034/2034 co-relation queries the response was YES. [2023-08-03 21:03:01,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47584 conditions, 23988 events. 16914/23988 cut-off events. For 2034/2034 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 144430 event pairs, 8806 based on Foata normal form. 0/22271 useless extension candidates. Maximal degree in co-relation 47533. Up to 21726 conditions per place. [2023-08-03 21:03:01,611 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 58 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-08-03 21:03:01,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 326 flow [2023-08-03 21:03:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:03:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:03:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2023-08-03 21:03:01,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48931116389548696 [2023-08-03 21:03:01,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 618 transitions. [2023-08-03 21:03:01,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 618 transitions. [2023-08-03 21:03:01,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:01,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 618 transitions. [2023-08-03 21:03:01,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:01,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:01,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:01,617 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 178 flow. Second operand 3 states and 618 transitions. [2023-08-03 21:03:01,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 326 flow [2023-08-03 21:03:01,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:03:01,620 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 188 flow [2023-08-03 21:03:01,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2023-08-03 21:03:01,620 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-03 21:03:01,621 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 188 flow [2023-08-03 21:03:01,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:01,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:01,621 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:01,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 21:03:01,621 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:01,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1495709964, now seen corresponding path program 1 times [2023-08-03 21:03:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299451311] [2023-08-03 21:03:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:01,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:03:01,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299451311] [2023-08-03 21:03:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299451311] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:01,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741606258] [2023-08-03 21:03:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:01,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:01,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:01,693 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-03 21:03:01,694 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-03 21:03:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:01,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:03:01,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:03:01,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:03:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741606258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:01,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:03:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:03:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877014707] [2023-08-03 21:03:01,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:01,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:03:01,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:01,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:03:01,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:03:01,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 421 [2023-08-03 21:03:01,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:01,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:01,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 421 [2023-08-03 21:03:01,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:03,111 INFO L124 PetriNetUnfolderBase]: 16882/23971 cut-off events. [2023-08-03 21:03:03,111 INFO L125 PetriNetUnfolderBase]: For 2636/2636 co-relation queries the response was YES. [2023-08-03 21:03:03,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48408 conditions, 23971 events. 16882/23971 cut-off events. For 2636/2636 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 144526 event pairs, 5827 based on Foata normal form. 16/22631 useless extension candidates. Maximal degree in co-relation 12507. Up to 21970 conditions per place. [2023-08-03 21:03:03,218 INFO L140 encePairwiseOnDemand]: 417/421 looper letters, 57 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2023-08-03 21:03:03,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 337 flow [2023-08-03 21:03:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:03:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:03:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 986 transitions. [2023-08-03 21:03:03,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684085510688836 [2023-08-03 21:03:03,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 986 transitions. [2023-08-03 21:03:03,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 986 transitions. [2023-08-03 21:03:03,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:03,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 986 transitions. [2023-08-03 21:03:03,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 197.2) internal successors, (986), 5 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:03,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:03,226 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:03,226 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 188 flow. Second operand 5 states and 986 transitions. [2023-08-03 21:03:03,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 337 flow [2023-08-03 21:03:03,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 21:03:03,230 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 197 flow [2023-08-03 21:03:03,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2023-08-03 21:03:03,231 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2023-08-03 21:03:03,231 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 197 flow [2023-08-03 21:03:03,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:03,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:03,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:03,239 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-03 21:03:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:03,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:03,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1282798091, now seen corresponding path program 1 times [2023-08-03 21:03:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119547493] [2023-08-03 21:03:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:03:03,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:03,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119547493] [2023-08-03 21:03:03,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119547493] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:03,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91338711] [2023-08-03 21:03:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:03,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:03,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:03,500 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-03 21:03:03,502 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-03 21:03:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:03,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:03:03,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:03,577 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-03 21:03:03,577 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:03:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91338711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:03,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:03:03,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 21:03:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939548318] [2023-08-03 21:03:03,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:03,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:03:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:03:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:03:03,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 421 [2023-08-03 21:03:03,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:03,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:03,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 421 [2023-08-03 21:03:03,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:04,705 INFO L124 PetriNetUnfolderBase]: 13746/19505 cut-off events. [2023-08-03 21:03:04,705 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2023-08-03 21:03:04,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39787 conditions, 19505 events. 13746/19505 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 114847 event pairs, 7008 based on Foata normal form. 0/18728 useless extension candidates. Maximal degree in co-relation 11401. Up to 13274 conditions per place. [2023-08-03 21:03:04,761 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 68 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-03 21:03:04,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 391 flow [2023-08-03 21:03:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:03:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:03:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2023-08-03 21:03:04,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49564528899445764 [2023-08-03 21:03:04,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2023-08-03 21:03:04,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2023-08-03 21:03:04,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:04,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2023-08-03 21:03:04,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:04,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:04,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:04,772 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 197 flow. Second operand 3 states and 626 transitions. [2023-08-03 21:03:04,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 391 flow [2023-08-03 21:03:04,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 384 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 21:03:04,776 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 202 flow [2023-08-03 21:03:04,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-08-03 21:03:04,778 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2023-08-03 21:03:04,779 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 202 flow [2023-08-03 21:03:04,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:04,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:04,779 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:04,784 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-03 21:03:04,983 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,SelfDestructingSolverStorable5 [2023-08-03 21:03:04,984 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:04,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash 429994737, now seen corresponding path program 1 times [2023-08-03 21:03:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:04,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223779290] [2023-08-03 21:03:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:04,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:03:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223779290] [2023-08-03 21:03:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223779290] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035805339] [2023-08-03 21:03:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:05,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:05,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:05,024 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-03 21:03:05,027 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-03 21:03:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:05,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:03:05,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:03:05,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:03:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:03:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035805339] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:03:05,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:03:05,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:03:05,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321203682] [2023-08-03 21:03:05,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:03:05,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:03:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:05,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:03:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:03:05,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 421 [2023-08-03 21:03:05,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:05,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:05,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 421 [2023-08-03 21:03:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:06,083 INFO L124 PetriNetUnfolderBase]: 12550/17828 cut-off events. [2023-08-03 21:03:06,084 INFO L125 PetriNetUnfolderBase]: For 3451/3451 co-relation queries the response was YES. [2023-08-03 21:03:06,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37540 conditions, 17828 events. 12550/17828 cut-off events. For 3451/3451 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 103158 event pairs, 4336 based on Foata normal form. 4/17414 useless extension candidates. Maximal degree in co-relation 10405. Up to 16547 conditions per place. [2023-08-03 21:03:06,143 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 58 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-03 21:03:06,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 344 flow [2023-08-03 21:03:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:03:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:03:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 800 transitions. [2023-08-03 21:03:06,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750593824228028 [2023-08-03 21:03:06,145 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 800 transitions. [2023-08-03 21:03:06,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 800 transitions. [2023-08-03 21:03:06,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:06,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 800 transitions. [2023-08-03 21:03:06,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:06,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:06,150 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:06,150 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 202 flow. Second operand 4 states and 800 transitions. [2023-08-03 21:03:06,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 344 flow [2023-08-03 21:03:06,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:03:06,160 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 198 flow [2023-08-03 21:03:06,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-08-03 21:03:06,161 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2023-08-03 21:03:06,161 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 198 flow [2023-08-03 21:03:06,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:06,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:06,162 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:06,169 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-03 21:03:06,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:06,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:06,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1671303953, now seen corresponding path program 1 times [2023-08-03 21:03:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265551332] [2023-08-03 21:03:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 21:03:06,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:06,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265551332] [2023-08-03 21:03:06,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265551332] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120978371] [2023-08-03 21:03:06,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:06,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:06,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:06,428 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-03 21:03:06,430 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-03 21:03:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:06,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:03:06,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 21:03:06,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:03:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120978371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:06,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:03:06,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:03:06,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575179376] [2023-08-03 21:03:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:06,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:03:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:06,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:03:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:03:06,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 421 [2023-08-03 21:03:06,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:06,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:06,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 421 [2023-08-03 21:03:06,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:07,456 INFO L124 PetriNetUnfolderBase]: 11526/16116 cut-off events. [2023-08-03 21:03:07,456 INFO L125 PetriNetUnfolderBase]: For 1594/1594 co-relation queries the response was YES. [2023-08-03 21:03:07,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34137 conditions, 16116 events. 11526/16116 cut-off events. For 1594/1594 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 89449 event pairs, 160 based on Foata normal form. 256/15985 useless extension candidates. Maximal degree in co-relation 12068. Up to 13310 conditions per place. [2023-08-03 21:03:07,524 INFO L140 encePairwiseOnDemand]: 417/421 looper letters, 82 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2023-08-03 21:03:07,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 444 flow [2023-08-03 21:03:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:03:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:03:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1010 transitions. [2023-08-03 21:03:07,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47980997624703087 [2023-08-03 21:03:07,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1010 transitions. [2023-08-03 21:03:07,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1010 transitions. [2023-08-03 21:03:07,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:07,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1010 transitions. [2023-08-03 21:03:07,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:07,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:07,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:07,532 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 198 flow. Second operand 5 states and 1010 transitions. [2023-08-03 21:03:07,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 444 flow [2023-08-03 21:03:07,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 432 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 21:03:07,550 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 203 flow [2023-08-03 21:03:07,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-08-03 21:03:07,551 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2023-08-03 21:03:07,551 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 203 flow [2023-08-03 21:03:07,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:07,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:07,552 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:07,556 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-03 21:03:07,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:07,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:07,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1717699960, now seen corresponding path program 1 times [2023-08-03 21:03:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:07,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110278319] [2023-08-03 21:03:07,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 21:03:07,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110278319] [2023-08-03 21:03:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110278319] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686594830] [2023-08-03 21:03:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:07,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:07,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:07,792 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-03 21:03:07,794 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-03 21:03:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:07,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:03:07,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:07,875 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-03 21:03:07,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:03:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686594830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:07,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:03:07,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 21:03:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465285053] [2023-08-03 21:03:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:07,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:03:07,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:03:07,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:03:07,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 421 [2023-08-03 21:03:07,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:07,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:07,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 421 [2023-08-03 21:03:07,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:08,862 INFO L124 PetriNetUnfolderBase]: 11129/16073 cut-off events. [2023-08-03 21:03:08,862 INFO L125 PetriNetUnfolderBase]: For 4723/4723 co-relation queries the response was YES. [2023-08-03 21:03:08,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34496 conditions, 16073 events. 11129/16073 cut-off events. For 4723/4723 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 94279 event pairs, 6508 based on Foata normal form. 0/15906 useless extension candidates. Maximal degree in co-relation 12360. Up to 11774 conditions per place. [2023-08-03 21:03:08,931 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 69 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-03 21:03:08,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 397 flow [2023-08-03 21:03:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:03:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:03:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2023-08-03 21:03:08,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49564528899445764 [2023-08-03 21:03:08,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2023-08-03 21:03:08,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2023-08-03 21:03:08,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:08,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2023-08-03 21:03:08,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:08,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:08,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:08,936 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 203 flow. Second operand 3 states and 626 transitions. [2023-08-03 21:03:08,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 397 flow [2023-08-03 21:03:08,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 390 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 21:03:08,947 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 208 flow [2023-08-03 21:03:08,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2023-08-03 21:03:08,947 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2023-08-03 21:03:08,947 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 208 flow [2023-08-03 21:03:08,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:08,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:08,948 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:08,954 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-03 21:03:09,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:09,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:09,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash 647262176, now seen corresponding path program 1 times [2023-08-03 21:03:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657659936] [2023-08-03 21:03:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:03:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657659936] [2023-08-03 21:03:09,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657659936] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684276929] [2023-08-03 21:03:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:09,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:09,217 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-03 21:03:09,225 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-03 21:03:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:09,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:03:09,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:03:09,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:03:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:03:09,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684276929] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:03:09,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:03:09,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:03:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826566798] [2023-08-03 21:03:09,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:03:09,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:03:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:09,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:03:09,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:03:09,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 421 [2023-08-03 21:03:09,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:09,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:09,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 421 [2023-08-03 21:03:09,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:10,131 INFO L124 PetriNetUnfolderBase]: 10601/15035 cut-off events. [2023-08-03 21:03:10,131 INFO L125 PetriNetUnfolderBase]: For 3008/3008 co-relation queries the response was YES. [2023-08-03 21:03:10,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32872 conditions, 15035 events. 10601/15035 cut-off events. For 3008/3008 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 83824 event pairs, 3490 based on Foata normal form. 64/15081 useless extension candidates. Maximal degree in co-relation 23107. Up to 12308 conditions per place. [2023-08-03 21:03:10,189 INFO L140 encePairwiseOnDemand]: 418/421 looper letters, 75 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2023-08-03 21:03:10,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 416 flow [2023-08-03 21:03:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:03:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:03:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 816 transitions. [2023-08-03 21:03:10,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845605700712589 [2023-08-03 21:03:10,191 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 816 transitions. [2023-08-03 21:03:10,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 816 transitions. [2023-08-03 21:03:10,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:10,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 816 transitions. [2023-08-03 21:03:10,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:10,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:10,194 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:10,194 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 208 flow. Second operand 4 states and 816 transitions. [2023-08-03 21:03:10,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 416 flow [2023-08-03 21:03:10,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:03:10,266 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 204 flow [2023-08-03 21:03:10,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-08-03 21:03:10,267 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-08-03 21:03:10,267 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 204 flow [2023-08-03 21:03:10,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:10,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:10,267 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:10,272 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-03 21:03:10,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:10,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:10,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1144983795, now seen corresponding path program 1 times [2023-08-03 21:03:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:10,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087537613] [2023-08-03 21:03:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:03:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087537613] [2023-08-03 21:03:10,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087537613] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464781091] [2023-08-03 21:03:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:10,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:10,514 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-03 21:03:10,515 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-03 21:03:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:10,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:03:10,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:03:10,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:03:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:03:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464781091] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:03:10,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:03:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:03:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10806966] [2023-08-03 21:03:10,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:03:10,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:03:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:03:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:03:10,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 421 [2023-08-03 21:03:10,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:10,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:10,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 421 [2023-08-03 21:03:10,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:11,215 INFO L124 PetriNetUnfolderBase]: 8137/11595 cut-off events. [2023-08-03 21:03:11,216 INFO L125 PetriNetUnfolderBase]: For 4103/4103 co-relation queries the response was YES. [2023-08-03 21:03:11,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25439 conditions, 11595 events. 8137/11595 cut-off events. For 4103/4103 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 62053 event pairs, 2353 based on Foata normal form. 256/11813 useless extension candidates. Maximal degree in co-relation 23491. Up to 4431 conditions per place. [2023-08-03 21:03:11,260 INFO L140 encePairwiseOnDemand]: 417/421 looper letters, 83 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-08-03 21:03:11,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 99 transitions, 462 flow [2023-08-03 21:03:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:03:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:03:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 825 transitions. [2023-08-03 21:03:11,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48990498812351546 [2023-08-03 21:03:11,262 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 825 transitions. [2023-08-03 21:03:11,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 825 transitions. [2023-08-03 21:03:11,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:11,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 825 transitions. [2023-08-03 21:03:11,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.25) internal successors, (825), 4 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:11,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:11,266 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:11,266 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 204 flow. Second operand 4 states and 825 transitions. [2023-08-03 21:03:11,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 99 transitions, 462 flow [2023-08-03 21:03:11,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 456 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 21:03:11,283 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 218 flow [2023-08-03 21:03:11,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2023-08-03 21:03:11,284 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2023-08-03 21:03:11,284 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 218 flow [2023-08-03 21:03:11,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:11,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:11,285 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:11,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-03 21:03:11,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:11,489 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:11,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -55695079, now seen corresponding path program 1 times [2023-08-03 21:03:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906094624] [2023-08-03 21:03:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 21:03:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906094624] [2023-08-03 21:03:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906094624] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993822109] [2023-08-03 21:03:11,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:11,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:11,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:11,547 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-03 21:03:11,549 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-03 21:03:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:11,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:03:11,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 21:03:11,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:03:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 21:03:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993822109] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:03:11,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:03:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 21:03:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459301175] [2023-08-03 21:03:11,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:03:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:03:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:03:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:03:11,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 421 [2023-08-03 21:03:11,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:11,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:11,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 421 [2023-08-03 21:03:11,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:12,403 INFO L124 PetriNetUnfolderBase]: 8121/11616 cut-off events. [2023-08-03 21:03:12,404 INFO L125 PetriNetUnfolderBase]: For 5856/5856 co-relation queries the response was YES. [2023-08-03 21:03:12,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26923 conditions, 11616 events. 8121/11616 cut-off events. For 5856/5856 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 62465 event pairs, 5681 based on Foata normal form. 17/11531 useless extension candidates. Maximal degree in co-relation 24939. Up to 10024 conditions per place. [2023-08-03 21:03:12,437 INFO L140 encePairwiseOnDemand]: 417/421 looper letters, 83 selfloop transitions, 3 changer transitions 2/100 dead transitions. [2023-08-03 21:03:12,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 478 flow [2023-08-03 21:03:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:03:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:03:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 825 transitions. [2023-08-03 21:03:12,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48990498812351546 [2023-08-03 21:03:12,439 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 825 transitions. [2023-08-03 21:03:12,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 825 transitions. [2023-08-03 21:03:12,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:12,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 825 transitions. [2023-08-03 21:03:12,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.25) internal successors, (825), 4 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:12,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:12,443 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:12,443 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 218 flow. Second operand 4 states and 825 transitions. [2023-08-03 21:03:12,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 478 flow [2023-08-03 21:03:12,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 474 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:03:12,465 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 222 flow [2023-08-03 21:03:12,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-08-03 21:03:12,466 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2023-08-03 21:03:12,466 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 222 flow [2023-08-03 21:03:12,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:12,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:12,466 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:12,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-03 21:03:12,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-03 21:03:12,671 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:12,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash 409524583, now seen corresponding path program 1 times [2023-08-03 21:03:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039542006] [2023-08-03 21:03:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-03 21:03:12,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:12,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039542006] [2023-08-03 21:03:12,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039542006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:12,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:03:12,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 21:03:12,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073642033] [2023-08-03 21:03:12,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:12,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:03:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:12,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:03:12,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:03:12,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 421 [2023-08-03 21:03:12,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:12,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:12,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 421 [2023-08-03 21:03:12,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:13,645 INFO L124 PetriNetUnfolderBase]: 10870/16452 cut-off events. [2023-08-03 21:03:13,645 INFO L125 PetriNetUnfolderBase]: For 9038/9038 co-relation queries the response was YES. [2023-08-03 21:03:13,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36680 conditions, 16452 events. 10870/16452 cut-off events. For 9038/9038 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 108181 event pairs, 2086 based on Foata normal form. 1/16392 useless extension candidates. Maximal degree in co-relation 36310. Up to 11323 conditions per place. [2023-08-03 21:03:13,720 INFO L140 encePairwiseOnDemand]: 415/421 looper letters, 81 selfloop transitions, 5 changer transitions 1/99 dead transitions. [2023-08-03 21:03:13,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 99 transitions, 563 flow [2023-08-03 21:03:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:03:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:03:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2023-08-03 21:03:13,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051464766429137 [2023-08-03 21:03:13,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 638 transitions. [2023-08-03 21:03:13,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 638 transitions. [2023-08-03 21:03:13,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:13,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 638 transitions. [2023-08-03 21:03:13,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:13,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:13,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:13,725 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 222 flow. Second operand 3 states and 638 transitions. [2023-08-03 21:03:13,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 99 transitions, 563 flow [2023-08-03 21:03:13,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 547 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-03 21:03:13,751 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 247 flow [2023-08-03 21:03:13,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2023-08-03 21:03:13,751 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2023-08-03 21:03:13,751 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 247 flow [2023-08-03 21:03:13,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:13,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:13,752 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:13,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 21:03:13,752 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:13,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2100848391, now seen corresponding path program 1 times [2023-08-03 21:03:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813617595] [2023-08-03 21:03:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 21:03:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813617595] [2023-08-03 21:03:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813617595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:03:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:03:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748299661] [2023-08-03 21:03:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:13,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:03:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:13,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:03:13,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:03:13,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 421 [2023-08-03 21:03:13,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:13,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:13,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 421 [2023-08-03 21:03:13,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:15,332 INFO L124 PetriNetUnfolderBase]: 21062/29241 cut-off events. [2023-08-03 21:03:15,333 INFO L125 PetriNetUnfolderBase]: For 17001/17001 co-relation queries the response was YES. [2023-08-03 21:03:15,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75030 conditions, 29241 events. 21062/29241 cut-off events. For 17001/17001 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 177207 event pairs, 7362 based on Foata normal form. 0/27499 useless extension candidates. Maximal degree in co-relation 74557. Up to 16167 conditions per place. [2023-08-03 21:03:15,461 INFO L140 encePairwiseOnDemand]: 413/421 looper letters, 90 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2023-08-03 21:03:15,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 623 flow [2023-08-03 21:03:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:03:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:03:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-08-03 21:03:15,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498812351543943 [2023-08-03 21:03:15,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-08-03 21:03:15,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-08-03 21:03:15,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:15,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-08-03 21:03:15,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:15,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:15,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:15,466 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 247 flow. Second operand 3 states and 630 transitions. [2023-08-03 21:03:15,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 623 flow [2023-08-03 21:03:15,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 108 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:03:15,543 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 306 flow [2023-08-03 21:03:15,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2023-08-03 21:03:15,544 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2023-08-03 21:03:15,544 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 306 flow [2023-08-03 21:03:15,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:15,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:15,544 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:15,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 21:03:15,545 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:15,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2095339587, now seen corresponding path program 1 times [2023-08-03 21:03:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773332355] [2023-08-03 21:03:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 21:03:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:15,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773332355] [2023-08-03 21:03:15,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773332355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:15,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:03:15,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:03:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885590105] [2023-08-03 21:03:15,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:15,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:03:15,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:15,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:03:15,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:03:15,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 421 [2023-08-03 21:03:15,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:15,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:15,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 421 [2023-08-03 21:03:15,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:17,232 INFO L124 PetriNetUnfolderBase]: 17746/25696 cut-off events. [2023-08-03 21:03:17,232 INFO L125 PetriNetUnfolderBase]: For 29612/29612 co-relation queries the response was YES. [2023-08-03 21:03:17,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73061 conditions, 25696 events. 17746/25696 cut-off events. For 29612/29612 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 162505 event pairs, 12157 based on Foata normal form. 662/26093 useless extension candidates. Maximal degree in co-relation 72495. Up to 22208 conditions per place. [2023-08-03 21:03:17,339 INFO L140 encePairwiseOnDemand]: 414/421 looper letters, 56 selfloop transitions, 2 changer transitions 34/106 dead transitions. [2023-08-03 21:03:17,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 106 transitions, 652 flow [2023-08-03 21:03:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:03:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:03:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 800 transitions. [2023-08-03 21:03:17,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750593824228028 [2023-08-03 21:03:17,341 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 800 transitions. [2023-08-03 21:03:17,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 800 transitions. [2023-08-03 21:03:17,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:17,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 800 transitions. [2023-08-03 21:03:17,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:17,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:17,344 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:17,344 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 306 flow. Second operand 4 states and 800 transitions. [2023-08-03 21:03:17,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 106 transitions, 652 flow [2023-08-03 21:03:17,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 21:03:17,448 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 310 flow [2023-08-03 21:03:17,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2023-08-03 21:03:17,449 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places. [2023-08-03 21:03:17,449 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 310 flow [2023-08-03 21:03:17,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:17,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:17,450 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:17,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-03 21:03:17,450 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:17,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:17,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2009967394, now seen corresponding path program 1 times [2023-08-03 21:03:17,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:17,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063971943] [2023-08-03 21:03:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-03 21:03:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:17,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063971943] [2023-08-03 21:03:17,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063971943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:17,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:03:17,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:03:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279603558] [2023-08-03 21:03:17,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:17,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:03:17,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:03:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:03:17,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 421 [2023-08-03 21:03:17,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:17,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:17,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 421 [2023-08-03 21:03:17,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:19,411 INFO L124 PetriNetUnfolderBase]: 21516/31026 cut-off events. [2023-08-03 21:03:19,412 INFO L125 PetriNetUnfolderBase]: For 28219/28239 co-relation queries the response was YES. [2023-08-03 21:03:19,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88014 conditions, 31026 events. 21516/31026 cut-off events. For 28219/28239 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 194945 event pairs, 10956 based on Foata normal form. 3/29521 useless extension candidates. Maximal degree in co-relation 87983. Up to 20255 conditions per place. [2023-08-03 21:03:19,564 INFO L140 encePairwiseOnDemand]: 413/421 looper letters, 99 selfloop transitions, 6 changer transitions 0/115 dead transitions. [2023-08-03 21:03:19,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 115 transitions, 718 flow [2023-08-03 21:03:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:03:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:03:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-08-03 21:03:19,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498812351543943 [2023-08-03 21:03:19,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-08-03 21:03:19,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-08-03 21:03:19,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:19,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-08-03 21:03:19,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:19,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:19,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:19,570 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 310 flow. Second operand 3 states and 630 transitions. [2023-08-03 21:03:19,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 115 transitions, 718 flow [2023-08-03 21:03:19,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 714 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:03:19,729 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 374 flow [2023-08-03 21:03:19,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2023-08-03 21:03:19,729 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2023-08-03 21:03:19,729 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 374 flow [2023-08-03 21:03:19,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:19,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:19,730 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:19,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-03 21:03:19,730 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:19,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2124913118, now seen corresponding path program 2 times [2023-08-03 21:03:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:19,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487476777] [2023-08-03 21:03:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:03:19,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:19,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487476777] [2023-08-03 21:03:19,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487476777] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:19,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282237368] [2023-08-03 21:03:19,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:03:19,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:19,824 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-03 21:03:19,831 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-03 21:03:19,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:03:19,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:03:19,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:03:19,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:03:19,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:03:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:03:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282237368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:03:20,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:03:20,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2023-08-03 21:03:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831817017] [2023-08-03 21:03:20,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:03:20,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-03 21:03:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:20,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-03 21:03:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-03 21:03:20,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 421 [2023-08-03 21:03:20,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 374 flow. Second operand has 8 states, 8 states have (on average 181.75) internal successors, (1454), 8 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:20,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:20,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 421 [2023-08-03 21:03:20,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:25,968 INFO L124 PetriNetUnfolderBase]: 60329/85739 cut-off events. [2023-08-03 21:03:25,969 INFO L125 PetriNetUnfolderBase]: For 131840/133352 co-relation queries the response was YES. [2023-08-03 21:03:26,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271868 conditions, 85739 events. 60329/85739 cut-off events. For 131840/133352 co-relation queries the response was YES. Maximal size of possible extension queue 2435. Compared 603075 event pairs, 1981 based on Foata normal form. 324/83095 useless extension candidates. Maximal degree in co-relation 271831. Up to 34640 conditions per place. [2023-08-03 21:03:26,469 INFO L140 encePairwiseOnDemand]: 404/421 looper letters, 287 selfloop transitions, 41 changer transitions 1/337 dead transitions. [2023-08-03 21:03:26,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 337 transitions, 2342 flow [2023-08-03 21:03:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-03 21:03:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-03 21:03:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1849 transitions. [2023-08-03 21:03:26,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48799155449986803 [2023-08-03 21:03:26,475 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1849 transitions. [2023-08-03 21:03:26,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1849 transitions. [2023-08-03 21:03:26,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:26,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1849 transitions. [2023-08-03 21:03:26,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 205.44444444444446) internal successors, (1849), 9 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:26,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 421.0) internal successors, (4210), 10 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:26,481 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 421.0) internal successors, (4210), 10 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:26,481 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 374 flow. Second operand 9 states and 1849 transitions. [2023-08-03 21:03:26,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 337 transitions, 2342 flow [2023-08-03 21:03:27,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 337 transitions, 2234 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-03 21:03:27,207 INFO L231 Difference]: Finished difference. Result has 95 places, 114 transitions, 746 flow [2023-08-03 21:03:27,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=746, PETRI_PLACES=95, PETRI_TRANSITIONS=114} [2023-08-03 21:03:27,208 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2023-08-03 21:03:27,208 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 114 transitions, 746 flow [2023-08-03 21:03:27,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.75) internal successors, (1454), 8 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:27,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:27,208 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:27,215 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-03 21:03:27,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-03 21:03:27,412 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:27,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2006808500, now seen corresponding path program 1 times [2023-08-03 21:03:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854305368] [2023-08-03 21:03:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 21:03:27,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854305368] [2023-08-03 21:03:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854305368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:27,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:03:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:03:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239358573] [2023-08-03 21:03:27,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:27,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:03:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:27,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:03:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:03:27,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 421 [2023-08-03 21:03:27,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 114 transitions, 746 flow. Second operand has 4 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:27,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:27,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 421 [2023-08-03 21:03:27,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:33,303 INFO L124 PetriNetUnfolderBase]: 50390/71024 cut-off events. [2023-08-03 21:03:33,303 INFO L125 PetriNetUnfolderBase]: For 223073/224299 co-relation queries the response was YES. [2023-08-03 21:03:33,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279478 conditions, 71024 events. 50390/71024 cut-off events. For 223073/224299 co-relation queries the response was YES. Maximal size of possible extension queue 1926. Compared 469919 event pairs, 10333 based on Foata normal form. 414/71245 useless extension candidates. Maximal degree in co-relation 279432. Up to 64387 conditions per place. [2023-08-03 21:03:33,789 INFO L140 encePairwiseOnDemand]: 408/421 looper letters, 135 selfloop transitions, 11 changer transitions 20/174 dead transitions. [2023-08-03 21:03:33,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 174 transitions, 1445 flow [2023-08-03 21:03:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:03:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:03:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 813 transitions. [2023-08-03 21:03:33,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827790973871734 [2023-08-03 21:03:33,792 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 813 transitions. [2023-08-03 21:03:33,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 813 transitions. [2023-08-03 21:03:33,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:33,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 813 transitions. [2023-08-03 21:03:33,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.25) internal successors, (813), 4 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:33,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:33,795 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:33,795 INFO L175 Difference]: Start difference. First operand has 95 places, 114 transitions, 746 flow. Second operand 4 states and 813 transitions. [2023-08-03 21:03:33,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 174 transitions, 1445 flow [2023-08-03 21:03:34,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 174 transitions, 1412 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-03 21:03:34,164 INFO L231 Difference]: Finished difference. Result has 99 places, 118 transitions, 808 flow [2023-08-03 21:03:34,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=808, PETRI_PLACES=99, PETRI_TRANSITIONS=118} [2023-08-03 21:03:34,165 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 44 predicate places. [2023-08-03 21:03:34,165 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 118 transitions, 808 flow [2023-08-03 21:03:34,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:34,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:34,165 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:34,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-03 21:03:34,165 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:34,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1264659499, now seen corresponding path program 1 times [2023-08-03 21:03:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450508348] [2023-08-03 21:03:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 21:03:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:34,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450508348] [2023-08-03 21:03:34,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450508348] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:34,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274807702] [2023-08-03 21:03:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:34,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:34,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:34,230 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-03 21:03:34,232 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-03 21:03:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:34,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-03 21:03:34,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 21:03:34,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:03:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274807702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:03:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 21:03:34,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802446621] [2023-08-03 21:03:34,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:34,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:03:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:34,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:03:34,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:03:34,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 421 [2023-08-03 21:03:34,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 118 transitions, 808 flow. Second operand has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:34,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:34,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 421 [2023-08-03 21:03:34,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:39,708 INFO L124 PetriNetUnfolderBase]: 42427/61441 cut-off events. [2023-08-03 21:03:39,708 INFO L125 PetriNetUnfolderBase]: For 224131/226108 co-relation queries the response was YES. [2023-08-03 21:03:39,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239626 conditions, 61441 events. 42427/61441 cut-off events. For 224131/226108 co-relation queries the response was YES. Maximal size of possible extension queue 2036. Compared 433026 event pairs, 20891 based on Foata normal form. 257/59619 useless extension candidates. Maximal degree in co-relation 238827. Up to 55140 conditions per place. [2023-08-03 21:03:40,324 INFO L140 encePairwiseOnDemand]: 413/421 looper letters, 95 selfloop transitions, 2 changer transitions 39/158 dead transitions. [2023-08-03 21:03:40,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 158 transitions, 1318 flow [2023-08-03 21:03:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:03:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:03:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 983 transitions. [2023-08-03 21:03:40,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669833729216152 [2023-08-03 21:03:40,326 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 983 transitions. [2023-08-03 21:03:40,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 983 transitions. [2023-08-03 21:03:40,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:40,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 983 transitions. [2023-08-03 21:03:40,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.6) internal successors, (983), 5 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:40,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:40,330 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:40,330 INFO L175 Difference]: Start difference. First operand has 99 places, 118 transitions, 808 flow. Second operand 5 states and 983 transitions. [2023-08-03 21:03:40,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 158 transitions, 1318 flow [2023-08-03 21:03:40,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 158 transitions, 1285 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-03 21:03:40,891 INFO L231 Difference]: Finished difference. Result has 105 places, 119 transitions, 809 flow [2023-08-03 21:03:40,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=809, PETRI_PLACES=105, PETRI_TRANSITIONS=119} [2023-08-03 21:03:40,892 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 50 predicate places. [2023-08-03 21:03:40,892 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 119 transitions, 809 flow [2023-08-03 21:03:40,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:40,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:40,892 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:40,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 21:03:41,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:41,093 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:41,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash 798857357, now seen corresponding path program 1 times [2023-08-03 21:03:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:41,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747546961] [2023-08-03 21:03:41,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-03 21:03:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747546961] [2023-08-03 21:03:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747546961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:41,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:03:41,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:03:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025897684] [2023-08-03 21:03:41,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:03:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:03:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:03:41,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 421 [2023-08-03 21:03:41,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 119 transitions, 809 flow. Second operand has 4 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:41,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:41,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 421 [2023-08-03 21:03:41,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:47,013 INFO L124 PetriNetUnfolderBase]: 49767/70066 cut-off events. [2023-08-03 21:03:47,013 INFO L125 PetriNetUnfolderBase]: For 234173/235323 co-relation queries the response was YES. [2023-08-03 21:03:47,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286023 conditions, 70066 events. 49767/70066 cut-off events. For 234173/235323 co-relation queries the response was YES. Maximal size of possible extension queue 1904. Compared 461311 event pairs, 11073 based on Foata normal form. 125/69997 useless extension candidates. Maximal degree in co-relation 285980. Up to 64210 conditions per place. [2023-08-03 21:03:47,686 INFO L140 encePairwiseOnDemand]: 410/421 looper letters, 128 selfloop transitions, 11 changer transitions 20/167 dead transitions. [2023-08-03 21:03:47,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 167 transitions, 1392 flow [2023-08-03 21:03:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:03:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:03:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 807 transitions. [2023-08-03 21:03:47,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47921615201900236 [2023-08-03 21:03:47,688 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 807 transitions. [2023-08-03 21:03:47,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 807 transitions. [2023-08-03 21:03:47,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:47,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 807 transitions. [2023-08-03 21:03:47,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:47,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:47,691 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:47,691 INFO L175 Difference]: Start difference. First operand has 105 places, 119 transitions, 809 flow. Second operand 4 states and 807 transitions. [2023-08-03 21:03:47,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 167 transitions, 1392 flow [2023-08-03 21:03:48,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 167 transitions, 1366 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-03 21:03:48,290 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 771 flow [2023-08-03 21:03:48,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=771, PETRI_PLACES=103, PETRI_TRANSITIONS=115} [2023-08-03 21:03:48,291 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2023-08-03 21:03:48,291 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 115 transitions, 771 flow [2023-08-03 21:03:48,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:48,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:48,291 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:48,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-03 21:03:48,291 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:48,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:48,292 INFO L85 PathProgramCache]: Analyzing trace with hash 617921427, now seen corresponding path program 2 times [2023-08-03 21:03:48,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:48,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450589865] [2023-08-03 21:03:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-03 21:03:48,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450589865] [2023-08-03 21:03:48,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450589865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:03:48,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:03:48,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:03:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312174135] [2023-08-03 21:03:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:03:48,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:03:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:03:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:03:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:03:48,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 421 [2023-08-03 21:03:48,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 115 transitions, 771 flow. Second operand has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:48,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:03:48,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 421 [2023-08-03 21:03:48,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:03:55,011 INFO L124 PetriNetUnfolderBase]: 57426/80396 cut-off events. [2023-08-03 21:03:55,011 INFO L125 PetriNetUnfolderBase]: For 260174/260958 co-relation queries the response was YES. [2023-08-03 21:03:55,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321870 conditions, 80396 events. 57426/80396 cut-off events. For 260174/260958 co-relation queries the response was YES. Maximal size of possible extension queue 2228. Compared 531265 event pairs, 14279 based on Foata normal form. 605/80988 useless extension candidates. Maximal degree in co-relation 321823. Up to 65557 conditions per place. [2023-08-03 21:03:55,568 INFO L140 encePairwiseOnDemand]: 406/421 looper letters, 169 selfloop transitions, 23 changer transitions 0/200 dead transitions. [2023-08-03 21:03:55,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 200 transitions, 1671 flow [2023-08-03 21:03:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:03:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:03:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2023-08-03 21:03:55,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47363420427553443 [2023-08-03 21:03:55,570 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 997 transitions. [2023-08-03 21:03:55,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 997 transitions. [2023-08-03 21:03:55,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:03:55,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 997 transitions. [2023-08-03 21:03:55,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:55,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:55,573 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:55,573 INFO L175 Difference]: Start difference. First operand has 103 places, 115 transitions, 771 flow. Second operand 5 states and 997 transitions. [2023-08-03 21:03:55,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 200 transitions, 1671 flow [2023-08-03 21:03:56,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 200 transitions, 1630 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-03 21:03:56,100 INFO L231 Difference]: Finished difference. Result has 103 places, 127 transitions, 934 flow [2023-08-03 21:03:56,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=934, PETRI_PLACES=103, PETRI_TRANSITIONS=127} [2023-08-03 21:03:56,100 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2023-08-03 21:03:56,100 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 127 transitions, 934 flow [2023-08-03 21:03:56,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:03:56,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:03:56,101 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:03:56,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-03 21:03:56,101 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:03:56,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:03:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash -511568555, now seen corresponding path program 1 times [2023-08-03 21:03:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:03:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497562020] [2023-08-03 21:03:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:03:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 21:03:56,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:03:56,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497562020] [2023-08-03 21:03:56,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497562020] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:03:56,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668526567] [2023-08-03 21:03:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:03:56,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:03:56,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:03:56,602 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-03 21:03:56,604 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-03 21:03:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:03:56,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-03 21:03:56,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:03:56,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:03:56,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:03:56,767 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-03 21:03:56,767 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-03 21:03:56,810 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-03 21:03:56,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:03:56,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:03:56,878 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:03:56,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-03 21:03:56,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-03 21:03:57,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-03 21:03:57,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-03 21:03:57,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-03 21:03:57,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-03 21:03:57,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 18 [2023-08-03 21:03:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 21:03:58,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:04:04,000 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-08-03 21:04:04,000 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-08-03 21:04:04,090 INFO L322 Elim1Store]: treesize reduction 5, result has 96.6 percent of original size [2023-08-03 21:04:04,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 418 [2023-08-03 21:04:04,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:04:04,132 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:04:04,132 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 255 treesize of output 279 [2023-08-03 21:04:04,153 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:04:04,173 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:04:04,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 209 [2023-08-03 21:04:15,897 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-08-03 21:04:15,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-08-03 21:04:15,988 INFO L322 Elim1Store]: treesize reduction 4, result has 97.3 percent of original size [2023-08-03 21:04:15,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 715 [2023-08-03 21:04:16,047 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:04:16,048 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 187 treesize of output 243 [2023-08-03 21:04:16,116 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:04:16,116 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 185 treesize of output 217 [2023-08-03 21:04:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 5 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 21:04:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668526567] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:04:36,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:04:36,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 18] total 46 [2023-08-03 21:04:36,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401497535] [2023-08-03 21:04:36,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:04:36,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-08-03 21:04:36,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:04:36,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-08-03 21:04:36,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1955, Unknown=9, NotChecked=0, Total=2162 [2023-08-03 21:04:40,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 421 [2023-08-03 21:04:40,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 127 transitions, 934 flow. Second operand has 47 states, 47 states have (on average 92.95744680851064) internal successors, (4369), 47 states have internal predecessors, (4369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:04:40,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:04:40,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 421 [2023-08-03 21:04:40,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:04:52,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:05:03,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:05:28,608 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse26 (* c_~q2_front~0 4))) (let ((.cse48 (select |c_#memory_int| c_~q2~0.base)) (.cse3 (+ c_~q2~0.offset .cse26))) (let ((.cse28 (* c_~q2_back~0 4)) (.cse35 (select .cse48 .cse3))) (let ((.cse0 (< .cse35 c_~N~0)) (.cse23 (= c_~j~0 c_~i~0)) (.cse24 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse22 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (.cse37 (= c_~q1_back~0 c_~q1_front~0)) (.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (<= c_~n1~0 c_~q1_back~0)) (.cse13 (< c_~q2_back~0 0)) (.cse14 (<= c_~n2~0 c_~q2_back~0)) (.cse15 (< c_~q1_back~0 0)) (.cse6 (+ .cse28 c_~q2~0.offset)) (.cse8 (+ c_~i~0 1)) (.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and .cse0 (or .cse1 (and (forall ((v_ArrVal_624 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse2 (select .cse9 c_~q2~0.base)) (.cse4 (select .cse9 c_~q1~0.base))) (or (< (select .cse2 .cse3) c_~i~0) (not (= c_~j~0 (select .cse4 .cse5))) (not (= c_~i~0 (select .cse2 .cse6))) (< (select .cse4 .cse7) .cse8))))) (forall ((v_ArrVal_624 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse11 (select .cse12 c_~q2~0.base)) (.cse10 (select .cse12 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse10 .cse5))) (not (= c_~i~0 (select .cse11 .cse6))) (< (select .cse11 .cse3) .cse8) (< (select .cse10 .cse7) c_~i~0)))))) .cse13 .cse14 .cse15) (or .cse1 .cse13 .cse14 .cse15 (and (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse17 (select .cse18 c_~q1~0.base)) (.cse16 (select .cse18 c_~q2~0.base))) (or (not (= c_~i~0 (select .cse16 .cse6))) (< (select .cse17 .cse7) .cse8) (not (= (select .cse17 .cse5) c_~j~0)) (< (select .cse16 .cse3) c_~i~0))))) (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse20 (select .cse21 c_~q1~0.base)) (.cse19 (select .cse21 c_~q2~0.base))) (or (not (= c_~i~0 (select .cse19 .cse6))) (< (select .cse20 .cse7) c_~i~0) (not (= (select .cse20 .cse5) c_~j~0)) (< (select .cse19 .cse3) .cse8))))))) (= c_~q1~0.offset 0) (<= .cse22 |c_#pthreadsForks|) (or .cse0 (< .cse8 c_~N~0)) .cse23 (or .cse1 .cse13 .cse14 .cse24 .cse15 (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_624 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 (+ .cse31 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_620)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse27 (select .cse29 c_~q1~0.base)) (.cse25 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse25 (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse27 .cse7) .cse8) (not (= c_~j~0 (select .cse27 .cse5))) (not (= c_~i~0 (select .cse25 (+ .cse28 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_624 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 (+ .cse31 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_620)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse32 (select .cse34 c_~q1~0.base)) (.cse33 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~j~0 (select .cse32 .cse5))) (not (= c_~i~0 (select .cse33 (+ .cse28 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse32 .cse7) c_~i~0) (< (select .cse33 (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8)))))))) (<= c_~q2_front~0 0) (<= 0 .cse35) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (or .cse1 .cse13 (let ((.cse36 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_193| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_193|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_193|) 0))))) (.cse38 (< 0 c_~q2_back~0))) (and (or .cse36 (and (< c_~j~0 .cse8) .cse37) .cse38) (or .cse36 .cse38 (= c_~q2_front~0 c_~q2_back~0) (not .cse23)))) .cse24 .cse15) (not (= c_~q1~0.base c_~q2~0.base)) (<= c_~n1~0 1) (or .cse1 .cse13 (let ((.cse42 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse40 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse39 (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse41 (select .cse43 c_~q1~0.base))) (or (< (select .cse39 .cse40) .cse8) (< (select .cse41 .cse7) c_~i~0) (not (= c_~i~0 (select .cse39 .cse42))) (not (= (select .cse41 .cse5) c_~j~0)))))) (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse44 (select .cse46 c_~q1~0.base)) (.cse45 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse44 .cse7) .cse8) (not (= c_~i~0 (select .cse45 .cse42))) (not (= (select .cse44 .cse5) c_~j~0)) (< (select .cse45 .cse40) c_~i~0))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15) (not (= |c_ULTIMATE.start_main_~asdf~1#1| 0)) (<= 0 c_~q2_front~0) (<= |c_#pthreadsForks| .cse22) (<= c_~j~0 0) .cse37 (or (< c_~i~0 c_~N~0) (< (+ .cse35 1) c_~N~0)) (let ((.cse47 (select |c_#memory_int| c_~q1~0.base))) (or (not (= (select .cse47 .cse5) c_~j~0)) .cse1 .cse13 .cse14 .cse15 (not (= c_~i~0 (select .cse48 .cse6))) (let ((.cse49 (select .cse47 .cse7))) (and (or (< .cse49 .cse8) (< .cse35 c_~i~0)) (or (< .cse35 .cse8) (< .cse49 c_~i~0))))))))))) is different from false [2023-08-03 21:05:35,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:05:39,641 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse26 (* c_~q2_front~0 4))) (let ((.cse48 (select |c_#memory_int| c_~q2~0.base)) (.cse3 (+ c_~q2~0.offset .cse26))) (let ((.cse28 (* c_~q2_back~0 4)) (.cse35 (select .cse48 .cse3))) (let ((.cse0 (< .cse35 c_~N~0)) (.cse23 (= c_~j~0 c_~i~0)) (.cse24 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse37 (= c_~q1_back~0 c_~q1_front~0)) (.cse22 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0) 1)) (.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (<= c_~n1~0 c_~q1_back~0)) (.cse13 (< c_~q2_back~0 0)) (.cse14 (<= c_~n2~0 c_~q2_back~0)) (.cse15 (< c_~q1_back~0 0)) (.cse6 (+ .cse28 c_~q2~0.offset)) (.cse8 (+ c_~i~0 1)) (.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and .cse0 (or .cse1 (and (forall ((v_ArrVal_624 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse2 (select .cse9 c_~q2~0.base)) (.cse4 (select .cse9 c_~q1~0.base))) (or (< (select .cse2 .cse3) c_~i~0) (not (= c_~j~0 (select .cse4 .cse5))) (not (= c_~i~0 (select .cse2 .cse6))) (< (select .cse4 .cse7) .cse8))))) (forall ((v_ArrVal_624 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse11 (select .cse12 c_~q2~0.base)) (.cse10 (select .cse12 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse10 .cse5))) (not (= c_~i~0 (select .cse11 .cse6))) (< (select .cse11 .cse3) .cse8) (< (select .cse10 .cse7) c_~i~0)))))) .cse13 .cse14 .cse15) (or .cse1 .cse13 .cse14 .cse15 (and (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse17 (select .cse18 c_~q1~0.base)) (.cse16 (select .cse18 c_~q2~0.base))) (or (not (= c_~i~0 (select .cse16 .cse6))) (< (select .cse17 .cse7) .cse8) (not (= (select .cse17 .cse5) c_~j~0)) (< (select .cse16 .cse3) c_~i~0))))) (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse20 (select .cse21 c_~q1~0.base)) (.cse19 (select .cse21 c_~q2~0.base))) (or (not (= c_~i~0 (select .cse19 .cse6))) (< (select .cse20 .cse7) c_~i~0) (not (= (select .cse20 .cse5) c_~j~0)) (< (select .cse19 .cse3) .cse8))))))) (= c_~q1~0.offset 0) (or .cse0 (< .cse8 c_~N~0)) (<= .cse22 |c_ULTIMATE.start_main_#t~pre22#1|) .cse23 (or .cse1 .cse13 .cse14 .cse24 .cse15 (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_624 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 (+ .cse31 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_620)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse27 (select .cse29 c_~q1~0.base)) (.cse25 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse25 (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse27 .cse7) .cse8) (not (= c_~j~0 (select .cse27 .cse5))) (not (= c_~i~0 (select .cse25 (+ .cse28 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_624 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 (+ .cse31 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_620)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse32 (select .cse34 c_~q1~0.base)) (.cse33 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~j~0 (select .cse32 .cse5))) (not (= c_~i~0 (select .cse33 (+ .cse28 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse32 .cse7) c_~i~0) (< (select .cse33 (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8)))))))) (<= c_~q2_front~0 0) (<= 0 .cse35) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (or .cse1 .cse13 (let ((.cse36 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_193| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_193|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_193|) 0))))) (.cse38 (< 0 c_~q2_back~0))) (and (or .cse36 (and (< c_~j~0 .cse8) .cse37) .cse38) (or .cse36 .cse38 (= c_~q2_front~0 c_~q2_back~0) (not .cse23)))) .cse24 .cse15) (not (= c_~q1~0.base c_~q2~0.base)) (<= c_~n1~0 1) (or .cse1 .cse13 (let ((.cse42 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse40 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse39 (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse41 (select .cse43 c_~q1~0.base))) (or (< (select .cse39 .cse40) .cse8) (< (select .cse41 .cse7) c_~i~0) (not (= c_~i~0 (select .cse39 .cse42))) (not (= (select .cse41 .cse5) c_~j~0)))))) (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624))) (let ((.cse44 (select .cse46 c_~q1~0.base)) (.cse45 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse44 .cse7) .cse8) (not (= c_~i~0 (select .cse45 .cse42))) (not (= (select .cse44 .cse5) c_~j~0)) (< (select .cse45 .cse40) c_~i~0))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15) (<= 0 c_~q2_front~0) (<= c_~j~0 0) .cse37 (or (< c_~i~0 c_~N~0) (< (+ .cse35 1) c_~N~0)) (<= |c_ULTIMATE.start_main_#t~pre22#1| .cse22) (let ((.cse47 (select |c_#memory_int| c_~q1~0.base))) (or (not (= (select .cse47 .cse5) c_~j~0)) .cse1 .cse13 .cse14 .cse15 (not (= c_~i~0 (select .cse48 .cse6))) (let ((.cse49 (select .cse47 .cse7))) (and (or (< .cse49 .cse8) (< .cse35 c_~i~0)) (or (< .cse35 .cse8) (< .cse49 c_~i~0))))))))))) is different from false [2023-08-03 21:05:51,830 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 197 DAG size of output: 187 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:06:38,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:06:51,152 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 194 DAG size of output: 184 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)