/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread_queue_longer_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:50:28,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:50:28,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:50:28,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:50:28,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:50:28,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:50:28,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:50:29,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:50:29,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:50:29,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:50:29,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:50:29,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:50:29,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:50:29,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:50:29,029 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:50:29,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:50:29,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:50:29,030 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:50:29,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:50:29,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:50:29,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:50:29,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:50:29,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:50:29,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:50:29,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:50:29,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:50:29,032 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:50:29,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:50:29,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:50:29,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:50:29,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:50:29,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:50:29,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:50:29,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:50:29,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:50:29,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:50:29,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:50:29,035 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:50:29,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:50:29,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:50:29,035 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:50:29,035 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 07:50:29,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:50:29,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:50:29,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:50:29,262 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:50:29,263 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:50:29,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread_queue_longer_bound2.i [2023-08-04 07:50:30,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:50:30,644 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:50:30,644 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread_queue_longer_bound2.i [2023-08-04 07:50:30,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79627971/4fedfedeca1c4595b3f41ad54c12af2a/FLAGb238e83d9 [2023-08-04 07:50:30,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79627971/4fedfedeca1c4595b3f41ad54c12af2a [2023-08-04 07:50:30,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:50:30,679 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:50:30,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:50:30,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:50:30,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:50:30,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:50:30" (1/1) ... [2023-08-04 07:50:30,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1324a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:30, skipping insertion in model container [2023-08-04 07:50:30,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:50:30" (1/1) ... [2023-08-04 07:50:30,739 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:50:31,213 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_queue_longer_bound2.i[43296,43309] [2023-08-04 07:50:31,218 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_queue_longer_bound2.i[43503,43516] [2023-08-04 07:50:31,224 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_queue_longer_bound2.i[43789,43802] [2023-08-04 07:50:31,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:50:31,244 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:50:31,271 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-04 07:50:31,273 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-04 07:50:31,280 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-04 07:50:31,309 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_queue_longer_bound2.i[43296,43309] [2023-08-04 07:50:31,315 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_queue_longer_bound2.i[43503,43516] [2023-08-04 07:50:31,320 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_queue_longer_bound2.i[43789,43802] [2023-08-04 07:50:31,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:50:31,389 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:50:31,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31 WrapperNode [2023-08-04 07:50:31,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:50:31,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:50:31,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:50:31,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:50:31,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,473 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 275 [2023-08-04 07:50:31,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:50:31,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:50:31,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:50:31,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:50:31,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:50:31,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:50:31,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:50:31,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:50:31,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (1/1) ... [2023-08-04 07:50:31,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:50:31,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:50:31,547 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 07:50:31,548 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 07:50:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-04 07:50:31,577 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-04 07:50:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-04 07:50:31,577 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-04 07:50:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:50:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:50:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 07:50:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:50:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 07:50:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:50:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:50:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:50:31,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:50:31,580 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 07:50:31,730 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:50:31,731 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:50:32,026 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:50:32,034 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:50:32,035 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 07:50:32,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:50:32 BoogieIcfgContainer [2023-08-04 07:50:32,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:50:32,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:50:32,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:50:32,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:50:32,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:50:30" (1/3) ... [2023-08-04 07:50:32,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d89e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:50:32, skipping insertion in model container [2023-08-04 07:50:32,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:50:31" (2/3) ... [2023-08-04 07:50:32,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d89e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:50:32, skipping insertion in model container [2023-08-04 07:50:32,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:50:32" (3/3) ... [2023-08-04 07:50:32,043 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread_queue_longer_bound2.i [2023-08-04 07:50:32,054 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:50:32,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:50:32,062 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-04 07:50:32,062 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:50:32,180 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 07:50:32,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 288 transitions, 598 flow [2023-08-04 07:50:32,383 INFO L124 PetriNetUnfolderBase]: 42/448 cut-off events. [2023-08-04 07:50:32,384 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-08-04 07:50:32,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 448 events. 42/448 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1543 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 252. Up to 8 conditions per place. [2023-08-04 07:50:32,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 288 transitions, 598 flow [2023-08-04 07:50:32,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 288 transitions, 598 flow [2023-08-04 07:50:32,414 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:50:32,422 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 270 places, 288 transitions, 598 flow [2023-08-04 07:50:32,424 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 270 places, 288 transitions, 598 flow [2023-08-04 07:50:32,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 288 transitions, 598 flow [2023-08-04 07:50:32,494 INFO L124 PetriNetUnfolderBase]: 42/448 cut-off events. [2023-08-04 07:50:32,495 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-08-04 07:50:32,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 448 events. 42/448 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1543 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 252. Up to 8 conditions per place. [2023-08-04 07:50:32,518 INFO L119 LiptonReduction]: Number of co-enabled transitions 29746 [2023-08-04 07:50:39,444 INFO L134 LiptonReduction]: Checked pairs total: 58073 [2023-08-04 07:50:39,445 INFO L136 LiptonReduction]: Total number of compositions: 242 [2023-08-04 07:50:39,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:50:39,462 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;@7905baff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:50:39,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-04 07:50:39,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:50:39,464 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-04 07:50:39,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:50:39,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:50:39,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-04 07:50:39,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:50:39,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:50:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1124, now seen corresponding path program 1 times [2023-08-04 07:50:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:50:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812204389] [2023-08-04 07:50:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:50:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:50:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:50:39,576 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 07:50:39,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:50:39,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812204389] [2023-08-04 07:50:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812204389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:50:39,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:50:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-04 07:50:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609726120] [2023-08-04 07:50:39,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:50:39,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-04 07:50:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:50:39,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-04 07:50:39,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-04 07:50:39,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 530 [2023-08-04 07:50:39,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 80 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:39,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:50:39,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 530 [2023-08-04 07:50:39,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:50:40,650 INFO L124 PetriNetUnfolderBase]: 7512/12008 cut-off events. [2023-08-04 07:50:40,651 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2023-08-04 07:50:40,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23160 conditions, 12008 events. 7512/12008 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 68819 event pairs, 6096 based on Foata normal form. 140/9282 useless extension candidates. Maximal degree in co-relation 22322. Up to 11004 conditions per place. [2023-08-04 07:50:40,738 INFO L140 encePairwiseOnDemand]: 527/530 looper letters, 64 selfloop transitions, 0 changer transitions 0/77 dead transitions. [2023-08-04 07:50:40,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 304 flow [2023-08-04 07:50:40,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-04 07:50:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-04 07:50:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 605 transitions. [2023-08-04 07:50:40,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5707547169811321 [2023-08-04 07:50:40,758 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 605 transitions. [2023-08-04 07:50:40,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 605 transitions. [2023-08-04 07:50:40,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:50:40,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 605 transitions. [2023-08-04 07:50:40,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 302.5) internal successors, (605), 2 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 07:50:40,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 530.0) internal successors, (1590), 3 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:40,774 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 530.0) internal successors, (1590), 3 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:40,775 INFO L175 Difference]: Start difference. First operand has 71 places, 80 transitions, 182 flow. Second operand 2 states and 605 transitions. [2023-08-04 07:50:40,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 304 flow [2023-08-04 07:50:40,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 77 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:50:40,785 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 176 flow [2023-08-04 07:50:40,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=176, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2023-08-04 07:50:40,789 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 0 predicate places. [2023-08-04 07:50:40,790 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 77 transitions, 176 flow [2023-08-04 07:50:40,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:40,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:50:40,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:50:40,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:50:40,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:50:40,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:50:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -623314610, now seen corresponding path program 1 times [2023-08-04 07:50:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:50:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904775405] [2023-08-04 07:50:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:50:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:50:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:50:40,966 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 07:50:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:50:40,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904775405] [2023-08-04 07:50:40,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904775405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:50:40,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:50:40,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 07:50:40,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148222079] [2023-08-04 07:50:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:50:40,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:50:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:50:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:50:40,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:50:40,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 530 [2023-08-04 07:50:40,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 77 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:40,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:50:40,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 530 [2023-08-04 07:50:40,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:50:41,890 INFO L124 PetriNetUnfolderBase]: 7372/11884 cut-off events. [2023-08-04 07:50:41,890 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2023-08-04 07:50:41,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22897 conditions, 11884 events. 7372/11884 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 69096 event pairs, 5852 based on Foata normal form. 0/9161 useless extension candidates. Maximal degree in co-relation 22892. Up to 10314 conditions per place. [2023-08-04 07:50:41,952 INFO L140 encePairwiseOnDemand]: 526/530 looper letters, 92 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2023-08-04 07:50:41,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 437 flow [2023-08-04 07:50:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:50:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:50:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2023-08-04 07:50:41,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5584905660377358 [2023-08-04 07:50:41,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 888 transitions. [2023-08-04 07:50:41,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 888 transitions. [2023-08-04 07:50:41,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:50:41,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 888 transitions. [2023-08-04 07:50:41,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:41,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:41,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:41,963 INFO L175 Difference]: Start difference. First operand has 71 places, 77 transitions, 176 flow. Second operand 3 states and 888 transitions. [2023-08-04 07:50:41,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 437 flow [2023-08-04 07:50:41,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 108 transitions, 437 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:50:41,967 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 180 flow [2023-08-04 07:50:41,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2023-08-04 07:50:41,968 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2023-08-04 07:50:41,969 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 180 flow [2023-08-04 07:50:41,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:41,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:50:41,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:50:41,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 07:50:41,970 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:50:41,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:50:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1824473094, now seen corresponding path program 1 times [2023-08-04 07:50:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:50:41,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492128006] [2023-08-04 07:50:41,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:50:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:50:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:50:42,043 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 07:50:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:50:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492128006] [2023-08-04 07:50:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492128006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:50:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:50:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:50:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357802033] [2023-08-04 07:50:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:50:42,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:50:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:50:42,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:50:42,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:50:42,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 530 [2023-08-04 07:50:42,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:42,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:50:42,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 530 [2023-08-04 07:50:42,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:50:42,902 INFO L124 PetriNetUnfolderBase]: 7170/11330 cut-off events. [2023-08-04 07:50:42,902 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2023-08-04 07:50:42,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22534 conditions, 11330 events. 7170/11330 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 68077 event pairs, 2730 based on Foata normal form. 0/8673 useless extension candidates. Maximal degree in co-relation 22528. Up to 10561 conditions per place. [2023-08-04 07:50:42,971 INFO L140 encePairwiseOnDemand]: 527/530 looper letters, 89 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2023-08-04 07:50:42,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 424 flow [2023-08-04 07:50:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:50:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:50:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2023-08-04 07:50:42,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5578616352201258 [2023-08-04 07:50:42,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2023-08-04 07:50:42,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2023-08-04 07:50:42,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:50:42,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2023-08-04 07:50:42,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:42,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:42,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:42,982 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 180 flow. Second operand 3 states and 887 transitions. [2023-08-04 07:50:42,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 424 flow [2023-08-04 07:50:42,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:50:42,986 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 182 flow [2023-08-04 07:50:42,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2023-08-04 07:50:42,987 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 3 predicate places. [2023-08-04 07:50:42,987 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 182 flow [2023-08-04 07:50:42,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:42,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:50:42,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:50:42,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 07:50:42,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:50:42,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:50:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2002932447, now seen corresponding path program 1 times [2023-08-04 07:50:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:50:42,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792314283] [2023-08-04 07:50:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:50:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:50:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:50:44,362 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 07:50:44,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:50:44,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792314283] [2023-08-04 07:50:44,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792314283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:50:44,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:50:44,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 07:50:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893678269] [2023-08-04 07:50:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:50:44,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 07:50:44,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:50:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 07:50:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-04 07:50:44,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 530 [2023-08-04 07:50:44,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 242.16666666666666) internal successors, (1453), 6 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:44,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:50:44,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 530 [2023-08-04 07:50:44,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:50:45,930 INFO L124 PetriNetUnfolderBase]: 7880/12549 cut-off events. [2023-08-04 07:50:45,931 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2023-08-04 07:50:45,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24447 conditions, 12549 events. 7880/12549 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 72259 event pairs, 5422 based on Foata normal form. 0/9690 useless extension candidates. Maximal degree in co-relation 24440. Up to 11532 conditions per place. [2023-08-04 07:50:45,991 INFO L140 encePairwiseOnDemand]: 523/530 looper letters, 90 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2023-08-04 07:50:45,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 471 flow [2023-08-04 07:50:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 07:50:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 07:50:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1542 transitions. [2023-08-04 07:50:45,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849056603773585 [2023-08-04 07:50:45,996 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1542 transitions. [2023-08-04 07:50:45,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1542 transitions. [2023-08-04 07:50:45,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:50:45,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1542 transitions. [2023-08-04 07:50:46,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:46,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 530.0) internal successors, (3710), 7 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:46,008 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 530.0) internal successors, (3710), 7 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:46,008 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 182 flow. Second operand 6 states and 1542 transitions. [2023-08-04 07:50:46,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 112 transitions, 471 flow [2023-08-04 07:50:46,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 112 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:50:46,013 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 244 flow [2023-08-04 07:50:46,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2023-08-04 07:50:46,014 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2023-08-04 07:50:46,015 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 244 flow [2023-08-04 07:50:46,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.16666666666666) internal successors, (1453), 6 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:46,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:50:46,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:50:46,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 07:50:46,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:50:46,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:50:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash 65751900, now seen corresponding path program 1 times [2023-08-04 07:50:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:50:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817552361] [2023-08-04 07:50:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:50:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:50:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:50:46,900 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 07:50:46,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:50:46,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817552361] [2023-08-04 07:50:46,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817552361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:50:46,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:50:46,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-04 07:50:46,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747876520] [2023-08-04 07:50:46,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:50:46,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 07:50:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:50:46,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 07:50:46,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-08-04 07:50:47,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 530 [2023-08-04 07:50:47,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 244 flow. Second operand has 10 states, 10 states have (on average 227.4) internal successors, (2274), 10 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:47,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:50:47,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 530 [2023-08-04 07:50:47,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:50:49,008 INFO L124 PetriNetUnfolderBase]: 7949/12695 cut-off events. [2023-08-04 07:50:49,009 INFO L125 PetriNetUnfolderBase]: For 1219/1219 co-relation queries the response was YES. [2023-08-04 07:50:49,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25830 conditions, 12695 events. 7949/12695 cut-off events. For 1219/1219 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 73875 event pairs, 6011 based on Foata normal form. 0/10416 useless extension candidates. Maximal degree in co-relation 25820. Up to 11519 conditions per place. [2023-08-04 07:50:49,104 INFO L140 encePairwiseOnDemand]: 518/530 looper letters, 88 selfloop transitions, 28 changer transitions 35/162 dead transitions. [2023-08-04 07:50:49,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 162 transitions, 747 flow [2023-08-04 07:50:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 07:50:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 07:50:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2864 transitions. [2023-08-04 07:50:49,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45031446540880504 [2023-08-04 07:50:49,111 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2864 transitions. [2023-08-04 07:50:49,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2864 transitions. [2023-08-04 07:50:49,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:50:49,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2864 transitions. [2023-08-04 07:50:49,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 238.66666666666666) internal successors, (2864), 12 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:49,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 530.0) internal successors, (6890), 13 states have internal predecessors, (6890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:49,130 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 530.0) internal successors, (6890), 13 states have internal predecessors, (6890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:49,130 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 244 flow. Second operand 12 states and 2864 transitions. [2023-08-04 07:50:49,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 162 transitions, 747 flow [2023-08-04 07:50:49,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 162 transitions, 747 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:50:49,136 INFO L231 Difference]: Finished difference. Result has 93 places, 105 transitions, 396 flow [2023-08-04 07:50:49,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=396, PETRI_PLACES=93, PETRI_TRANSITIONS=105} [2023-08-04 07:50:49,137 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 22 predicate places. [2023-08-04 07:50:49,137 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 105 transitions, 396 flow [2023-08-04 07:50:49,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 227.4) internal successors, (2274), 10 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:49,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:50:49,138 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:50:49,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:50:49,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:50:49,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:50:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash -781678687, now seen corresponding path program 1 times [2023-08-04 07:50:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:50:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353912259] [2023-08-04 07:50:49,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:50:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:50:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:50:49,439 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 07:50:49,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:50:49,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353912259] [2023-08-04 07:50:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353912259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:50:49,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:50:49,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 07:50:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745620019] [2023-08-04 07:50:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:50:49,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 07:50:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:50:49,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 07:50:49,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-04 07:50:49,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 530 [2023-08-04 07:50:49,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 105 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:49,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:50:49,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 530 [2023-08-04 07:50:49,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:50:50,673 INFO L124 PetriNetUnfolderBase]: 7938/12700 cut-off events. [2023-08-04 07:50:50,674 INFO L125 PetriNetUnfolderBase]: For 2475/2475 co-relation queries the response was YES. [2023-08-04 07:50:50,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27137 conditions, 12700 events. 7938/12700 cut-off events. For 2475/2475 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 74014 event pairs, 6034 based on Foata normal form. 1/10406 useless extension candidates. Maximal degree in co-relation 27124. Up to 11667 conditions per place. [2023-08-04 07:50:50,737 INFO L140 encePairwiseOnDemand]: 519/530 looper letters, 92 selfloop transitions, 21 changer transitions 23/147 dead transitions. [2023-08-04 07:50:50,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 147 transitions, 794 flow [2023-08-04 07:50:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 07:50:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 07:50:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2045 transitions. [2023-08-04 07:50:50,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.482311320754717 [2023-08-04 07:50:50,743 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2045 transitions. [2023-08-04 07:50:50,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2045 transitions. [2023-08-04 07:50:50,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:50:50,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2045 transitions. [2023-08-04 07:50:50,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 255.625) internal successors, (2045), 8 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:50,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 530.0) internal successors, (4770), 9 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:50,754 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 530.0) internal successors, (4770), 9 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:50,754 INFO L175 Difference]: Start difference. First operand has 93 places, 105 transitions, 396 flow. Second operand 8 states and 2045 transitions. [2023-08-04 07:50:50,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 147 transitions, 794 flow [2023-08-04 07:50:50,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 147 transitions, 754 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-04 07:50:50,769 INFO L231 Difference]: Finished difference. Result has 100 places, 112 transitions, 475 flow [2023-08-04 07:50:50,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=475, PETRI_PLACES=100, PETRI_TRANSITIONS=112} [2023-08-04 07:50:50,771 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 29 predicate places. [2023-08-04 07:50:50,771 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 112 transitions, 475 flow [2023-08-04 07:50:50,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:50,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:50:50,771 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:50:50,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:50:50,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:50:50,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:50:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1514161305, now seen corresponding path program 2 times [2023-08-04 07:50:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:50:50,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664136759] [2023-08-04 07:50:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:50:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:50:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:50:53,863 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 07:50:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:50:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664136759] [2023-08-04 07:50:53,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664136759] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:50:53,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665738295] [2023-08-04 07:50:53,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 07:50:53,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:50:53,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:50:53,871 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 07:50:53,873 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 07:50:54,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 07:50:54,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 07:50:54,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-04 07:50:54,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:50:54,110 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 07:50:54,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 07:50:54,131 INFO L322 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2023-08-04 07:50:54,131 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 1 case distinctions, treesize of input 18 treesize of output 24 [2023-08-04 07:50:54,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-04 07:50:54,179 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 21 treesize of output 21 [2023-08-04 07:50:54,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:50:54,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:50:54,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-04 07:50:54,348 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 21 treesize of output 21 [2023-08-04 07:50:54,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 07:50:54,467 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 07:50:54,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:50:54,523 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_201) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 400)) is different from false [2023-08-04 07:50:54,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_200)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_201) |c_~#queue~0.base|) .cse1) 400) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|)))) is different from false [2023-08-04 07:50:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-04 07:50:54,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665738295] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:50:54,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:50:54,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2023-08-04 07:50:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750398663] [2023-08-04 07:50:54,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:50:54,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 07:50:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:50:54,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 07:50:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=184, Unknown=6, NotChecked=58, Total=306 [2023-08-04 07:50:54,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 530 [2023-08-04 07:50:54,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 112 transitions, 475 flow. Second operand has 18 states, 18 states have (on average 202.05555555555554) internal successors, (3637), 18 states have internal predecessors, (3637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:54,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:50:54,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 530 [2023-08-04 07:50:54,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:50:58,441 INFO L124 PetriNetUnfolderBase]: 8498/13610 cut-off events. [2023-08-04 07:50:58,441 INFO L125 PetriNetUnfolderBase]: For 6015/6015 co-relation queries the response was YES. [2023-08-04 07:50:58,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31208 conditions, 13610 events. 8498/13610 cut-off events. For 6015/6015 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 80252 event pairs, 5305 based on Foata normal form. 2/11714 useless extension candidates. Maximal degree in co-relation 31192. Up to 11730 conditions per place. [2023-08-04 07:50:58,541 INFO L140 encePairwiseOnDemand]: 512/530 looper letters, 123 selfloop transitions, 55 changer transitions 32/221 dead transitions. [2023-08-04 07:50:58,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 221 transitions, 1298 flow [2023-08-04 07:50:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 07:50:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 07:50:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2781 transitions. [2023-08-04 07:50:58,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40362844702467343 [2023-08-04 07:50:58,549 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2781 transitions. [2023-08-04 07:50:58,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2781 transitions. [2023-08-04 07:50:58,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:50:58,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2781 transitions. [2023-08-04 07:50:58,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 213.92307692307693) internal successors, (2781), 13 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:58,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 530.0) internal successors, (7420), 14 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:58,568 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 530.0) internal successors, (7420), 14 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:58,568 INFO L175 Difference]: Start difference. First operand has 100 places, 112 transitions, 475 flow. Second operand 13 states and 2781 transitions. [2023-08-04 07:50:58,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 221 transitions, 1298 flow [2023-08-04 07:50:58,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 221 transitions, 1290 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-04 07:50:58,583 INFO L231 Difference]: Finished difference. Result has 114 places, 145 transitions, 848 flow [2023-08-04 07:50:58,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=848, PETRI_PLACES=114, PETRI_TRANSITIONS=145} [2023-08-04 07:50:58,584 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 43 predicate places. [2023-08-04 07:50:58,584 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 145 transitions, 848 flow [2023-08-04 07:50:58,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 202.05555555555554) internal successors, (3637), 18 states have internal predecessors, (3637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:50:58,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:50:58,586 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:50:58,595 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 07:50:58,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:50:58,792 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:50:58,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:50:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1921210207, now seen corresponding path program 3 times [2023-08-04 07:50:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:50:58,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620966586] [2023-08-04 07:50:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:50:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:50:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:51:01,286 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 07:51:01,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:51:01,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620966586] [2023-08-04 07:51:01,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620966586] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:51:01,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942243015] [2023-08-04 07:51:01,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 07:51:01,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:51:01,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:51:01,289 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 07:51:01,299 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 07:51:01,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 07:51:01,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 07:51:01,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-04 07:51:01,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:51:01,447 INFO L322 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2023-08-04 07:51:01,447 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 1 case distinctions, treesize of input 18 treesize of output 24 [2023-08-04 07:51:01,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-04 07:51:01,462 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 07:51:01,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 07:51:01,495 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 21 treesize of output 21 [2023-08-04 07:51:01,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:01,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:01,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-04 07:51:01,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 07:51:01,712 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 14 treesize of output 16 [2023-08-04 07:51:01,748 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 07:51:01,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:51:01,779 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_275) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 400)) is different from false [2023-08-04 07:51:01,788 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_273 Int) (v_ArrVal_275 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_273)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_275) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 400)) is different from false [2023-08-04 07:51:01,853 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_273 Int) (v_ArrVal_271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49| Int) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) |c_~#queue~0.offset|) v_ArrVal_271) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_273)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_275) |c_~#queue~0.base|) .cse1) 400)))) is different from false [2023-08-04 07:51:01,880 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_273 Int) (v_ArrVal_271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49| Int) (v_ArrVal_275 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_270))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) |c_~#queue~0.offset|) v_ArrVal_271) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_273)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_275) |c_~#queue~0.base|) .cse1) 400))))) is different from false [2023-08-04 07:51:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-04 07:51:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942243015] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:51:01,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:51:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 18 [2023-08-04 07:51:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612030344] [2023-08-04 07:51:01,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:51:01,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 07:51:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:51:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 07:51:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=153, Unknown=5, NotChecked=116, Total=342 [2023-08-04 07:51:03,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 530 [2023-08-04 07:51:03,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 145 transitions, 848 flow. Second operand has 19 states, 19 states have (on average 201.94736842105263) internal successors, (3837), 19 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:03,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:51:03,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 530 [2023-08-04 07:51:03,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:51:05,673 INFO L124 PetriNetUnfolderBase]: 8497/13623 cut-off events. [2023-08-04 07:51:05,673 INFO L125 PetriNetUnfolderBase]: For 11406/11406 co-relation queries the response was YES. [2023-08-04 07:51:05,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34750 conditions, 13623 events. 8497/13623 cut-off events. For 11406/11406 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 80503 event pairs, 5311 based on Foata normal form. 1/11868 useless extension candidates. Maximal degree in co-relation 34728. Up to 11725 conditions per place. [2023-08-04 07:51:05,745 INFO L140 encePairwiseOnDemand]: 516/530 looper letters, 127 selfloop transitions, 42 changer transitions 20/200 dead transitions. [2023-08-04 07:51:05,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 200 transitions, 1370 flow [2023-08-04 07:51:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 07:51:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 07:51:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1747 transitions. [2023-08-04 07:51:05,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41202830188679246 [2023-08-04 07:51:05,751 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1747 transitions. [2023-08-04 07:51:05,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1747 transitions. [2023-08-04 07:51:05,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:51:05,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1747 transitions. [2023-08-04 07:51:05,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 218.375) internal successors, (1747), 8 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:05,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 530.0) internal successors, (4770), 9 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:05,761 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 530.0) internal successors, (4770), 9 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:05,761 INFO L175 Difference]: Start difference. First operand has 114 places, 145 transitions, 848 flow. Second operand 8 states and 1747 transitions. [2023-08-04 07:51:05,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 200 transitions, 1370 flow [2023-08-04 07:51:05,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 200 transitions, 1358 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-04 07:51:05,789 INFO L231 Difference]: Finished difference. Result has 121 places, 143 transitions, 903 flow [2023-08-04 07:51:05,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=903, PETRI_PLACES=121, PETRI_TRANSITIONS=143} [2023-08-04 07:51:05,791 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 50 predicate places. [2023-08-04 07:51:05,791 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 143 transitions, 903 flow [2023-08-04 07:51:05,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 201.94736842105263) internal successors, (3837), 19 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:05,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:51:05,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:51:05,798 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 07:51:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-08-04 07:51:05,999 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:51:05,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:51:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -271187972, now seen corresponding path program 1 times [2023-08-04 07:51:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:51:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916262252] [2023-08-04 07:51:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:51:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:51:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:51:06,036 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 07:51:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:51:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916262252] [2023-08-04 07:51:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916262252] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:51:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642879650] [2023-08-04 07:51:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:51:06,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:51:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:51:06,038 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 07:51:06,040 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 07:51:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:51:06,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:51:06,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:51:06,155 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 07:51:06,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:51:06,172 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 07:51:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642879650] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:51:06,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:51:06,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:51:06,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095967585] [2023-08-04 07:51:06,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:51:06,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:51:06,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:51:06,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:51:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:51:06,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 530 [2023-08-04 07:51:06,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 143 transitions, 903 flow. Second operand has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:06,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:51:06,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 530 [2023-08-04 07:51:06,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:51:06,253 INFO L124 PetriNetUnfolderBase]: 63/203 cut-off events. [2023-08-04 07:51:06,253 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2023-08-04 07:51:06,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 203 events. 63/203 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 597 event pairs, 0 based on Foata normal form. 34/226 useless extension candidates. Maximal degree in co-relation 755. Up to 134 conditions per place. [2023-08-04 07:51:06,254 INFO L140 encePairwiseOnDemand]: 527/530 looper letters, 49 selfloop transitions, 9 changer transitions 39/103 dead transitions. [2023-08-04 07:51:06,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 103 transitions, 839 flow [2023-08-04 07:51:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:51:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:51:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1111 transitions. [2023-08-04 07:51:06,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5240566037735849 [2023-08-04 07:51:06,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1111 transitions. [2023-08-04 07:51:06,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1111 transitions. [2023-08-04 07:51:06,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:51:06,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1111 transitions. [2023-08-04 07:51:06,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 277.75) internal successors, (1111), 4 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:06,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 530.0) internal successors, (2650), 5 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:06,262 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 530.0) internal successors, (2650), 5 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:06,262 INFO L175 Difference]: Start difference. First operand has 121 places, 143 transitions, 903 flow. Second operand 4 states and 1111 transitions. [2023-08-04 07:51:06,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 103 transitions, 839 flow [2023-08-04 07:51:06,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 711 flow, removed 3 selfloop flow, removed 14 redundant places. [2023-08-04 07:51:06,266 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 412 flow [2023-08-04 07:51:06,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2023-08-04 07:51:06,268 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 6 predicate places. [2023-08-04 07:51:06,268 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 412 flow [2023-08-04 07:51:06,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:06,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:51:06,268 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:51:06,277 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 07:51:06,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:51:06,477 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:51:06,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:51:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash -730087204, now seen corresponding path program 1 times [2023-08-04 07:51:06,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:51:06,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118042047] [2023-08-04 07:51:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:51:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:51:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:51:07,354 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 07:51:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:51:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118042047] [2023-08-04 07:51:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118042047] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:51:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472326866] [2023-08-04 07:51:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:51:07,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:51:07,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:51:07,356 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 07:51:07,379 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 07:51:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:51:07,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-04 07:51:07,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:51:07,493 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 07:51:07,493 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 07:51:07,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:07,501 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 18 treesize of output 20 [2023-08-04 07:51:07,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-04 07:51:07,534 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 21 treesize of output 21 [2023-08-04 07:51:07,578 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 21 treesize of output 21 [2023-08-04 07:51:07,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:07,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:07,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-04 07:51:07,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-04 07:51:07,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 07:51:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:07,810 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 21 treesize of output 21 [2023-08-04 07:51:07,859 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 07:51:07,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:51:07,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472326866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:51:07,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:51:07,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2023-08-04 07:51:07,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204741019] [2023-08-04 07:51:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:51:07,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 07:51:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:51:07,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 07:51:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-08-04 07:51:08,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 530 [2023-08-04 07:51:08,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 412 flow. Second operand has 10 states, 10 states have (on average 229.6) internal successors, (2296), 10 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:08,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:51:08,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 530 [2023-08-04 07:51:08,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:51:08,619 INFO L124 PetriNetUnfolderBase]: 24/104 cut-off events. [2023-08-04 07:51:08,619 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-08-04 07:51:08,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 104 events. 24/104 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 370 event pairs, 3 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 427. Up to 28 conditions per place. [2023-08-04 07:51:08,620 INFO L140 encePairwiseOnDemand]: 522/530 looper letters, 19 selfloop transitions, 14 changer transitions 26/61 dead transitions. [2023-08-04 07:51:08,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 536 flow [2023-08-04 07:51:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 07:51:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 07:51:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1852 transitions. [2023-08-04 07:51:08,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4367924528301887 [2023-08-04 07:51:08,624 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1852 transitions. [2023-08-04 07:51:08,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1852 transitions. [2023-08-04 07:51:08,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:51:08,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1852 transitions. [2023-08-04 07:51:08,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 231.5) internal successors, (1852), 8 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:08,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 530.0) internal successors, (4770), 9 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:08,632 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 530.0) internal successors, (4770), 9 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:08,632 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 412 flow. Second operand 8 states and 1852 transitions. [2023-08-04 07:51:08,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 536 flow [2023-08-04 07:51:08,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:51:08,635 INFO L231 Difference]: Finished difference. Result has 67 places, 34 transitions, 253 flow [2023-08-04 07:51:08,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=253, PETRI_PLACES=67, PETRI_TRANSITIONS=34} [2023-08-04 07:51:08,636 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -4 predicate places. [2023-08-04 07:51:08,636 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 34 transitions, 253 flow [2023-08-04 07:51:08,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 229.6) internal successors, (2296), 10 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:08,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:51:08,636 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:51:08,644 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 07:51:08,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:51:08,842 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 07:51:08,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:51:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1576955480, now seen corresponding path program 2 times [2023-08-04 07:51:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:51:08,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428334095] [2023-08-04 07:51:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:51:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:51:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:51:09,875 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 07:51:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:51:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428334095] [2023-08-04 07:51:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428334095] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:51:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868373725] [2023-08-04 07:51:09,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 07:51:09,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:51:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:51:09,877 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 07:51:09,878 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 07:51:09,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 07:51:09,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 07:51:09,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-04 07:51:09,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:51:10,010 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 07:51:10,011 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 07:51:10,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:10,018 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 18 treesize of output 20 [2023-08-04 07:51:10,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-04 07:51:10,059 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 21 treesize of output 21 [2023-08-04 07:51:10,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:10,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:10,147 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-04 07:51:10,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-04 07:51:10,309 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 07:51:10,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:51:10,344 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 21 treesize of output 21 [2023-08-04 07:51:10,380 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 21 treesize of output 21 [2023-08-04 07:51:10,429 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 07:51:10,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:51:10,464 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483) |c_~#queue~0.base|))) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) (select .cse0 (+ |c_~#queue~0.offset| 1604)))))) is different from false [2023-08-04 07:51:10,475 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int))) (not (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_482) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483) |c_~#queue~0.base|))) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) (select .cse0 (+ |c_~#queue~0.offset| 1604)))))) is different from false [2023-08-04 07:51:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-04 07:51:13,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868373725] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:51:13,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:51:13,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2023-08-04 07:51:13,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464522295] [2023-08-04 07:51:13,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:51:13,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 07:51:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:51:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 07:51:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=565, Unknown=38, NotChecked=102, Total=812 [2023-08-04 07:51:13,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 530 [2023-08-04 07:51:13,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 34 transitions, 253 flow. Second operand has 29 states, 29 states have (on average 190.6551724137931) internal successors, (5529), 29 states have internal predecessors, (5529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:13,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:51:13,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 530 [2023-08-04 07:51:13,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:51:14,587 INFO L124 PetriNetUnfolderBase]: 13/51 cut-off events. [2023-08-04 07:51:14,587 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-08-04 07:51:14,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 51 events. 13/51 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 2/53 useless extension candidates. Maximal degree in co-relation 235. Up to 12 conditions per place. [2023-08-04 07:51:14,588 INFO L140 encePairwiseOnDemand]: 520/530 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2023-08-04 07:51:14,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 41 transitions, 376 flow [2023-08-04 07:51:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 07:51:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 07:51:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2871 transitions. [2023-08-04 07:51:14,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611320754716981 [2023-08-04 07:51:14,594 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2871 transitions. [2023-08-04 07:51:14,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2871 transitions. [2023-08-04 07:51:14,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:51:14,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2871 transitions. [2023-08-04 07:51:14,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 191.4) internal successors, (2871), 15 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:14,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 530.0) internal successors, (8480), 16 states have internal predecessors, (8480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:14,609 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 530.0) internal successors, (8480), 16 states have internal predecessors, (8480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:14,609 INFO L175 Difference]: Start difference. First operand has 67 places, 34 transitions, 253 flow. Second operand 15 states and 2871 transitions. [2023-08-04 07:51:14,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 41 transitions, 376 flow [2023-08-04 07:51:14,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 251 flow, removed 10 selfloop flow, removed 25 redundant places. [2023-08-04 07:51:14,611 INFO L231 Difference]: Finished difference. Result has 52 places, 0 transitions, 0 flow [2023-08-04 07:51:14,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=0, PETRI_PLACES=52, PETRI_TRANSITIONS=0} [2023-08-04 07:51:14,611 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -19 predicate places. [2023-08-04 07:51:14,612 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 0 transitions, 0 flow [2023-08-04 07:51:14,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 190.6551724137931) internal successors, (5529), 29 states have internal predecessors, (5529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:14,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-04 07:51:14,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-04 07:51:14,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-04 07:51:14,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-04 07:51:14,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-04 07:51:14,623 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 07:51:14,823 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,SelfDestructingSolverStorable10 [2023-08-04 07:51:14,824 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 07:51:14,825 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-04 07:51:14,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 288 transitions, 598 flow [2023-08-04 07:51:14,879 INFO L124 PetriNetUnfolderBase]: 42/448 cut-off events. [2023-08-04 07:51:14,879 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-08-04 07:51:14,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 448 events. 42/448 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1543 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 252. Up to 8 conditions per place. [2023-08-04 07:51:14,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 288 transitions, 598 flow [2023-08-04 07:51:14,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 287 transitions, 596 flow [2023-08-04 07:51:14,885 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:51:14,885 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 287 transitions, 596 flow [2023-08-04 07:51:14,885 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 287 transitions, 596 flow [2023-08-04 07:51:14,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 287 transitions, 596 flow [2023-08-04 07:51:14,926 INFO L124 PetriNetUnfolderBase]: 42/447 cut-off events. [2023-08-04 07:51:14,926 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-08-04 07:51:14,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 447 events. 42/447 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1539 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 252. Up to 8 conditions per place. [2023-08-04 07:51:14,942 INFO L119 LiptonReduction]: Number of co-enabled transitions 29746 [2023-08-04 07:51:21,780 INFO L134 LiptonReduction]: Checked pairs total: 64817 [2023-08-04 07:51:21,780 INFO L136 LiptonReduction]: Total number of compositions: 238 [2023-08-04 07:51:21,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:51:21,781 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;@7905baff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:51:21,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 07:51:21,785 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:51:21,785 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-08-04 07:51:21,785 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:51:21,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:51:21,785 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:51:21,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:51:21,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:51:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1528301862, now seen corresponding path program 1 times [2023-08-04 07:51:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:51:21,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317515913] [2023-08-04 07:51:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:51:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:51:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:51:21,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:51:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:51:21,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:51:21,827 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:51:21,827 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 07:51:21,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 07:51:21,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 07:51:21,828 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 07:51:21,829 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 07:51:21,829 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:51:21,829 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:51:21,897 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 07:51:21,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 466 transitions, 980 flow [2023-08-04 07:51:22,114 INFO L124 PetriNetUnfolderBase]: 149/1208 cut-off events. [2023-08-04 07:51:22,114 INFO L125 PetriNetUnfolderBase]: For 72/98 co-relation queries the response was YES. [2023-08-04 07:51:22,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1208 events. 149/1208 cut-off events. For 72/98 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7295 event pairs, 1 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 784. Up to 32 conditions per place. [2023-08-04 07:51:22,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 435 places, 466 transitions, 980 flow [2023-08-04 07:51:22,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 435 places, 466 transitions, 980 flow [2023-08-04 07:51:22,156 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:51:22,156 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 466 transitions, 980 flow [2023-08-04 07:51:22,156 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 466 transitions, 980 flow [2023-08-04 07:51:22,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 466 transitions, 980 flow [2023-08-04 07:51:22,361 INFO L124 PetriNetUnfolderBase]: 149/1208 cut-off events. [2023-08-04 07:51:22,361 INFO L125 PetriNetUnfolderBase]: For 72/98 co-relation queries the response was YES. [2023-08-04 07:51:22,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1208 events. 149/1208 cut-off events. For 72/98 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7295 event pairs, 1 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 784. Up to 32 conditions per place. [2023-08-04 07:51:22,467 INFO L119 LiptonReduction]: Number of co-enabled transitions 122216 [2023-08-04 07:51:32,423 INFO L134 LiptonReduction]: Checked pairs total: 271945 [2023-08-04 07:51:32,423 INFO L136 LiptonReduction]: Total number of compositions: 381 [2023-08-04 07:51:32,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:51:32,425 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;@7905baff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:51:32,425 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-04 07:51:32,425 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:51:32,425 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-04 07:51:32,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:51:32,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:51:32,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-04 07:51:32,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-04 07:51:32,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:51:32,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2385, now seen corresponding path program 1 times [2023-08-04 07:51:32,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:51:32,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30787455] [2023-08-04 07:51:32,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:51:32,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:51:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:51:32,431 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 07:51:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:51:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30787455] [2023-08-04 07:51:32,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30787455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:51:32,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:51:32,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-04 07:51:32,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029527331] [2023-08-04 07:51:32,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:51:32,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-04 07:51:32,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:51:32,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-04 07:51:32,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-04 07:51:32,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 847 [2023-08-04 07:51:32,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 147 transitions, 342 flow. Second operand has 2 states, 2 states have (on average 435.5) internal successors, (871), 2 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:51:32,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:51:32,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 847 [2023-08-04 07:51:32,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand