/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 01:43:14,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 01:43:14,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 01:43:15,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 01:43:15,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 01:43:15,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 01:43:15,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 01:43:15,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 01:43:15,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 01:43:15,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 01:43:15,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 01:43:15,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 01:43:15,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 01:43:15,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 01:43:15,041 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 01:43:15,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 01:43:15,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 01:43:15,042 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 01:43:15,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 01:43:15,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 01:43:15,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 01:43:15,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 01:43:15,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 01:43:15,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 01:43:15,043 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 01:43:15,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 01:43:15,044 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 01:43:15,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 01:43:15,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 01:43:15,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 01:43:15,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:43:15,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 01:43:15,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 01:43:15,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 01:43:15,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 01:43:15,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 01:43:15,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 01:43:15,047 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 01:43:15,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 01:43:15,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 01:43:15,047 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 01:43:15,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 01:43:15,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 01:43:15,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 01:43:15,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 01:43:15,281 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 01:43:15,282 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 01:43:15,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i [2023-08-04 01:43:16,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 01:43:16,639 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 01:43:16,639 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i [2023-08-04 01:43:16,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def8420e9/194fd9d2fc1c4330a9b49b3482a0dd01/FLAG55c1abe28 [2023-08-04 01:43:16,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def8420e9/194fd9d2fc1c4330a9b49b3482a0dd01 [2023-08-04 01:43:16,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 01:43:16,687 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 01:43:16,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 01:43:16,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 01:43:16,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 01:43:16,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:43:16" (1/1) ... [2023-08-04 01:43:16,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492e6d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:16, skipping insertion in model container [2023-08-04 01:43:16,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:43:16" (1/1) ... [2023-08-04 01:43:16,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 01:43:16,955 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i[30988,31001] [2023-08-04 01:43:16,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:43:16,965 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 01:43:16,982 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [257] [2023-08-04 01:43:16,984 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [257] [2023-08-04 01:43:16,999 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i[30988,31001] [2023-08-04 01:43:17,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:43:17,040 INFO L206 MainTranslator]: Completed translation [2023-08-04 01:43:17,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17 WrapperNode [2023-08-04 01:43:17,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 01:43:17,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 01:43:17,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 01:43:17,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 01:43:17,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,100 INFO L138 Inliner]: procedures = 168, calls = 34, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 95 [2023-08-04 01:43:17,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 01:43:17,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 01:43:17,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 01:43:17,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 01:43:17,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 01:43:17,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 01:43:17,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 01:43:17,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 01:43:17,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (1/1) ... [2023-08-04 01:43:17,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:43:17,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:17,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 01:43:17,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 01:43:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 01:43:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 01:43:17,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 01:43:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 01:43:17,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 01:43:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 01:43:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 01:43:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 01:43:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 01:43:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 01:43:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 01:43:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 01:43:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 01:43:17,199 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 01:43:17,349 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 01:43:17,350 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 01:43:17,551 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 01:43:17,558 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 01:43:17,558 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-04 01:43:17,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:43:17 BoogieIcfgContainer [2023-08-04 01:43:17,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 01:43:17,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 01:43:17,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 01:43:17,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 01:43:17,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 01:43:16" (1/3) ... [2023-08-04 01:43:17,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dac6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:43:17, skipping insertion in model container [2023-08-04 01:43:17,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:43:17" (2/3) ... [2023-08-04 01:43:17,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dac6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:43:17, skipping insertion in model container [2023-08-04 01:43:17,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:43:17" (3/3) ... [2023-08-04 01:43:17,566 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread_stateful01-2_bound2.i [2023-08-04 01:43:17,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 01:43:17,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 01:43:17,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 01:43:17,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 01:43:17,665 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 01:43:17,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 119 transitions, 260 flow [2023-08-04 01:43:17,777 INFO L124 PetriNetUnfolderBase]: 26/248 cut-off events. [2023-08-04 01:43:17,777 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2023-08-04 01:43:17,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 248 events. 26/248 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 848 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 01:43:17,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 119 transitions, 260 flow [2023-08-04 01:43:17,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 83 transitions, 176 flow [2023-08-04 01:43:17,789 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:43:17,797 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2023-08-04 01:43:17,799 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2023-08-04 01:43:17,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2023-08-04 01:43:17,821 INFO L124 PetriNetUnfolderBase]: 2/120 cut-off events. [2023-08-04 01:43:17,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:43:17,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 79. Up to 4 conditions per place. [2023-08-04 01:43:17,823 INFO L119 LiptonReduction]: Number of co-enabled transitions 1270 [2023-08-04 01:43:20,442 INFO L134 LiptonReduction]: Checked pairs total: 3107 [2023-08-04 01:43:20,443 INFO L136 LiptonReduction]: Total number of compositions: 63 [2023-08-04 01:43:20,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:43:20,459 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;@5102a4a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:43:20,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 01:43:20,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:43:20,463 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 01:43:20,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:43:20,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:20,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 01:43:20,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:43:20,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash 380524340, now seen corresponding path program 1 times [2023-08-04 01:43:20,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743834105] [2023-08-04 01:43:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 01:43:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:20,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743834105] [2023-08-04 01:43:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743834105] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:43:20,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:43:20,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:43:20,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224997785] [2023-08-04 01:43:20,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:43:20,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:43:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:20,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:43:20,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:43:20,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 182 [2023-08-04 01:43:20,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:20,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:20,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 182 [2023-08-04 01:43:20,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:20,818 INFO L124 PetriNetUnfolderBase]: 73/192 cut-off events. [2023-08-04 01:43:20,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:43:20,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 192 events. 73/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 812 event pairs, 18 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 357. Up to 140 conditions per place. [2023-08-04 01:43:20,821 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 19 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-04 01:43:20,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 110 flow [2023-08-04 01:43:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:43:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:43:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-04 01:43:20,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6062271062271062 [2023-08-04 01:43:20,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-04 01:43:20,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-04 01:43:20,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:20,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-04 01:43:20,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:20,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:20,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:20,846 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 56 flow. Second operand 3 states and 331 transitions. [2023-08-04 01:43:20,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 110 flow [2023-08-04 01:43:20,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 01:43:20,849 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 64 flow [2023-08-04 01:43:20,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-04 01:43:20,853 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2023-08-04 01:43:20,854 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 64 flow [2023-08-04 01:43:20,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:20,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:20,854 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 01:43:20,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 01:43:20,855 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:43:20,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1097943112, now seen corresponding path program 1 times [2023-08-04 01:43:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932550956] [2023-08-04 01:43:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:43:20,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:43:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:43:20,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:43:20,915 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:43:20,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 01:43:20,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 01:43:20,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 01:43:20,919 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 01:43:20,921 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 01:43:20,922 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 01:43:20,922 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 01:43:20,952 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 01:43:20,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 151 transitions, 350 flow [2023-08-04 01:43:21,040 INFO L124 PetriNetUnfolderBase]: 117/784 cut-off events. [2023-08-04 01:43:21,040 INFO L125 PetriNetUnfolderBase]: For 72/88 co-relation queries the response was YES. [2023-08-04 01:43:21,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 784 events. 117/784 cut-off events. For 72/88 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4199 event pairs, 2 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 467. Up to 32 conditions per place. [2023-08-04 01:43:21,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 151 transitions, 350 flow [2023-08-04 01:43:21,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 246 flow [2023-08-04 01:43:21,048 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:43:21,048 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 246 flow [2023-08-04 01:43:21,048 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 246 flow [2023-08-04 01:43:21,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 246 flow [2023-08-04 01:43:21,074 INFO L124 PetriNetUnfolderBase]: 3/237 cut-off events. [2023-08-04 01:43:21,074 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 01:43:21,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 237 events. 3/237 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 699 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 184. Up to 9 conditions per place. [2023-08-04 01:43:21,079 INFO L119 LiptonReduction]: Number of co-enabled transitions 4004 [2023-08-04 01:43:23,770 INFO L134 LiptonReduction]: Checked pairs total: 12616 [2023-08-04 01:43:23,770 INFO L136 LiptonReduction]: Total number of compositions: 73 [2023-08-04 01:43:23,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:43:23,773 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;@5102a4a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:43:23,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 01:43:23,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:43:23,777 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2023-08-04 01:43:23,778 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 01:43:23,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:23,778 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-04 01:43:23,778 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:43:23,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -270956768, now seen corresponding path program 1 times [2023-08-04 01:43:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218402135] [2023-08-04 01:43:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:43:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:23,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218402135] [2023-08-04 01:43:23,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218402135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:43:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:43:23,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:43:23,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768543880] [2023-08-04 01:43:23,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:43:23,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:43:23,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:23,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:43:23,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:43:23,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 224 [2023-08-04 01:43:23,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:23,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:23,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 224 [2023-08-04 01:43:23,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:25,100 INFO L124 PetriNetUnfolderBase]: 9296/14201 cut-off events. [2023-08-04 01:43:25,101 INFO L125 PetriNetUnfolderBase]: For 1036/1036 co-relation queries the response was YES. [2023-08-04 01:43:25,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28414 conditions, 14201 events. 9296/14201 cut-off events. For 1036/1036 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 95073 event pairs, 6230 based on Foata normal form. 0/13843 useless extension candidates. Maximal degree in co-relation 4904. Up to 12874 conditions per place. [2023-08-04 01:43:25,200 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 35 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-04 01:43:25,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 196 flow [2023-08-04 01:43:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:43:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:43:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-04 01:43:25,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6324404761904762 [2023-08-04 01:43:25,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-04 01:43:25,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-04 01:43:25,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:25,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-04 01:43:25,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:25,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:25,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:25,212 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 106 flow. Second operand 3 states and 425 transitions. [2023-08-04 01:43:25,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 196 flow [2023-08-04 01:43:25,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 192 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 01:43:25,218 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 114 flow [2023-08-04 01:43:25,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-04 01:43:25,219 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-04 01:43:25,219 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 114 flow [2023-08-04 01:43:25,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:25,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:25,220 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 01:43:25,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 01:43:25,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:43:25,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash -991952740, now seen corresponding path program 1 times [2023-08-04 01:43:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699571195] [2023-08-04 01:43:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:43:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699571195] [2023-08-04 01:43:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699571195] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:43:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828773190] [2023-08-04 01:43:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:25,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:25,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:25,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:43:25,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 01:43:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:25,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:43:25,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:43:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:43:25,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:43:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828773190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:43:25,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:43:25,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 01:43:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680435104] [2023-08-04 01:43:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:43:25,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:43:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:25,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:43:25,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:43:25,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 224 [2023-08-04 01:43:25,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:25,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:25,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 224 [2023-08-04 01:43:25,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:26,664 INFO L124 PetriNetUnfolderBase]: 9212/13991 cut-off events. [2023-08-04 01:43:26,665 INFO L125 PetriNetUnfolderBase]: For 854/854 co-relation queries the response was YES. [2023-08-04 01:43:26,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28011 conditions, 13991 events. 9212/13991 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 93332 event pairs, 4865 based on Foata normal form. 49/13850 useless extension candidates. Maximal degree in co-relation 4667. Up to 12623 conditions per place. [2023-08-04 01:43:26,742 INFO L140 encePairwiseOnDemand]: 220/224 looper letters, 46 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-08-04 01:43:26,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 252 flow [2023-08-04 01:43:26,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:43:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:43:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-04 01:43:26,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6169642857142857 [2023-08-04 01:43:26,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-04 01:43:26,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-04 01:43:26,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:26,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-04 01:43:26,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:26,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:26,750 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:26,750 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 114 flow. Second operand 5 states and 691 transitions. [2023-08-04 01:43:26,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 252 flow [2023-08-04 01:43:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:43:26,753 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 128 flow [2023-08-04 01:43:26,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-04 01:43:26,755 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-04 01:43:26,755 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 128 flow [2023-08-04 01:43:26,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:26,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:26,756 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:43:26,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 01:43:26,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:26,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:43:26,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2112203128, now seen corresponding path program 1 times [2023-08-04 01:43:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514241168] [2023-08-04 01:43:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:43:27,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514241168] [2023-08-04 01:43:27,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514241168] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:43:27,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004618808] [2023-08-04 01:43:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:27,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:27,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:43:27,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 01:43:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:27,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:43:27,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:43:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:43:27,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:43:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:43:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004618808] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:43:27,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:43:27,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:43:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048374695] [2023-08-04 01:43:27,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:43:27,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:43:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:43:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:43:27,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 224 [2023-08-04 01:43:27,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:27,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:27,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 224 [2023-08-04 01:43:27,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:28,205 INFO L124 PetriNetUnfolderBase]: 8398/12659 cut-off events. [2023-08-04 01:43:28,205 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2023-08-04 01:43:28,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25441 conditions, 12659 events. 8398/12659 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 81941 event pairs, 4417 based on Foata normal form. 7/12378 useless extension candidates. Maximal degree in co-relation 4425. Up to 11383 conditions per place. [2023-08-04 01:43:28,276 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 46 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-04 01:43:28,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 258 flow [2023-08-04 01:43:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:43:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:43:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-04 01:43:28,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6272321428571429 [2023-08-04 01:43:28,279 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-04 01:43:28,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-04 01:43:28,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:28,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-04 01:43:28,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:28,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:28,283 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:28,283 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 128 flow. Second operand 4 states and 562 transitions. [2023-08-04 01:43:28,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 258 flow [2023-08-04 01:43:28,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 253 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 01:43:28,285 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 121 flow [2023-08-04 01:43:28,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-04 01:43:28,286 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-04 01:43:28,286 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 121 flow [2023-08-04 01:43:28,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:28,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:28,287 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:43:28,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 01:43:28,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:28,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:43:28,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -201726799, now seen corresponding path program 1 times [2023-08-04 01:43:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551594958] [2023-08-04 01:43:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:43:28,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:28,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551594958] [2023-08-04 01:43:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551594958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:43:28,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:43:28,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 01:43:28,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291444370] [2023-08-04 01:43:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:43:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:43:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:43:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:43:28,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 224 [2023-08-04 01:43:28,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:28,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:28,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 224 [2023-08-04 01:43:28,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:29,147 INFO L124 PetriNetUnfolderBase]: 4338/7137 cut-off events. [2023-08-04 01:43:29,148 INFO L125 PetriNetUnfolderBase]: For 725/725 co-relation queries the response was YES. [2023-08-04 01:43:29,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14501 conditions, 7137 events. 4338/7137 cut-off events. For 725/725 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 46292 event pairs, 138 based on Foata normal form. 1225/8350 useless extension candidates. Maximal degree in co-relation 5839. Up to 5166 conditions per place. [2023-08-04 01:43:29,164 INFO L140 encePairwiseOnDemand]: 222/224 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2023-08-04 01:43:29,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 289 flow [2023-08-04 01:43:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:43:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:43:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2023-08-04 01:43:29,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.640625 [2023-08-04 01:43:29,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2023-08-04 01:43:29,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2023-08-04 01:43:29,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:29,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2023-08-04 01:43:29,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:29,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:29,171 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:29,171 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 121 flow. Second operand 4 states and 574 transitions. [2023-08-04 01:43:29,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 289 flow [2023-08-04 01:43:29,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 282 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 01:43:29,191 INFO L231 Difference]: Finished difference. Result has 55 places, 0 transitions, 0 flow [2023-08-04 01:43:29,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=55, PETRI_TRANSITIONS=0} [2023-08-04 01:43:29,192 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-04 01:43:29,192 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 0 transitions, 0 flow [2023-08-04 01:43:29,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:29,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 01:43:29,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 01:43:29,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 01:43:29,193 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 01:43:29,193 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 01:43:29,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 151 transitions, 350 flow [2023-08-04 01:43:29,257 INFO L124 PetriNetUnfolderBase]: 117/784 cut-off events. [2023-08-04 01:43:29,257 INFO L125 PetriNetUnfolderBase]: For 72/88 co-relation queries the response was YES. [2023-08-04 01:43:29,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 784 events. 117/784 cut-off events. For 72/88 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4199 event pairs, 2 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 467. Up to 32 conditions per place. [2023-08-04 01:43:29,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 151 transitions, 350 flow [2023-08-04 01:43:29,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 318 flow [2023-08-04 01:43:29,262 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:43:29,262 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 318 flow [2023-08-04 01:43:29,263 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 318 flow [2023-08-04 01:43:29,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 318 flow [2023-08-04 01:43:29,305 INFO L124 PetriNetUnfolderBase]: 101/620 cut-off events. [2023-08-04 01:43:29,305 INFO L125 PetriNetUnfolderBase]: For 68/76 co-relation queries the response was YES. [2023-08-04 01:43:29,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 620 events. 101/620 cut-off events. For 68/76 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3046 event pairs, 2 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 381. Up to 32 conditions per place. [2023-08-04 01:43:29,317 INFO L119 LiptonReduction]: Number of co-enabled transitions 6752 [2023-08-04 01:43:32,012 INFO L134 LiptonReduction]: Checked pairs total: 24924 [2023-08-04 01:43:32,012 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-08-04 01:43:32,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 01:43:32,014 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;@5102a4a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:43:32,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 01:43:32,016 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:43:32,016 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 01:43:32,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:43:32,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:32,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 01:43:32,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:43:32,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 704305879, now seen corresponding path program 1 times [2023-08-04 01:43:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031860776] [2023-08-04 01:43:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:43:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031860776] [2023-08-04 01:43:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031860776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:43:32,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:43:32,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:43:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535366028] [2023-08-04 01:43:32,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:43:32,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:43:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:43:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:43:32,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 237 [2023-08-04 01:43:32,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:32,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:32,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 237 [2023-08-04 01:43:32,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:36,349 INFO L124 PetriNetUnfolderBase]: 54246/79775 cut-off events. [2023-08-04 01:43:36,350 INFO L125 PetriNetUnfolderBase]: For 4907/4907 co-relation queries the response was YES. [2023-08-04 01:43:36,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156690 conditions, 79775 events. 54246/79775 cut-off events. For 4907/4907 co-relation queries the response was YES. Maximal size of possible extension queue 2338. Compared 596666 event pairs, 37616 based on Foata normal form. 0/71912 useless extension candidates. Maximal degree in co-relation 27322. Up to 73238 conditions per place. [2023-08-04 01:43:36,835 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 51 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-04 01:43:36,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 276 flow [2023-08-04 01:43:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:43:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:43:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-04 01:43:36,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.620253164556962 [2023-08-04 01:43:36,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-04 01:43:36,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-04 01:43:36,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:36,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-04 01:43:36,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:36,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:36,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:36,843 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 154 flow. Second operand 3 states and 441 transitions. [2023-08-04 01:43:36,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 276 flow [2023-08-04 01:43:36,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:43:36,892 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 160 flow [2023-08-04 01:43:36,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-08-04 01:43:36,893 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2023-08-04 01:43:36,893 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 160 flow [2023-08-04 01:43:36,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:36,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:36,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:43:36,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 01:43:36,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:43:36,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1736559845, now seen corresponding path program 1 times [2023-08-04 01:43:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:36,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329269323] [2023-08-04 01:43:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:43:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329269323] [2023-08-04 01:43:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329269323] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:43:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886274720] [2023-08-04 01:43:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:36,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:36,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:36,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:43:36,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 01:43:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:37,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:43:37,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:43:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 01:43:37,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:43:37,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886274720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:43:37,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:43:37,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:43:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628453317] [2023-08-04 01:43:37,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:43:37,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:43:37,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:37,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:43:37,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:43:37,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 237 [2023-08-04 01:43:37,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:37,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:37,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 237 [2023-08-04 01:43:37,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:41,092 INFO L124 PetriNetUnfolderBase]: 54190/79738 cut-off events. [2023-08-04 01:43:41,093 INFO L125 PetriNetUnfolderBase]: For 3687/3687 co-relation queries the response was YES. [2023-08-04 01:43:41,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156432 conditions, 79738 events. 54190/79738 cut-off events. For 3687/3687 co-relation queries the response was YES. Maximal size of possible extension queue 2389. Compared 600205 event pairs, 38944 based on Foata normal form. 0/72806 useless extension candidates. Maximal degree in co-relation 156372. Up to 72169 conditions per place. [2023-08-04 01:43:41,449 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 62 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-04 01:43:41,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 324 flow [2023-08-04 01:43:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:43:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:43:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-08-04 01:43:41,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6343178621659634 [2023-08-04 01:43:41,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-08-04 01:43:41,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-08-04 01:43:41,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:41,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-08-04 01:43:41,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:41,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:41,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:41,454 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 160 flow. Second operand 3 states and 451 transitions. [2023-08-04 01:43:41,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 324 flow [2023-08-04 01:43:41,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:43:41,459 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 170 flow [2023-08-04 01:43:41,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2023-08-04 01:43:41,460 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-08-04 01:43:41,460 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 170 flow [2023-08-04 01:43:41,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:41,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:41,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:43:41,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 01:43:41,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:41,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:43:41,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1626577388, now seen corresponding path program 1 times [2023-08-04 01:43:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167062125] [2023-08-04 01:43:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 01:43:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167062125] [2023-08-04 01:43:41,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167062125] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:43:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147583031] [2023-08-04 01:43:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:41,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:41,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:43:41,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 01:43:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:41,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:43:41,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:43:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 01:43:41,801 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:43:41,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147583031] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:43:41,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:43:41,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:43:41,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947336735] [2023-08-04 01:43:41,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:43:41,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:43:41,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:41,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:43:41,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:43:41,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 237 [2023-08-04 01:43:41,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:41,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:41,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 237 [2023-08-04 01:43:41,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:45,240 INFO L124 PetriNetUnfolderBase]: 41365/60213 cut-off events. [2023-08-04 01:43:45,241 INFO L125 PetriNetUnfolderBase]: For 5494/5494 co-relation queries the response was YES. [2023-08-04 01:43:45,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123744 conditions, 60213 events. 41365/60213 cut-off events. For 5494/5494 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 429030 event pairs, 27642 based on Foata normal form. 0/57370 useless extension candidates. Maximal degree in co-relation 52750. Up to 39798 conditions per place. [2023-08-04 01:43:45,479 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 71 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-08-04 01:43:45,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 378 flow [2023-08-04 01:43:45,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:43:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:43:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-04 01:43:45,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6455696202531646 [2023-08-04 01:43:45,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-04 01:43:45,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-04 01:43:45,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:45,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-04 01:43:45,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:45,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:45,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:45,485 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 170 flow. Second operand 3 states and 459 transitions. [2023-08-04 01:43:45,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 378 flow [2023-08-04 01:43:45,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:43:45,490 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 180 flow [2023-08-04 01:43:45,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=60, 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=180, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-08-04 01:43:45,491 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2023-08-04 01:43:45,491 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 180 flow [2023-08-04 01:43:45,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:45,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:45,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:43:45,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 01:43:45,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:45,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:43:45,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash 933849202, now seen corresponding path program 1 times [2023-08-04 01:43:45,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286893250] [2023-08-04 01:43:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 01:43:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:45,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286893250] [2023-08-04 01:43:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286893250] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:43:45,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705134197] [2023-08-04 01:43:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:45,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:43:45,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 01:43:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:45,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:43:45,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:43:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 01:43:45,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:43:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705134197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:43:45,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:43:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 01:43:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449752276] [2023-08-04 01:43:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:43:45,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:43:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:45,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:43:45,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:43:45,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 237 [2023-08-04 01:43:45,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:45,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:45,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 237 [2023-08-04 01:43:45,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:49,168 INFO L124 PetriNetUnfolderBase]: 39882/59146 cut-off events. [2023-08-04 01:43:49,169 INFO L125 PetriNetUnfolderBase]: For 14866/14866 co-relation queries the response was YES. [2023-08-04 01:43:49,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125714 conditions, 59146 events. 39882/59146 cut-off events. For 14866/14866 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 426746 event pairs, 33977 based on Foata normal form. 0/57890 useless extension candidates. Maximal degree in co-relation 53973. Up to 47158 conditions per place. [2023-08-04 01:43:49,404 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 72 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-04 01:43:49,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 390 flow [2023-08-04 01:43:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:43:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:43:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-04 01:43:49,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6455696202531646 [2023-08-04 01:43:49,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-04 01:43:49,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-04 01:43:49,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:49,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-04 01:43:49,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:49,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:49,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:49,409 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 180 flow. Second operand 3 states and 459 transitions. [2023-08-04 01:43:49,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 390 flow [2023-08-04 01:43:49,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:43:49,541 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 190 flow [2023-08-04 01:43:49,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=190, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-08-04 01:43:49,542 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-08-04 01:43:49,542 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 190 flow [2023-08-04 01:43:49,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:49,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:49,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:43:49,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 01:43:49,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-04 01:43:49,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:43:49,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash 392172446, now seen corresponding path program 1 times [2023-08-04 01:43:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:49,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061359460] [2023-08-04 01:43:49,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:49,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 01:43:49,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:49,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061359460] [2023-08-04 01:43:49,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061359460] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:43:49,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545481247] [2023-08-04 01:43:49,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:49,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:49,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:49,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:43:49,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 01:43:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:49,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:43:50,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:43:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 01:43:50,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:43:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 01:43:50,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545481247] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:43:50,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:43:50,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:43:50,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142003281] [2023-08-04 01:43:50,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:43:50,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:43:50,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:50,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:43:50,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:43:50,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 237 [2023-08-04 01:43:50,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:50,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:50,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 237 [2023-08-04 01:43:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:53,245 INFO L124 PetriNetUnfolderBase]: 37383/55369 cut-off events. [2023-08-04 01:43:53,245 INFO L125 PetriNetUnfolderBase]: For 10190/10190 co-relation queries the response was YES. [2023-08-04 01:43:53,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118186 conditions, 55369 events. 37383/55369 cut-off events. For 10190/10190 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 395498 event pairs, 21301 based on Foata normal form. 7/54752 useless extension candidates. Maximal degree in co-relation 94551. Up to 51238 conditions per place. [2023-08-04 01:43:53,481 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 65 selfloop transitions, 3 changer transitions 1/81 dead transitions. [2023-08-04 01:43:53,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 368 flow [2023-08-04 01:43:53,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:43:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:43:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-08-04 01:43:53,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6107594936708861 [2023-08-04 01:43:53,483 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-08-04 01:43:53,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-08-04 01:43:53,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:53,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-08-04 01:43:53,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:53,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:53,486 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:53,487 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 190 flow. Second operand 4 states and 579 transitions. [2023-08-04 01:43:53,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 368 flow [2023-08-04 01:43:54,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:43:54,360 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 202 flow [2023-08-04 01:43:54,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=188, 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=202, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-04 01:43:54,362 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2023-08-04 01:43:54,362 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 202 flow [2023-08-04 01:43:54,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:54,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:54,363 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:43:54,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 01:43:54,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:54,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:43:54,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 347881855, now seen corresponding path program 1 times [2023-08-04 01:43:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831252528] [2023-08-04 01:43:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:43:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831252528] [2023-08-04 01:43:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831252528] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:43:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777663668] [2023-08-04 01:43:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:54,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:54,641 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:43:54,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 01:43:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:54,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:43:54,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:43:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:43:54,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:43:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:43:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777663668] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:43:54,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:43:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:43:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068064652] [2023-08-04 01:43:54,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:43:54,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:43:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:54,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:43:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:43:54,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 237 [2023-08-04 01:43:54,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:54,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:54,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 237 [2023-08-04 01:43:54,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:43:57,706 INFO L124 PetriNetUnfolderBase]: 35748/52200 cut-off events. [2023-08-04 01:43:57,706 INFO L125 PetriNetUnfolderBase]: For 7195/7195 co-relation queries the response was YES. [2023-08-04 01:43:57,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111922 conditions, 52200 events. 35748/52200 cut-off events. For 7195/7195 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 361050 event pairs, 15364 based on Foata normal form. 245/52228 useless extension candidates. Maximal degree in co-relation 88525. Up to 36961 conditions per place. [2023-08-04 01:43:57,908 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 83 selfloop transitions, 3 changer transitions 1/99 dead transitions. [2023-08-04 01:43:57,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 452 flow [2023-08-04 01:43:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:43:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:43:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-08-04 01:43:57,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.629746835443038 [2023-08-04 01:43:57,910 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-08-04 01:43:57,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-08-04 01:43:57,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:43:57,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-08-04 01:43:57,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:57,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:57,913 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:57,914 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 202 flow. Second operand 4 states and 597 transitions. [2023-08-04 01:43:57,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 452 flow [2023-08-04 01:43:58,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 443 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:43:58,494 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 207 flow [2023-08-04 01:43:58,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=66, 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=207, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-04 01:43:58,495 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2023-08-04 01:43:58,495 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 207 flow [2023-08-04 01:43:58,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:58,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:43:58,495 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:43:58,500 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-04 01:43:58,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:58,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:43:58,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:43:58,697 INFO L85 PathProgramCache]: Analyzing trace with hash -998454690, now seen corresponding path program 1 times [2023-08-04 01:43:58,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:43:58,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194914520] [2023-08-04 01:43:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:43:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 01:43:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:43:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194914520] [2023-08-04 01:43:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194914520] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:43:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626246679] [2023-08-04 01:43:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:43:58,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:43:58,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:43:58,761 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:43:58,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 01:43:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:43:58,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:43:58,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:43:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 01:43:58,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:43:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 01:43:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626246679] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:43:58,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:43:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:43:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322678835] [2023-08-04 01:43:58,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:43:58,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:43:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:43:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:43:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:43:58,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 237 [2023-08-04 01:43:58,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:43:58,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:43:58,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 237 [2023-08-04 01:43:58,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:44:01,104 INFO L124 PetriNetUnfolderBase]: 25774/37816 cut-off events. [2023-08-04 01:44:01,104 INFO L125 PetriNetUnfolderBase]: For 18374/18374 co-relation queries the response was YES. [2023-08-04 01:44:01,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85053 conditions, 37816 events. 25774/37816 cut-off events. For 18374/18374 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 251561 event pairs, 10333 based on Foata normal form. 840/38357 useless extension candidates. Maximal degree in co-relation 81493. Up to 14584 conditions per place. [2023-08-04 01:44:01,231 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 91 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2023-08-04 01:44:01,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 498 flow [2023-08-04 01:44:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:44:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:44:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2023-08-04 01:44:01,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6381856540084389 [2023-08-04 01:44:01,233 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2023-08-04 01:44:01,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2023-08-04 01:44:01,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:44:01,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2023-08-04 01:44:01,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:01,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:01,236 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:01,236 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 207 flow. Second operand 4 states and 605 transitions. [2023-08-04 01:44:01,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 498 flow [2023-08-04 01:44:01,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 488 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:44:01,363 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 218 flow [2023-08-04 01:44:01,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=73, PETRI_TRANSITIONS=62} [2023-08-04 01:44:01,364 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2023-08-04 01:44:01,364 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 218 flow [2023-08-04 01:44:01,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:01,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:44:01,365 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:44:01,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 01:44:01,566 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,SelfDestructingSolverStorable12 [2023-08-04 01:44:01,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:44:01,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:44:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1562319575, now seen corresponding path program 1 times [2023-08-04 01:44:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:44:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524230278] [2023-08-04 01:44:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:44:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 01:44:01,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:44:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524230278] [2023-08-04 01:44:01,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524230278] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:44:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753778595] [2023-08-04 01:44:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:01,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:44:01,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:44:01,637 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:44:01,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 01:44:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:01,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:44:01,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:44:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 01:44:01,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:44:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 01:44:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753778595] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:44:01,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:44:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:44:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077314253] [2023-08-04 01:44:01,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:44:01,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:44:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:44:01,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:44:01,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:44:01,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 237 [2023-08-04 01:44:01,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:01,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:44:01,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 237 [2023-08-04 01:44:01,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:44:04,026 INFO L124 PetriNetUnfolderBase]: 25754/37773 cut-off events. [2023-08-04 01:44:04,026 INFO L125 PetriNetUnfolderBase]: For 23422/23422 co-relation queries the response was YES. [2023-08-04 01:44:04,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88589 conditions, 37773 events. 25754/37773 cut-off events. For 23422/23422 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 251415 event pairs, 24887 based on Foata normal form. 25/37107 useless extension candidates. Maximal degree in co-relation 84921. Up to 33981 conditions per place. [2023-08-04 01:44:04,183 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 91 selfloop transitions, 3 changer transitions 2/108 dead transitions. [2023-08-04 01:44:04,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 108 transitions, 510 flow [2023-08-04 01:44:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:44:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:44:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2023-08-04 01:44:04,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6381856540084389 [2023-08-04 01:44:04,185 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2023-08-04 01:44:04,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2023-08-04 01:44:04,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:44:04,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2023-08-04 01:44:04,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:04,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:04,188 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:04,188 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 218 flow. Second operand 4 states and 605 transitions. [2023-08-04 01:44:04,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 108 transitions, 510 flow [2023-08-04 01:44:04,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 108 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 01:44:04,588 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 222 flow [2023-08-04 01:44:04,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, 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=77, PETRI_TRANSITIONS=61} [2023-08-04 01:44:04,588 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-08-04 01:44:04,589 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 222 flow [2023-08-04 01:44:04,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:04,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:44:04,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:44:04,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 01:44:04,789 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,SelfDestructingSolverStorable13 [2023-08-04 01:44:04,790 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:44:04,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:44:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2100057785, now seen corresponding path program 1 times [2023-08-04 01:44:04,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:44:04,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991299934] [2023-08-04 01:44:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:44:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 01:44:05,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:44:05,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991299934] [2023-08-04 01:44:05,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991299934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:44:05,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:44:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 01:44:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314940943] [2023-08-04 01:44:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:44:05,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:44:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:44:05,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:44:05,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:44:05,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 237 [2023-08-04 01:44:05,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:05,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:44:05,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 237 [2023-08-04 01:44:05,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:44:05,943 INFO L124 PetriNetUnfolderBase]: 6409/12731 cut-off events. [2023-08-04 01:44:05,943 INFO L125 PetriNetUnfolderBase]: For 14535/14535 co-relation queries the response was YES. [2023-08-04 01:44:05,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33599 conditions, 12731 events. 6409/12731 cut-off events. For 14535/14535 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 105334 event pairs, 2089 based on Foata normal form. 6892/19479 useless extension candidates. Maximal degree in co-relation 33247. Up to 9024 conditions per place. [2023-08-04 01:44:05,996 INFO L140 encePairwiseOnDemand]: 221/237 looper letters, 64 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2023-08-04 01:44:05,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 86 transitions, 516 flow [2023-08-04 01:44:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:44:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:44:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-04 01:44:06,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5949367088607594 [2023-08-04 01:44:06,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-04 01:44:06,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-04 01:44:06,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:44:06,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-04 01:44:06,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:06,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:06,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:06,002 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 222 flow. Second operand 3 states and 423 transitions. [2023-08-04 01:44:06,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 86 transitions, 516 flow [2023-08-04 01:44:06,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 86 transitions, 503 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:44:06,079 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 246 flow [2023-08-04 01:44:06,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2023-08-04 01:44:06,080 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2023-08-04 01:44:06,080 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 246 flow [2023-08-04 01:44:06,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:06,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:44:06,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:44:06,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 01:44:06,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:44:06,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:44:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2020203723, now seen corresponding path program 2 times [2023-08-04 01:44:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:44:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799422490] [2023-08-04 01:44:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:06,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:44:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:44:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:44:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799422490] [2023-08-04 01:44:07,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799422490] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:44:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250802009] [2023-08-04 01:44:07,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 01:44:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:44:07,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:44:07,209 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:44:07,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 01:44:07,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 01:44:07,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 01:44:07,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-04 01:44:07,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:44:07,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-04 01:44:07,420 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 13 treesize of output 9 [2023-08-04 01:44:07,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-04 01:44:07,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 01:44:07,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 01:44:07,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-04 01:44:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:44:07,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:44:08,161 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (<= .cse0 2147483647) (not (= .cse0 (+ c_thread2Thread1of2ForFork1_thidvar0 4294967296)))))) (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse1) (not (= .cse1 c_thread2Thread1of2ForFork1_thidvar0)))))) is different from false [2023-08-04 01:44:08,304 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse0 (+ 4294967296 |c_#pthreadsForks|))) (<= .cse0 2147483647)))) (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse1) (not (= .cse1 |c_#pthreadsForks|)))))) is different from false [2023-08-04 01:44:08,863 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 01:44:08,863 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 68 treesize of output 53 [2023-08-04 01:44:08,873 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 01:44:08,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2023-08-04 01:44:08,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-08-04 01:44:08,920 INFO L322 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-08-04 01:44:08,920 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 1 [2023-08-04 01:44:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2023-08-04 01:44:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250802009] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:44:08,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:44:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 31 [2023-08-04 01:44:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215563245] [2023-08-04 01:44:08,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:44:08,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-04 01:44:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:44:08,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-04 01:44:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=777, Unknown=15, NotChecked=114, Total=992 [2023-08-04 01:44:08,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 237 [2023-08-04 01:44:08,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 246 flow. Second operand has 32 states, 32 states have (on average 92.0) internal successors, (2944), 32 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:08,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:44:08,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 237 [2023-08-04 01:44:08,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:44:16,221 INFO L124 PetriNetUnfolderBase]: 6486/12496 cut-off events. [2023-08-04 01:44:16,221 INFO L125 PetriNetUnfolderBase]: For 6227/6227 co-relation queries the response was YES. [2023-08-04 01:44:16,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34846 conditions, 12496 events. 6486/12496 cut-off events. For 6227/6227 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 98791 event pairs, 102 based on Foata normal form. 198/12694 useless extension candidates. Maximal degree in co-relation 34520. Up to 2583 conditions per place. [2023-08-04 01:44:16,270 INFO L140 encePairwiseOnDemand]: 221/237 looper letters, 276 selfloop transitions, 20 changer transitions 0/305 dead transitions. [2023-08-04 01:44:16,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 305 transitions, 1554 flow [2023-08-04 01:44:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-04 01:44:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-04 01:44:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2057 transitions. [2023-08-04 01:44:16,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4339662447257384 [2023-08-04 01:44:16,275 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2057 transitions. [2023-08-04 01:44:16,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2057 transitions. [2023-08-04 01:44:16,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:44:16,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2057 transitions. [2023-08-04 01:44:16,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 102.85) internal successors, (2057), 20 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:16,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 237.0) internal successors, (4977), 21 states have internal predecessors, (4977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:16,286 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 237.0) internal successors, (4977), 21 states have internal predecessors, (4977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:16,286 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 246 flow. Second operand 20 states and 2057 transitions. [2023-08-04 01:44:16,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 305 transitions, 1554 flow [2023-08-04 01:44:16,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 305 transitions, 1429 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:44:16,409 INFO L231 Difference]: Finished difference. Result has 97 places, 67 transitions, 300 flow [2023-08-04 01:44:16,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=300, PETRI_PLACES=97, PETRI_TRANSITIONS=67} [2023-08-04 01:44:16,410 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 39 predicate places. [2023-08-04 01:44:16,410 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 67 transitions, 300 flow [2023-08-04 01:44:16,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 92.0) internal successors, (2944), 32 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:16,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:44:16,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:44:16,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 01:44:16,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 01:44:16,618 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:44:16,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:44:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash -377379171, now seen corresponding path program 3 times [2023-08-04 01:44:16,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:44:16,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889851596] [2023-08-04 01:44:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:44:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:44:17,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:44:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889851596] [2023-08-04 01:44:17,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889851596] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:44:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729841402] [2023-08-04 01:44:17,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 01:44:17,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:44:17,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:44:17,509 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:44:17,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 01:44:17,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 01:44:17,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 01:44:17,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-04 01:44:17,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:44:17,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 01:44:17,901 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-04 01:44:17,901 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-04 01:44:18,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-04 01:44:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:44:18,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:44:18,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-08-04 01:44:18,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-08-04 01:44:18,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-08-04 01:44:18,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-08-04 01:44:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:44:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729841402] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:44:19,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:44:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2023-08-04 01:44:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066355719] [2023-08-04 01:44:19,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:44:19,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-04 01:44:19,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:44:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-04 01:44:19,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2023-08-04 01:44:21,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 237 [2023-08-04 01:44:21,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 67 transitions, 300 flow. Second operand has 32 states, 32 states have (on average 106.625) internal successors, (3412), 32 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:21,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:44:21,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 237 [2023-08-04 01:44:21,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:44:25,729 INFO L124 PetriNetUnfolderBase]: 5900/11386 cut-off events. [2023-08-04 01:44:25,730 INFO L125 PetriNetUnfolderBase]: For 6526/6526 co-relation queries the response was YES. [2023-08-04 01:44:25,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33698 conditions, 11386 events. 5900/11386 cut-off events. For 6526/6526 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 89122 event pairs, 324 based on Foata normal form. 105/11491 useless extension candidates. Maximal degree in co-relation 33379. Up to 3896 conditions per place. [2023-08-04 01:44:25,768 INFO L140 encePairwiseOnDemand]: 217/237 looper letters, 288 selfloop transitions, 23 changer transitions 0/319 dead transitions. [2023-08-04 01:44:25,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 319 transitions, 1547 flow [2023-08-04 01:44:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 01:44:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 01:44:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2557 transitions. [2023-08-04 01:44:25,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4904104334484081 [2023-08-04 01:44:25,774 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2557 transitions. [2023-08-04 01:44:25,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2557 transitions. [2023-08-04 01:44:25,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:44:25,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2557 transitions. [2023-08-04 01:44:25,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 116.22727272727273) internal successors, (2557), 22 states have internal predecessors, (2557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:25,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 237.0) internal successors, (5451), 23 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:25,786 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 237.0) internal successors, (5451), 23 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:25,786 INFO L175 Difference]: Start difference. First operand has 97 places, 67 transitions, 300 flow. Second operand 22 states and 2557 transitions. [2023-08-04 01:44:25,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 319 transitions, 1547 flow [2023-08-04 01:44:25,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 319 transitions, 1491 flow, removed 9 selfloop flow, removed 15 redundant places. [2023-08-04 01:44:25,950 INFO L231 Difference]: Finished difference. Result has 105 places, 68 transitions, 302 flow [2023-08-04 01:44:25,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=302, PETRI_PLACES=105, PETRI_TRANSITIONS=68} [2023-08-04 01:44:25,951 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 47 predicate places. [2023-08-04 01:44:25,951 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 68 transitions, 302 flow [2023-08-04 01:44:25,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 106.625) internal successors, (3412), 32 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:25,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:44:25,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:44:25,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 01:44:26,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 01:44:26,163 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:44:26,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:44:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash 303220493, now seen corresponding path program 1 times [2023-08-04 01:44:26,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:44:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089034039] [2023-08-04 01:44:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:44:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:44:27,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:44:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089034039] [2023-08-04 01:44:27,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089034039] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:44:27,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053455534] [2023-08-04 01:44:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:44:27,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:44:27,056 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:44:27,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 01:44:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:27,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-04 01:44:27,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:44:27,216 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-04 01:44:27,421 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 11 treesize of output 7 [2023-08-04 01:44:27,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 01:44:27,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-04 01:44:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:44:28,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:44:29,750 INFO L322 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2023-08-04 01:44:29,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 265 treesize of output 219 [2023-08-04 01:44:32,046 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-04 01:44:32,050 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-04 01:44:32,056 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-04 01:44:32,059 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-04 01:44:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 01:44:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053455534] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:44:32,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:44:32,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 38 [2023-08-04 01:44:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597951789] [2023-08-04 01:44:32,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:44:32,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-04 01:44:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:44:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-04 01:44:32,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1193, Unknown=3, NotChecked=0, Total=1406 [2023-08-04 01:44:33,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 237 [2023-08-04 01:44:33,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 68 transitions, 302 flow. Second operand has 38 states, 38 states have (on average 87.0) internal successors, (3306), 38 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:33,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:44:33,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 237 [2023-08-04 01:44:33,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:44:36,777 INFO L124 PetriNetUnfolderBase]: 4923/9670 cut-off events. [2023-08-04 01:44:36,777 INFO L125 PetriNetUnfolderBase]: For 5778/5778 co-relation queries the response was YES. [2023-08-04 01:44:36,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28870 conditions, 9670 events. 4923/9670 cut-off events. For 5778/5778 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 75412 event pairs, 12 based on Foata normal form. 60/9712 useless extension candidates. Maximal degree in co-relation 28580. Up to 3896 conditions per place. [2023-08-04 01:44:36,823 INFO L140 encePairwiseOnDemand]: 218/237 looper letters, 250 selfloop transitions, 24 changer transitions 0/284 dead transitions. [2023-08-04 01:44:36,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 284 transitions, 1390 flow [2023-08-04 01:44:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 01:44:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 01:44:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2101 transitions. [2023-08-04 01:44:36,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4029535864978903 [2023-08-04 01:44:36,828 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2101 transitions. [2023-08-04 01:44:36,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2101 transitions. [2023-08-04 01:44:36,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:44:36,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2101 transitions. [2023-08-04 01:44:36,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 95.5) internal successors, (2101), 22 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:36,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 237.0) internal successors, (5451), 23 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:36,837 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 237.0) internal successors, (5451), 23 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:36,837 INFO L175 Difference]: Start difference. First operand has 105 places, 68 transitions, 302 flow. Second operand 22 states and 2101 transitions. [2023-08-04 01:44:36,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 284 transitions, 1390 flow [2023-08-04 01:44:36,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 284 transitions, 1324 flow, removed 4 selfloop flow, removed 25 redundant places. [2023-08-04 01:44:36,987 INFO L231 Difference]: Finished difference. Result has 102 places, 67 transitions, 286 flow [2023-08-04 01:44:36,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=286, PETRI_PLACES=102, PETRI_TRANSITIONS=67} [2023-08-04 01:44:36,987 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 44 predicate places. [2023-08-04 01:44:36,987 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 67 transitions, 286 flow [2023-08-04 01:44:36,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 87.0) internal successors, (3306), 38 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:36,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:44:36,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:44:36,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 01:44:37,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 01:44:37,189 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:44:37,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:44:37,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2086359165, now seen corresponding path program 1 times [2023-08-04 01:44:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:44:37,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126421549] [2023-08-04 01:44:37,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:37,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:44:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:44:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:44:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126421549] [2023-08-04 01:44:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126421549] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:44:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230171944] [2023-08-04 01:44:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:38,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:44:38,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:44:38,094 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:44:38,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 01:44:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:44:38,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-04 01:44:38,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:44:38,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-04 01:44:38,278 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 13 treesize of output 9 [2023-08-04 01:44:38,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-04 01:44:38,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 01:44:38,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 01:44:38,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-04 01:44:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:44:38,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:44:39,245 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse0) (not (= .cse0 (+ |c_#pthreadsForks| 1)))))) (forall ((v_ArrVal_1021 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse1 (+ 4294967297 |c_#pthreadsForks|))) (<= .cse1 2147483647))))) is different from false [2023-08-04 01:44:39,410 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| (* |c_ULTIMATE.start_main_~asdf~0#1| 4)))) (and (forall ((v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1018 Int)) (let ((.cse0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| (store .cse1 .cse2 v_ArrVal_1018)) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse0 (+ |c_#pthreadsForks| 4294967298))) (<= .cse0 2147483647)))) (forall ((v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1018 Int)) (let ((.cse3 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| (store .cse1 .cse2 v_ArrVal_1018)) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse3) (not (= (+ 2 |c_#pthreadsForks|) .cse3))))))) is different from false [2023-08-04 01:44:41,049 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 01:44:41,049 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 68 treesize of output 53 [2023-08-04 01:44:41,057 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 01:44:41,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2023-08-04 01:44:41,061 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-08-04 01:44:41,090 INFO L322 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-08-04 01:44:41,090 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 1 [2023-08-04 01:44:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2023-08-04 01:44:41,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230171944] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:44:41,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:44:41,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 34 [2023-08-04 01:44:41,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738867259] [2023-08-04 01:44:41,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:44:41,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-04 01:44:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:44:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-04 01:44:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=956, Unknown=10, NotChecked=126, Total=1190 [2023-08-04 01:44:41,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 237 [2023-08-04 01:44:41,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 67 transitions, 286 flow. Second operand has 35 states, 35 states have (on average 68.62857142857143) internal successors, (2402), 35 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:41,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:44:41,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 237 [2023-08-04 01:44:41,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:44:47,746 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-04 01:44:49,883 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-04 01:44:52,121 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-04 01:44:55,847 INFO L124 PetriNetUnfolderBase]: 5538/10685 cut-off events. [2023-08-04 01:44:55,848 INFO L125 PetriNetUnfolderBase]: For 4275/4275 co-relation queries the response was YES. [2023-08-04 01:44:55,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29719 conditions, 10685 events. 5538/10685 cut-off events. For 4275/4275 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 78834 event pairs, 0 based on Foata normal form. 162/10847 useless extension candidates. Maximal degree in co-relation 29483. Up to 2682 conditions per place. [2023-08-04 01:44:55,885 INFO L140 encePairwiseOnDemand]: 207/237 looper letters, 347 selfloop transitions, 36 changer transitions 1/386 dead transitions. [2023-08-04 01:44:55,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 386 transitions, 1878 flow [2023-08-04 01:44:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-04 01:44:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-04 01:44:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1921 transitions. [2023-08-04 01:44:55,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33772855133614627 [2023-08-04 01:44:55,888 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1921 transitions. [2023-08-04 01:44:55,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1921 transitions. [2023-08-04 01:44:55,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:44:55,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1921 transitions. [2023-08-04 01:44:55,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 80.04166666666667) internal successors, (1921), 24 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:55,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 237.0) internal successors, (5925), 25 states have internal predecessors, (5925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:55,897 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 237.0) internal successors, (5925), 25 states have internal predecessors, (5925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:55,897 INFO L175 Difference]: Start difference. First operand has 102 places, 67 transitions, 286 flow. Second operand 24 states and 1921 transitions. [2023-08-04 01:44:55,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 386 transitions, 1878 flow [2023-08-04 01:44:56,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 386 transitions, 1801 flow, removed 8 selfloop flow, removed 27 redundant places. [2023-08-04 01:44:56,030 INFO L231 Difference]: Finished difference. Result has 99 places, 77 transitions, 337 flow [2023-08-04 01:44:56,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=337, PETRI_PLACES=99, PETRI_TRANSITIONS=77} [2023-08-04 01:44:56,031 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 41 predicate places. [2023-08-04 01:44:56,031 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 77 transitions, 337 flow [2023-08-04 01:44:56,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 68.62857142857143) internal successors, (2402), 35 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:44:56,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:44:56,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:44:56,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 01:44:56,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:44:56,232 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:44:56,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:44:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash 35196041, now seen corresponding path program 1 times [2023-08-04 01:44:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:44:56,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855909853] [2023-08-04 01:44:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:44:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:44:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:44:56,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:44:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:44:56,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:44:56,307 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:44:56,308 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 01:44:56,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 01:44:56,308 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:44:56,308 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (2/2) [2023-08-04 01:44:56,310 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 01:44:56,310 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 01:44:56,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 01:44:56 BasicIcfg [2023-08-04 01:44:56,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 01:44:56,404 INFO L158 Benchmark]: Toolchain (without parser) took 99717.29ms. Allocated memory was 526.4MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 474.2MB in the beginning and 8.8GB in the end (delta: -8.3GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. [2023-08-04 01:44:56,407 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 367.0MB. Free memory was 319.2MB in the beginning and 319.0MB in the end (delta: 161.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 01:44:56,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.12ms. Allocated memory is still 526.4MB. Free memory was 473.9MB in the beginning and 454.2MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 01:44:56,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.00ms. Allocated memory is still 526.4MB. Free memory was 454.2MB in the beginning and 452.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 01:44:56,410 INFO L158 Benchmark]: Boogie Preprocessor took 33.82ms. Allocated memory is still 526.4MB. Free memory was 452.1MB in the beginning and 450.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 01:44:56,410 INFO L158 Benchmark]: RCFGBuilder took 423.93ms. Allocated memory is still 526.4MB. Free memory was 450.4MB in the beginning and 482.4MB in the end (delta: -32.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.0GB. [2023-08-04 01:44:56,410 INFO L158 Benchmark]: TraceAbstraction took 98842.55ms. Allocated memory was 526.4MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 481.7MB in the beginning and 8.8GB in the end (delta: -8.3GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. [2023-08-04 01:44:56,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 367.0MB. Free memory was 319.2MB in the beginning and 319.0MB in the end (delta: 161.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 353.12ms. Allocated memory is still 526.4MB. Free memory was 473.9MB in the beginning and 454.2MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.00ms. Allocated memory is still 526.4MB. Free memory was 454.2MB in the beginning and 452.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.82ms. Allocated memory is still 526.4MB. Free memory was 452.1MB in the beginning and 450.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 423.93ms. Allocated memory is still 526.4MB. Free memory was 450.4MB in the beginning and 482.4MB in the end (delta: -32.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.0GB. * TraceAbstraction took 98842.55ms. Allocated memory was 526.4MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 481.7MB in the beginning and 8.8GB in the end (delta: -8.3GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 257]: Unsoundness Warning unspecified type, defaulting to int C: short [257] - GenericResultAtLocation [Line: 257]: Unsoundness Warning unspecified type, defaulting to int C: short [257] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 87 PlacesBefore, 28 PlacesAfterwards, 83 TransitionsBefore, 23 TransitionsAfterwards, 1270 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 63 TotalNumberOfCompositions, 3107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1721, independent: 1568, independent conditional: 0, independent unconditional: 1568, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 667, independent: 642, independent conditional: 0, independent unconditional: 642, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1721, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 667, unknown conditional: 0, unknown unconditional: 667] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 119 PlacesBefore, 50 PlacesAfterwards, 111 TransitionsBefore, 41 TransitionsAfterwards, 4004 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 12616 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3997, independent: 3688, independent conditional: 0, independent unconditional: 3688, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1791, independent: 1745, independent conditional: 0, independent unconditional: 1745, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3997, independent: 1943, independent conditional: 0, independent unconditional: 1943, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 1791, unknown conditional: 0, unknown unconditional: 1791] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 136 PlacesBefore, 58 PlacesAfterwards, 139 TransitionsBefore, 57 TransitionsAfterwards, 6752 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 86 TotalNumberOfCompositions, 24924 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10528, independent: 10180, independent conditional: 0, independent unconditional: 10180, dependent: 348, dependent conditional: 0, dependent unconditional: 348, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3098, independent: 3051, independent conditional: 0, independent unconditional: 3051, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10528, independent: 7129, independent conditional: 0, independent unconditional: 7129, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 3098, unknown conditional: 0, unknown unconditional: 3098] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 376, Positive conditional cache size: 0, Positive unconditional cache size: 376, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 727]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L692] 0 pthread_mutex_t ma, mb; [L693] 0 int data1, data2; [L716] 0 pthread_t t1[2], t2[2]; [L719] 0 data1 = 10 [L720] 0 data2 = 10 [L721] 0 int asdf=0; VAL [asdf=0, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L721] COND TRUE 0 asdf<2 [L721] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [arg={0:0}, asdf=0, data1=10, data2=10, ma={3:0}, mb={4:0}, pthread_create(&t1[asdf], 0, thread1, 0)=-1, t1={6:0}, t2={5:0}] [L697] 1 data1++ [L700] 1 data2++ VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L702] 1 return 0; [L721] 0 asdf++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, asdf=1, data1=11, data2=11, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L721] COND TRUE 0 asdf<2 [L721] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, asdf=1, data1=11, data2=11, ma={3:0}, mb={4:0}, pthread_create(&t1[asdf], 0, thread1, 0)=0, t1={6:0}, t2={5:0}] [L697] 2 data1++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, data1=12, data2=11, ma={3:0}, mb={4:0}] [L700] 2 data2++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, data1=12, data2=12, ma={3:0}, mb={4:0}] [L702] 2 return 0; [L721] 0 asdf++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, asdf=2, data1=12, data2=12, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L721] COND FALSE 0 !(asdf<2) [L722] 0 int asdf=0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, data1=12, data2=12, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L722] COND TRUE 0 asdf<2 [L722] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, data1=12, data2=12, ma={3:0}, mb={4:0}, pthread_create(&t2[asdf], 0, thread2, 0)=1, t1={6:0}, t2={5:0}] [L707] 3 data1+=5 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=17, data2=12, ma={3:0}, mb={4:0}] [L710] 3 data2-=6 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=17, data2=6, ma={3:0}, mb={4:0}] [L712] 3 return 0; [L722] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, data1=17, data2=6, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L722] COND TRUE 0 asdf<2 [L722] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, data1=17, data2=6, ma={3:0}, mb={4:0}, pthread_create(&t2[asdf], 0, thread2, 0)=2, t1={6:0}, t2={5:0}] [L707] 4 data1+=5 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=22, data2=6, ma={3:0}, mb={4:0}] [L710] 4 data2-=6 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=22, data2=0, ma={3:0}, mb={4:0}] [L712] 4 return 0; [L722] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L722] COND FALSE 0 !(asdf<2) [L723] 0 int asdf=0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L723] COND TRUE 0 asdf<2 [L723] 0 t1[asdf] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t1[asdf]=-1, t2={5:0}] [L723] FCALL, JOIN 1 pthread_join(t1[asdf], 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t1[asdf]=-1, t2={5:0}] [L723] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L723] COND TRUE 0 asdf<2 [L723] 0 t1[asdf] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t1[asdf]=0, t2={5:0}] [L723] FCALL, JOIN 2 pthread_join(t1[asdf], 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t1[asdf]=0, t2={5:0}] [L723] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L723] COND FALSE 0 !(asdf<2) [L724] 0 int asdf=0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L724] COND TRUE 0 asdf<2 [L724] 0 t2[asdf] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}, t2[asdf]=1] [L724] FCALL, JOIN 3 pthread_join(t2[asdf], 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}, t2[asdf]=1] [L724] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L724] COND TRUE 0 asdf<2 [L724] 0 t2[asdf] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}, t2[asdf]=2] [L724] FCALL, JOIN 4 pthread_join(t2[asdf], 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}, t2[asdf]=2] [L724] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] [L724] COND FALSE 0 !(asdf<2) [L725] COND TRUE 0 data1!=16 && data2!=5 [L727] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={6:0}, t2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 139 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 167 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 367 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 2 mSDtfsCounter, 367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 42/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 167 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 87.1s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 64.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 67 mSolverCounterUnknown, 5027 SdHoareTripleChecker+Valid, 23.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4884 mSDsluCounter, 5862 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1382 IncrementalHoareTripleChecker+Unchecked, 5815 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22896 IncrementalHoareTripleChecker+Invalid, 24446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 47 mSDtfsCounter, 22896 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1044 GetRequests, 809 SyntacticMatches, 18 SemanticMatches, 217 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2111 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=337occurred in iteration=13, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1081 NumberOfCodeBlocks, 1081 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1412 ConstructedInterpolants, 74 QuantifiedInterpolants, 26166 SizeOfPredicates, 53 NumberOfNonLiveVariables, 2965 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 32 InterpolantComputations, 5 PerfectInterpolantSequences, 285/433 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 01:44:56,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...