/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:45:12,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:45:12,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 11:45:12,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:45:12,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:45:12,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:45:12,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:45:12,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:45:12,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:45:12,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:45:12,842 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:45:12,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:45:12,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:45:12,844 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:45:12,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:45:12,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:45:12,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:45:12,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:45:12,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:45:12,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:45:12,845 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:45:12,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:45:12,846 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:45:12,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:45:12,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:45:12,847 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:45:12,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:45:12,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:45:12,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:45:12,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:45:12,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:45:12,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:45:12,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:45:12,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:45:12,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:45:12,850 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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-24 11:45:13,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:45:13,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:45:13,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:45:13,154 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:45:13,156 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:45:13,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-24 11:45:14,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:45:14,529 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:45:14,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-24 11:45:14,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f150a1655/cc95530537f9402695c87df674cae276/FLAGf639f9c17 [2023-08-24 11:45:14,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f150a1655/cc95530537f9402695c87df674cae276 [2023-08-24 11:45:14,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:45:14,566 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:45:14,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:45:14,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:45:14,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:45:14,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:45:14" (1/1) ... [2023-08-24 11:45:14,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fca3735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:14, skipping insertion in model container [2023-08-24 11:45:14,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:45:14" (1/1) ... [2023-08-24 11:45:14,610 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:45:14,785 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-24 11:45:15,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:45:15,022 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:45:15,033 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-24 11:45:15,053 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:45:15,061 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:45:15,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:45:15,135 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:45:15,136 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:45:15,142 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:45:15,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15 WrapperNode [2023-08-24 11:45:15,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:45:15,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:45:15,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:45:15,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:45:15,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,213 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-08-24 11:45:15,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:45:15,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:45:15,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:45:15,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:45:15,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:45:15,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:45:15,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:45:15,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:45:15,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (1/1) ... [2023-08-24 11:45:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:45:15,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:45:15,298 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-24 11:45:15,318 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-24 11:45:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:45:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:45:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:45:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:45:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:45:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:45:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:45:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:45:15,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:45:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:45:15,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:45:15,337 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 11:45:15,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 11:45:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:45:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:45:15,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:45:15,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:45:15,340 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:45:15,512 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:45:15,514 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:45:15,771 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:45:15,968 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:45:15,968 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:45:15,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:45:15 BoogieIcfgContainer [2023-08-24 11:45:15,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:45:15,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:45:15,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:45:15,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:45:15,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:45:14" (1/3) ... [2023-08-24 11:45:15,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104a3a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:45:15, skipping insertion in model container [2023-08-24 11:45:15,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:45:15" (2/3) ... [2023-08-24 11:45:15,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104a3a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:45:15, skipping insertion in model container [2023-08-24 11:45:15,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:45:15" (3/3) ... [2023-08-24 11:45:15,980 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-24 11:45:15,996 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:45:15,996 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:45:15,997 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:45:16,054 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:45:16,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2023-08-24 11:45:16,164 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2023-08-24 11:45:16,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:45:16,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-24 11:45:16,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2023-08-24 11:45:16,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2023-08-24 11:45:16,182 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:45:16,194 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 121 transitions, 254 flow [2023-08-24 11:45:16,197 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 121 transitions, 254 flow [2023-08-24 11:45:16,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 254 flow [2023-08-24 11:45:16,239 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2023-08-24 11:45:16,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:45:16,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-24 11:45:16,243 INFO L119 LiptonReduction]: Number of co-enabled transitions 2736 [2023-08-24 11:45:20,989 INFO L134 LiptonReduction]: Checked pairs total: 6414 [2023-08-24 11:45:20,989 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-24 11:45:21,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:45:21,006 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=false, 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;@2fb7a60, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:45:21,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 11:45:21,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:45:21,011 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-08-24 11:45:21,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:45:21,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:21,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:21,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:21,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1088228860, now seen corresponding path program 1 times [2023-08-24 11:45:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170858126] [2023-08-24 11:45:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:21,483 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-24 11:45:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170858126] [2023-08-24 11:45:21,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170858126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:21,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:21,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:45:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133003272] [2023-08-24 11:45:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:21,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:45:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:21,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:45:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:45:21,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 231 [2023-08-24 11:45:21,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:21,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:21,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 231 [2023-08-24 11:45:21,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:22,034 INFO L124 PetriNetUnfolderBase]: 2075/3089 cut-off events. [2023-08-24 11:45:22,035 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-24 11:45:22,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6085 conditions, 3089 events. 2075/3089 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16497 event pairs, 518 based on Foata normal form. 0/2932 useless extension candidates. Maximal degree in co-relation 6073. Up to 2098 conditions per place. [2023-08-24 11:45:22,058 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-24 11:45:22,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 152 flow [2023-08-24 11:45:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:45:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:45:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-24 11:45:22,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295815295815296 [2023-08-24 11:45:22,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-24 11:45:22,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-24 11:45:22,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:22,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-24 11:45:22,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:22,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:22,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:22,094 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 367 transitions. [2023-08-24 11:45:22,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 152 flow [2023-08-24 11:45:22,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:22,100 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-08-24 11:45:22,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-24 11:45:22,105 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-24 11:45:22,105 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-08-24 11:45:22,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:22,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:22,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:22,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:45:22,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:22,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:22,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2110807643, now seen corresponding path program 1 times [2023-08-24 11:45:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:22,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560618838] [2023-08-24 11:45:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:22,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:22,949 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-24 11:45:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:22,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560618838] [2023-08-24 11:45:22,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560618838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:22,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:45:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153746774] [2023-08-24 11:45:22,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:22,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:22,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:22,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:22,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 231 [2023-08-24 11:45:22,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:22,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:22,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 231 [2023-08-24 11:45:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:24,016 INFO L124 PetriNetUnfolderBase]: 7639/10580 cut-off events. [2023-08-24 11:45:24,017 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2023-08-24 11:45:24,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21978 conditions, 10580 events. 7639/10580 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 54396 event pairs, 511 based on Foata normal form. 320/10900 useless extension candidates. Maximal degree in co-relation 21968. Up to 6753 conditions per place. [2023-08-24 11:45:24,074 INFO L140 encePairwiseOnDemand]: 220/231 looper letters, 47 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2023-08-24 11:45:24,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 258 flow [2023-08-24 11:45:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2023-08-24 11:45:24,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816017316017316 [2023-08-24 11:45:24,077 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 445 transitions. [2023-08-24 11:45:24,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions. [2023-08-24 11:45:24,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:24,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions. [2023-08-24 11:45:24,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:24,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:24,083 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:24,083 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 4 states and 445 transitions. [2023-08-24 11:45:24,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 59 transitions, 258 flow [2023-08-24 11:45:24,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:24,087 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 150 flow [2023-08-24 11:45:24,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-08-24 11:45:24,091 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-24 11:45:24,091 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 150 flow [2023-08-24 11:45:24,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:24,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:24,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:24,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:45:24,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:24,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1010528717, now seen corresponding path program 1 times [2023-08-24 11:45:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141292968] [2023-08-24 11:45:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:24,276 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-24 11:45:24,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:24,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141292968] [2023-08-24 11:45:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141292968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:24,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:24,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:45:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980164720] [2023-08-24 11:45:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:24,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:45:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:45:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:45:24,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 231 [2023-08-24 11:45:24,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:24,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:24,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 231 [2023-08-24 11:45:24,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:25,020 INFO L124 PetriNetUnfolderBase]: 5012/7391 cut-off events. [2023-08-24 11:45:25,021 INFO L125 PetriNetUnfolderBase]: For 4853/4924 co-relation queries the response was YES. [2023-08-24 11:45:25,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20594 conditions, 7391 events. 5012/7391 cut-off events. For 4853/4924 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 42681 event pairs, 1439 based on Foata normal form. 42/7261 useless extension candidates. Maximal degree in co-relation 20581. Up to 6319 conditions per place. [2023-08-24 11:45:25,077 INFO L140 encePairwiseOnDemand]: 227/231 looper letters, 44 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-24 11:45:25,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 308 flow [2023-08-24 11:45:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:45:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:45:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-24 11:45:25,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295815295815296 [2023-08-24 11:45:25,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-24 11:45:25,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-24 11:45:25,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:25,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-24 11:45:25,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:25,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:25,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:25,082 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 150 flow. Second operand 3 states and 367 transitions. [2023-08-24 11:45:25,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 308 flow [2023-08-24 11:45:25,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:45:25,085 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 184 flow [2023-08-24 11:45:25,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-24 11:45:25,086 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-24 11:45:25,086 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 184 flow [2023-08-24 11:45:25,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:25,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:25,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:25,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:45:25,087 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:25,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1264065504, now seen corresponding path program 1 times [2023-08-24 11:45:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56690296] [2023-08-24 11:45:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:25,671 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-24 11:45:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:25,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56690296] [2023-08-24 11:45:25,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56690296] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:25,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:25,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:25,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941662891] [2023-08-24 11:45:25,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:25,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:25,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:25,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:25,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:25,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 231 [2023-08-24 11:45:25,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:25,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:25,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 231 [2023-08-24 11:45:25,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:26,901 INFO L124 PetriNetUnfolderBase]: 9537/13378 cut-off events. [2023-08-24 11:45:26,901 INFO L125 PetriNetUnfolderBase]: For 8791/8791 co-relation queries the response was YES. [2023-08-24 11:45:26,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38573 conditions, 13378 events. 9537/13378 cut-off events. For 8791/8791 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 71228 event pairs, 2133 based on Foata normal form. 200/13578 useless extension candidates. Maximal degree in co-relation 38557. Up to 6077 conditions per place. [2023-08-24 11:45:26,975 INFO L140 encePairwiseOnDemand]: 220/231 looper letters, 58 selfloop transitions, 24 changer transitions 0/82 dead transitions. [2023-08-24 11:45:26,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 512 flow [2023-08-24 11:45:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2023-08-24 11:45:26,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2023-08-24 11:45:26,977 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 448 transitions. [2023-08-24 11:45:26,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 448 transitions. [2023-08-24 11:45:26,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:26,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 448 transitions. [2023-08-24 11:45:26,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:26,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:26,981 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:26,981 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 184 flow. Second operand 4 states and 448 transitions. [2023-08-24 11:45:26,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 512 flow [2023-08-24 11:45:26,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:26,991 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 398 flow [2023-08-24 11:45:26,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=48, PETRI_TRANSITIONS=55} [2023-08-24 11:45:26,993 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-24 11:45:26,993 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 55 transitions, 398 flow [2023-08-24 11:45:26,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:26,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:26,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:26,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:45:26,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:26,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1264002078, now seen corresponding path program 1 times [2023-08-24 11:45:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180437567] [2023-08-24 11:45:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:27,365 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-24 11:45:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180437567] [2023-08-24 11:45:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180437567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:27,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:27,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:45:27,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155596947] [2023-08-24 11:45:27,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:27,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:27,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:27,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:27,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 231 [2023-08-24 11:45:27,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 55 transitions, 398 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:27,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:27,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 231 [2023-08-24 11:45:27,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:28,331 INFO L124 PetriNetUnfolderBase]: 7365/10921 cut-off events. [2023-08-24 11:45:28,331 INFO L125 PetriNetUnfolderBase]: For 19957/20378 co-relation queries the response was YES. [2023-08-24 11:45:28,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37405 conditions, 10921 events. 7365/10921 cut-off events. For 19957/20378 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 64913 event pairs, 1535 based on Foata normal form. 238/11065 useless extension candidates. Maximal degree in co-relation 37385. Up to 8992 conditions per place. [2023-08-24 11:45:28,400 INFO L140 encePairwiseOnDemand]: 227/231 looper letters, 56 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2023-08-24 11:45:28,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 666 flow [2023-08-24 11:45:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:45:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:45:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-24 11:45:28,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122655122655123 [2023-08-24 11:45:28,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-24 11:45:28,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-24 11:45:28,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:28,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-24 11:45:28,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:28,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:28,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:28,405 INFO L175 Difference]: Start difference. First operand has 48 places, 55 transitions, 398 flow. Second operand 3 states and 355 transitions. [2023-08-24 11:45:28,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 666 flow [2023-08-24 11:45:28,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:45:28,421 INFO L231 Difference]: Finished difference. Result has 51 places, 59 transitions, 452 flow [2023-08-24 11:45:28,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=51, PETRI_TRANSITIONS=59} [2023-08-24 11:45:28,421 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-24 11:45:28,422 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 59 transitions, 452 flow [2023-08-24 11:45:28,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:28,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:28,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:28,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:45:28,422 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:28,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -216926238, now seen corresponding path program 1 times [2023-08-24 11:45:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645634782] [2023-08-24 11:45:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:28,691 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-24 11:45:28,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:28,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645634782] [2023-08-24 11:45:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645634782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:28,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:28,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781216263] [2023-08-24 11:45:28,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:28,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:28,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:28,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:28,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 231 [2023-08-24 11:45:28,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 59 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:28,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:28,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 231 [2023-08-24 11:45:28,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:29,638 INFO L124 PetriNetUnfolderBase]: 7402/10982 cut-off events. [2023-08-24 11:45:29,639 INFO L125 PetriNetUnfolderBase]: For 22978/23492 co-relation queries the response was YES. [2023-08-24 11:45:29,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39416 conditions, 10982 events. 7402/10982 cut-off events. For 22978/23492 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 65589 event pairs, 1122 based on Foata normal form. 276/11227 useless extension candidates. Maximal degree in co-relation 39393. Up to 7433 conditions per place. [2023-08-24 11:45:29,703 INFO L140 encePairwiseOnDemand]: 225/231 looper letters, 65 selfloop transitions, 18 changer transitions 0/98 dead transitions. [2023-08-24 11:45:29,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 98 transitions, 882 flow [2023-08-24 11:45:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-24 11:45:29,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108225108225108 [2023-08-24 11:45:29,705 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-24 11:45:29,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-24 11:45:29,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:29,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-24 11:45:29,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:29,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:29,709 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:29,709 INFO L175 Difference]: Start difference. First operand has 51 places, 59 transitions, 452 flow. Second operand 4 states and 472 transitions. [2023-08-24 11:45:29,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 98 transitions, 882 flow [2023-08-24 11:45:29,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:29,725 INFO L231 Difference]: Finished difference. Result has 54 places, 68 transitions, 582 flow [2023-08-24 11:45:29,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=582, PETRI_PLACES=54, PETRI_TRANSITIONS=68} [2023-08-24 11:45:29,727 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-24 11:45:29,727 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 582 flow [2023-08-24 11:45:29,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:29,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:29,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:29,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:45:29,731 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:29,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash -217029468, now seen corresponding path program 2 times [2023-08-24 11:45:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861909380] [2023-08-24 11:45:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:30,144 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-24 11:45:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861909380] [2023-08-24 11:45:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861909380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:30,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:30,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:30,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967166130] [2023-08-24 11:45:30,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:30,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:30,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:30,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 231 [2023-08-24 11:45:30,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 68 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:30,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:30,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 231 [2023-08-24 11:45:30,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:31,147 INFO L124 PetriNetUnfolderBase]: 7327/10865 cut-off events. [2023-08-24 11:45:31,147 INFO L125 PetriNetUnfolderBase]: For 29970/30587 co-relation queries the response was YES. [2023-08-24 11:45:31,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41611 conditions, 10865 events. 7327/10865 cut-off events. For 29970/30587 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 64341 event pairs, 1161 based on Foata normal form. 356/11190 useless extension candidates. Maximal degree in co-relation 41586. Up to 7409 conditions per place. [2023-08-24 11:45:31,210 INFO L140 encePairwiseOnDemand]: 226/231 looper letters, 65 selfloop transitions, 21 changer transitions 0/101 dead transitions. [2023-08-24 11:45:31,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 992 flow [2023-08-24 11:45:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-24 11:45:31,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054112554112554 [2023-08-24 11:45:31,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-24 11:45:31,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-24 11:45:31,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:31,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-24 11:45:31,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:31,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:31,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:31,216 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 582 flow. Second operand 4 states and 467 transitions. [2023-08-24 11:45:31,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 992 flow [2023-08-24 11:45:31,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 101 transitions, 972 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:31,237 INFO L231 Difference]: Finished difference. Result has 57 places, 74 transitions, 689 flow [2023-08-24 11:45:31,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=689, PETRI_PLACES=57, PETRI_TRANSITIONS=74} [2023-08-24 11:45:31,238 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-08-24 11:45:31,238 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 74 transitions, 689 flow [2023-08-24 11:45:31,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:31,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:31,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:31,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:45:31,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:31,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash -216925153, now seen corresponding path program 1 times [2023-08-24 11:45:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485805827] [2023-08-24 11:45:31,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:31,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:31,789 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-24 11:45:31,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:31,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485805827] [2023-08-24 11:45:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485805827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:31,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:31,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992223913] [2023-08-24 11:45:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:31,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:31,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:31,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 231 [2023-08-24 11:45:31,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 74 transitions, 689 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:31,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:31,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 231 [2023-08-24 11:45:31,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:32,578 INFO L124 PetriNetUnfolderBase]: 7147/10619 cut-off events. [2023-08-24 11:45:32,578 INFO L125 PetriNetUnfolderBase]: For 36363/36983 co-relation queries the response was YES. [2023-08-24 11:45:32,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42103 conditions, 10619 events. 7147/10619 cut-off events. For 36363/36983 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 62940 event pairs, 1091 based on Foata normal form. 414/10979 useless extension candidates. Maximal degree in co-relation 42076. Up to 7928 conditions per place. [2023-08-24 11:45:32,634 INFO L140 encePairwiseOnDemand]: 226/231 looper letters, 86 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2023-08-24 11:45:32,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 112 transitions, 1153 flow [2023-08-24 11:45:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-24 11:45:32,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054112554112554 [2023-08-24 11:45:32,637 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-24 11:45:32,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-24 11:45:32,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:32,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-24 11:45:32,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:32,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:32,640 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:32,640 INFO L175 Difference]: Start difference. First operand has 57 places, 74 transitions, 689 flow. Second operand 4 states and 467 transitions. [2023-08-24 11:45:32,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 112 transitions, 1153 flow [2023-08-24 11:45:32,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 112 transitions, 1133 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:32,662 INFO L231 Difference]: Finished difference. Result has 60 places, 78 transitions, 738 flow [2023-08-24 11:45:32,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=738, PETRI_PLACES=60, PETRI_TRANSITIONS=78} [2023-08-24 11:45:32,663 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-08-24 11:45:32,663 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 78 transitions, 738 flow [2023-08-24 11:45:32,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:32,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:32,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:32,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:45:32,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:32,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1865218161, now seen corresponding path program 1 times [2023-08-24 11:45:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:32,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340455482] [2023-08-24 11:45:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:32,938 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-24 11:45:32,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:32,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340455482] [2023-08-24 11:45:32,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340455482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:32,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:32,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909211430] [2023-08-24 11:45:32,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:32,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:32,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:32,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:32,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 231 [2023-08-24 11:45:32,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 78 transitions, 738 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:32,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:32,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 231 [2023-08-24 11:45:32,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:34,001 INFO L124 PetriNetUnfolderBase]: 7021/10427 cut-off events. [2023-08-24 11:45:34,002 INFO L125 PetriNetUnfolderBase]: For 40956/41596 co-relation queries the response was YES. [2023-08-24 11:45:34,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42362 conditions, 10427 events. 7021/10427 cut-off events. For 40956/41596 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 61328 event pairs, 1127 based on Foata normal form. 422/10802 useless extension candidates. Maximal degree in co-relation 42333. Up to 7137 conditions per place. [2023-08-24 11:45:34,069 INFO L140 encePairwiseOnDemand]: 225/231 looper letters, 68 selfloop transitions, 21 changer transitions 0/104 dead transitions. [2023-08-24 11:45:34,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 104 transitions, 1076 flow [2023-08-24 11:45:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-24 11:45:34,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140692640692641 [2023-08-24 11:45:34,072 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-24 11:45:34,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-24 11:45:34,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:34,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-24 11:45:34,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:34,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:34,075 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:34,075 INFO L175 Difference]: Start difference. First operand has 60 places, 78 transitions, 738 flow. Second operand 4 states and 475 transitions. [2023-08-24 11:45:34,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 104 transitions, 1076 flow [2023-08-24 11:45:34,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 104 transitions, 1061 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:34,116 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 785 flow [2023-08-24 11:45:34,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=785, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2023-08-24 11:45:34,117 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2023-08-24 11:45:34,117 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 785 flow [2023-08-24 11:45:34,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:34,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:34,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:34,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:45:34,118 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:34,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1865219215, now seen corresponding path program 1 times [2023-08-24 11:45:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012859271] [2023-08-24 11:45:34,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:34,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:34,388 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-24 11:45:34,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:34,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012859271] [2023-08-24 11:45:34,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012859271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:34,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:34,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151326688] [2023-08-24 11:45:34,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:34,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:34,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:34,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:34,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:34,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 231 [2023-08-24 11:45:34,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 785 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:34,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:34,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 231 [2023-08-24 11:45:34,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:35,257 INFO L124 PetriNetUnfolderBase]: 7632/11216 cut-off events. [2023-08-24 11:45:35,257 INFO L125 PetriNetUnfolderBase]: For 47545/48481 co-relation queries the response was YES. [2023-08-24 11:45:35,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47156 conditions, 11216 events. 7632/11216 cut-off events. For 47545/48481 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 66060 event pairs, 1169 based on Foata normal form. 463/11526 useless extension candidates. Maximal degree in co-relation 47126. Up to 7550 conditions per place. [2023-08-24 11:45:35,333 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 75 selfloop transitions, 30 changer transitions 0/120 dead transitions. [2023-08-24 11:45:35,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 120 transitions, 1283 flow [2023-08-24 11:45:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:45:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:45:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-08-24 11:45:35,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073593073593073 [2023-08-24 11:45:35,339 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-08-24 11:45:35,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-08-24 11:45:35,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:35,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-08-24 11:45:35,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:35,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:35,346 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:35,347 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 785 flow. Second operand 5 states and 586 transitions. [2023-08-24 11:45:35,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 120 transitions, 1283 flow [2023-08-24 11:45:35,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 1241 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:35,393 INFO L231 Difference]: Finished difference. Result has 64 places, 87 transitions, 929 flow [2023-08-24 11:45:35,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=929, PETRI_PLACES=64, PETRI_TRANSITIONS=87} [2023-08-24 11:45:35,395 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-08-24 11:45:35,395 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 87 transitions, 929 flow [2023-08-24 11:45:35,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:35,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:35,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:35,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:45:35,396 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:35,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1861948405, now seen corresponding path program 2 times [2023-08-24 11:45:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229726600] [2023-08-24 11:45:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:35,721 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-24 11:45:35,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229726600] [2023-08-24 11:45:35,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229726600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:35,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:35,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353356546] [2023-08-24 11:45:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:35,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:35,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:35,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:35,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 231 [2023-08-24 11:45:35,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 87 transitions, 929 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:35,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:35,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 231 [2023-08-24 11:45:35,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:36,752 INFO L124 PetriNetUnfolderBase]: 8350/12260 cut-off events. [2023-08-24 11:45:36,753 INFO L125 PetriNetUnfolderBase]: For 63037/64175 co-relation queries the response was YES. [2023-08-24 11:45:36,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54006 conditions, 12260 events. 8350/12260 cut-off events. For 63037/64175 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 73842 event pairs, 1277 based on Foata normal form. 594/12721 useless extension candidates. Maximal degree in co-relation 53975. Up to 6163 conditions per place. [2023-08-24 11:45:36,834 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 88 selfloop transitions, 40 changer transitions 0/143 dead transitions. [2023-08-24 11:45:36,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1587 flow [2023-08-24 11:45:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2023-08-24 11:45:36,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036075036075036 [2023-08-24 11:45:36,837 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 698 transitions. [2023-08-24 11:45:36,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 698 transitions. [2023-08-24 11:45:36,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:36,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 698 transitions. [2023-08-24 11:45:36,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:36,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:36,842 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:36,842 INFO L175 Difference]: Start difference. First operand has 64 places, 87 transitions, 929 flow. Second operand 6 states and 698 transitions. [2023-08-24 11:45:36,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1587 flow [2023-08-24 11:45:36,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 143 transitions, 1515 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:36,961 INFO L231 Difference]: Finished difference. Result has 67 places, 93 transitions, 1050 flow [2023-08-24 11:45:36,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1050, PETRI_PLACES=67, PETRI_TRANSITIONS=93} [2023-08-24 11:45:36,962 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-24 11:45:36,962 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 93 transitions, 1050 flow [2023-08-24 11:45:36,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:36,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:36,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:36,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:45:36,963 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:36,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1987217764, now seen corresponding path program 1 times [2023-08-24 11:45:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:36,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108477516] [2023-08-24 11:45:36,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:37,550 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-24 11:45:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108477516] [2023-08-24 11:45:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108477516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069736028] [2023-08-24 11:45:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:37,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:37,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:37,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:37,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 231 [2023-08-24 11:45:37,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 93 transitions, 1050 flow. Second operand has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:37,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:37,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 231 [2023-08-24 11:45:37,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:38,837 INFO L124 PetriNetUnfolderBase]: 9399/13796 cut-off events. [2023-08-24 11:45:38,837 INFO L125 PetriNetUnfolderBase]: For 83851/85386 co-relation queries the response was YES. [2023-08-24 11:45:38,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63643 conditions, 13796 events. 9399/13796 cut-off events. For 83851/85386 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 85470 event pairs, 920 based on Foata normal form. 626/14150 useless extension candidates. Maximal degree in co-relation 63611. Up to 7129 conditions per place. [2023-08-24 11:45:38,913 INFO L140 encePairwiseOnDemand]: 225/231 looper letters, 106 selfloop transitions, 46 changer transitions 0/167 dead transitions. [2023-08-24 11:45:38,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 167 transitions, 1937 flow [2023-08-24 11:45:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2023-08-24 11:45:38,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2023-08-24 11:45:38,917 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2023-08-24 11:45:38,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2023-08-24 11:45:38,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:38,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2023-08-24 11:45:38,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:38,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:38,922 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:38,922 INFO L175 Difference]: Start difference. First operand has 67 places, 93 transitions, 1050 flow. Second operand 7 states and 805 transitions. [2023-08-24 11:45:38,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 167 transitions, 1937 flow [2023-08-24 11:45:39,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 167 transitions, 1859 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:39,064 INFO L231 Difference]: Finished difference. Result has 70 places, 105 transitions, 1282 flow [2023-08-24 11:45:39,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1282, PETRI_PLACES=70, PETRI_TRANSITIONS=105} [2023-08-24 11:45:39,066 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-24 11:45:39,066 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 105 transitions, 1282 flow [2023-08-24 11:45:39,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:39,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:39,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:39,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:45:39,067 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:39,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1988234750, now seen corresponding path program 1 times [2023-08-24 11:45:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:39,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618293505] [2023-08-24 11:45:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:39,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:39,222 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-24 11:45:39,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618293505] [2023-08-24 11:45:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618293505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125733470] [2023-08-24 11:45:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:39,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:39,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:39,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:39,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 231 [2023-08-24 11:45:39,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 105 transitions, 1282 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:39,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:39,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 231 [2023-08-24 11:45:39,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:40,388 INFO L124 PetriNetUnfolderBase]: 8111/12182 cut-off events. [2023-08-24 11:45:40,389 INFO L125 PetriNetUnfolderBase]: For 113448/116544 co-relation queries the response was YES. [2023-08-24 11:45:40,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57981 conditions, 12182 events. 8111/12182 cut-off events. For 113448/116544 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 80876 event pairs, 1329 based on Foata normal form. 2212/13995 useless extension candidates. Maximal degree in co-relation 57948. Up to 7762 conditions per place. [2023-08-24 11:45:40,446 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 184 selfloop transitions, 9 changer transitions 64/275 dead transitions. [2023-08-24 11:45:40,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 275 transitions, 4034 flow [2023-08-24 11:45:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:45:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:45:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2023-08-24 11:45:40,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021645021645021 [2023-08-24 11:45:40,449 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2023-08-24 11:45:40,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2023-08-24 11:45:40,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:40,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2023-08-24 11:45:40,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:40,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:40,453 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:40,453 INFO L175 Difference]: Start difference. First operand has 70 places, 105 transitions, 1282 flow. Second operand 5 states and 580 transitions. [2023-08-24 11:45:40,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 275 transitions, 4034 flow [2023-08-24 11:45:40,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 275 transitions, 3904 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:40,538 INFO L231 Difference]: Finished difference. Result has 74 places, 107 transitions, 1246 flow [2023-08-24 11:45:40,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1246, PETRI_PLACES=74, PETRI_TRANSITIONS=107} [2023-08-24 11:45:40,539 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-08-24 11:45:40,539 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 107 transitions, 1246 flow [2023-08-24 11:45:40,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:40,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:40,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:40,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:45:40,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:40,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 883558230, now seen corresponding path program 1 times [2023-08-24 11:45:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125275726] [2023-08-24 11:45:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:41,248 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-24 11:45:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125275726] [2023-08-24 11:45:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125275726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47386092] [2023-08-24 11:45:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:41,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:45:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:45:41,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:45:41,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 231 [2023-08-24 11:45:41,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 107 transitions, 1246 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:41,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:41,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 231 [2023-08-24 11:45:41,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:42,632 INFO L124 PetriNetUnfolderBase]: 9602/14943 cut-off events. [2023-08-24 11:45:42,632 INFO L125 PetriNetUnfolderBase]: For 105275/106788 co-relation queries the response was YES. [2023-08-24 11:45:42,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79426 conditions, 14943 events. 9602/14943 cut-off events. For 105275/106788 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 105265 event pairs, 713 based on Foata normal form. 661/15404 useless extension candidates. Maximal degree in co-relation 79390. Up to 6226 conditions per place. [2023-08-24 11:45:42,710 INFO L140 encePairwiseOnDemand]: 226/231 looper letters, 116 selfloop transitions, 33 changer transitions 7/171 dead transitions. [2023-08-24 11:45:42,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 171 transitions, 2073 flow [2023-08-24 11:45:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions. [2023-08-24 11:45:42,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963924963924964 [2023-08-24 11:45:42,712 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 688 transitions. [2023-08-24 11:45:42,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions. [2023-08-24 11:45:42,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:42,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions. [2023-08-24 11:45:42,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:42,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:42,717 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:42,717 INFO L175 Difference]: Start difference. First operand has 74 places, 107 transitions, 1246 flow. Second operand 6 states and 688 transitions. [2023-08-24 11:45:42,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 171 transitions, 2073 flow [2023-08-24 11:45:42,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 171 transitions, 2059 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:42,854 INFO L231 Difference]: Finished difference. Result has 79 places, 106 transitions, 1330 flow [2023-08-24 11:45:42,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1330, PETRI_PLACES=79, PETRI_TRANSITIONS=106} [2023-08-24 11:45:42,854 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 39 predicate places. [2023-08-24 11:45:42,854 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 106 transitions, 1330 flow [2023-08-24 11:45:42,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:42,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:42,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:42,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 11:45:42,855 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:42,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1119443368, now seen corresponding path program 1 times [2023-08-24 11:45:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:42,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941727649] [2023-08-24 11:45:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:42,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:43,003 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-24 11:45:43,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:43,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941727649] [2023-08-24 11:45:43,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941727649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:43,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:43,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910135960] [2023-08-24 11:45:43,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:43,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:43,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 231 [2023-08-24 11:45:43,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 106 transitions, 1330 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:43,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:43,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 231 [2023-08-24 11:45:43,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:44,154 INFO L124 PetriNetUnfolderBase]: 6965/10974 cut-off events. [2023-08-24 11:45:44,154 INFO L125 PetriNetUnfolderBase]: For 126600/129847 co-relation queries the response was YES. [2023-08-24 11:45:44,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61858 conditions, 10974 events. 6965/10974 cut-off events. For 126600/129847 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 78044 event pairs, 430 based on Foata normal form. 2175/12860 useless extension candidates. Maximal degree in co-relation 61820. Up to 4562 conditions per place. [2023-08-24 11:45:44,207 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 251 selfloop transitions, 17 changer transitions 86/372 dead transitions. [2023-08-24 11:45:44,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 372 transitions, 5878 flow [2023-08-24 11:45:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2023-08-24 11:45:44,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015460729746444 [2023-08-24 11:45:44,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2023-08-24 11:45:44,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2023-08-24 11:45:44,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:44,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2023-08-24 11:45:44,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:44,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:44,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:44,214 INFO L175 Difference]: Start difference. First operand has 79 places, 106 transitions, 1330 flow. Second operand 7 states and 811 transitions. [2023-08-24 11:45:44,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 372 transitions, 5878 flow [2023-08-24 11:45:44,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 372 transitions, 5671 flow, removed 72 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:44,315 INFO L231 Difference]: Finished difference. Result has 85 places, 111 transitions, 1376 flow [2023-08-24 11:45:44,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1376, PETRI_PLACES=85, PETRI_TRANSITIONS=111} [2023-08-24 11:45:44,316 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 45 predicate places. [2023-08-24 11:45:44,316 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 111 transitions, 1376 flow [2023-08-24 11:45:44,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:44,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:44,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:44,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 11:45:44,317 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:44,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1462231072, now seen corresponding path program 1 times [2023-08-24 11:45:44,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:44,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619070363] [2023-08-24 11:45:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:44,441 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-24 11:45:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:44,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619070363] [2023-08-24 11:45:44,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619070363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:44,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:44,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521439305] [2023-08-24 11:45:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:44,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:44,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:44,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:44,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:44,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 231 [2023-08-24 11:45:44,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 111 transitions, 1376 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:44,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:44,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 231 [2023-08-24 11:45:44,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:46,204 INFO L124 PetriNetUnfolderBase]: 11002/17562 cut-off events. [2023-08-24 11:45:46,204 INFO L125 PetriNetUnfolderBase]: For 156460/157394 co-relation queries the response was YES. [2023-08-24 11:45:46,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110052 conditions, 17562 events. 11002/17562 cut-off events. For 156460/157394 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 133158 event pairs, 1426 based on Foata normal form. 592/18051 useless extension candidates. Maximal degree in co-relation 110011. Up to 8518 conditions per place. [2023-08-24 11:45:46,277 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 124 selfloop transitions, 1 changer transitions 98/236 dead transitions. [2023-08-24 11:45:46,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 236 transitions, 3367 flow [2023-08-24 11:45:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-24 11:45:46,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-08-24 11:45:46,279 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-24 11:45:46,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-24 11:45:46,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:46,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-24 11:45:46,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:46,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:46,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:46,282 INFO L175 Difference]: Start difference. First operand has 85 places, 111 transitions, 1376 flow. Second operand 4 states and 483 transitions. [2023-08-24 11:45:46,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 236 transitions, 3367 flow [2023-08-24 11:45:47,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 236 transitions, 3238 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:47,090 INFO L231 Difference]: Finished difference. Result has 87 places, 97 transitions, 1138 flow [2023-08-24 11:45:47,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1138, PETRI_PLACES=87, PETRI_TRANSITIONS=97} [2023-08-24 11:45:47,091 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2023-08-24 11:45:47,091 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 97 transitions, 1138 flow [2023-08-24 11:45:47,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:47,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:47,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:47,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 11:45:47,092 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:47,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1801716800, now seen corresponding path program 2 times [2023-08-24 11:45:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:47,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025128926] [2023-08-24 11:45:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:47,559 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-24 11:45:47,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:47,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025128926] [2023-08-24 11:45:47,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025128926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:47,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:47,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:47,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883607507] [2023-08-24 11:45:47,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:47,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:47,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:47,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:47,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:47,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 231 [2023-08-24 11:45:47,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 97 transitions, 1138 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:47,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:47,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 231 [2023-08-24 11:45:47,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:49,288 INFO L124 PetriNetUnfolderBase]: 9364/14977 cut-off events. [2023-08-24 11:45:49,288 INFO L125 PetriNetUnfolderBase]: For 108015/108015 co-relation queries the response was YES. [2023-08-24 11:45:49,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83932 conditions, 14977 events. 9364/14977 cut-off events. For 108015/108015 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 104950 event pairs, 1612 based on Foata normal form. 31/15008 useless extension candidates. Maximal degree in co-relation 83890. Up to 6838 conditions per place. [2023-08-24 11:45:49,379 INFO L140 encePairwiseOnDemand]: 220/231 looper letters, 96 selfloop transitions, 19 changer transitions 69/184 dead transitions. [2023-08-24 11:45:49,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 184 transitions, 2323 flow [2023-08-24 11:45:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-24 11:45:49,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48268398268398266 [2023-08-24 11:45:49,382 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-24 11:45:49,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-24 11:45:49,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:49,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-24 11:45:49,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:49,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:49,385 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:49,385 INFO L175 Difference]: Start difference. First operand has 87 places, 97 transitions, 1138 flow. Second operand 4 states and 446 transitions. [2023-08-24 11:45:49,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 184 transitions, 2323 flow [2023-08-24 11:45:50,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 184 transitions, 2253 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-24 11:45:50,033 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 901 flow [2023-08-24 11:45:50,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=901, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2023-08-24 11:45:50,033 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 44 predicate places. [2023-08-24 11:45:50,033 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 901 flow [2023-08-24 11:45:50,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:50,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:50,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:50,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 11:45:50,034 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:50,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1461724383, now seen corresponding path program 1 times [2023-08-24 11:45:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867789893] [2023-08-24 11:45:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:50,214 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-24 11:45:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867789893] [2023-08-24 11:45:50,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867789893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:50,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:50,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934446598] [2023-08-24 11:45:50,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:50,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:50,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 231 [2023-08-24 11:45:50,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 901 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:50,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:50,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 231 [2023-08-24 11:45:50,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:50,895 INFO L124 PetriNetUnfolderBase]: 2486/4563 cut-off events. [2023-08-24 11:45:50,895 INFO L125 PetriNetUnfolderBase]: For 41175/41759 co-relation queries the response was YES. [2023-08-24 11:45:50,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24582 conditions, 4563 events. 2486/4563 cut-off events. For 41175/41759 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 33724 event pairs, 167 based on Foata normal form. 791/5267 useless extension candidates. Maximal degree in co-relation 24541. Up to 2020 conditions per place. [2023-08-24 11:45:50,927 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 116 selfloop transitions, 14 changer transitions 79/219 dead transitions. [2023-08-24 11:45:50,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 219 transitions, 3178 flow [2023-08-24 11:45:50,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2023-08-24 11:45:50,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015460729746444 [2023-08-24 11:45:50,930 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2023-08-24 11:45:50,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2023-08-24 11:45:50,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:50,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2023-08-24 11:45:50,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:50,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:50,935 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:50,935 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 901 flow. Second operand 7 states and 811 transitions. [2023-08-24 11:45:50,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 219 transitions, 3178 flow [2023-08-24 11:45:50,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 219 transitions, 3083 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:50,999 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 903 flow [2023-08-24 11:45:50,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=903, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2023-08-24 11:45:51,000 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2023-08-24 11:45:51,000 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 903 flow [2023-08-24 11:45:51,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:51,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:51,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:51,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 11:45:51,001 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:51,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1128506420, now seen corresponding path program 1 times [2023-08-24 11:45:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962433340] [2023-08-24 11:45:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:51,186 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-24 11:45:51,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962433340] [2023-08-24 11:45:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962433340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:51,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:51,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:45:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710055146] [2023-08-24 11:45:51,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:51,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:45:51,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:51,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:45:51,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:45:51,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 231 [2023-08-24 11:45:51,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 903 flow. Second operand has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:51,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:51,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 231 [2023-08-24 11:45:51,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:51,649 INFO L124 PetriNetUnfolderBase]: 1889/3558 cut-off events. [2023-08-24 11:45:51,649 INFO L125 PetriNetUnfolderBase]: For 26132/26343 co-relation queries the response was YES. [2023-08-24 11:45:51,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20400 conditions, 3558 events. 1889/3558 cut-off events. For 26132/26343 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 25972 event pairs, 149 based on Foata normal form. 251/3748 useless extension candidates. Maximal degree in co-relation 20357. Up to 1350 conditions per place. [2023-08-24 11:45:51,670 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 31 selfloop transitions, 17 changer transitions 148/200 dead transitions. [2023-08-24 11:45:51,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 200 transitions, 2889 flow [2023-08-24 11:45:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:45:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:45:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1013 transitions. [2023-08-24 11:45:51,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48725348725348727 [2023-08-24 11:45:51,673 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1013 transitions. [2023-08-24 11:45:51,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1013 transitions. [2023-08-24 11:45:51,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:51,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1013 transitions. [2023-08-24 11:45:51,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:51,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:51,678 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:51,678 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 903 flow. Second operand 9 states and 1013 transitions. [2023-08-24 11:45:51,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 200 transitions, 2889 flow [2023-08-24 11:45:51,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 200 transitions, 2634 flow, removed 72 selfloop flow, removed 6 redundant places. [2023-08-24 11:45:51,840 INFO L231 Difference]: Finished difference. Result has 90 places, 39 transitions, 361 flow [2023-08-24 11:45:51,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=361, PETRI_PLACES=90, PETRI_TRANSITIONS=39} [2023-08-24 11:45:51,841 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 50 predicate places. [2023-08-24 11:45:51,841 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 39 transitions, 361 flow [2023-08-24 11:45:51,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:51,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:51,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:51,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 11:45:51,842 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:51,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1335249205, now seen corresponding path program 1 times [2023-08-24 11:45:51,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824229019] [2023-08-24 11:45:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:45:51,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:45:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:45:51,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:45:51,916 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:45:51,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 11:45:51,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 11:45:51,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 11:45:51,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 11:45:51,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 11:45:51,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 11:45:51,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 11:45:51,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 11:45:51,920 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:51,925 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:45:51,925 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:45:51,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:45:51 BasicIcfg [2023-08-24 11:45:51,990 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:45:51,990 INFO L158 Benchmark]: Toolchain (without parser) took 37423.99ms. Allocated memory was 362.8MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 337.8MB in the beginning and 1.2GB in the end (delta: -852.5MB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-24 11:45:51,990 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 362.8MB. Free memory is still 339.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:45:51,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.65ms. Allocated memory is still 362.8MB. Free memory was 337.8MB in the beginning and 314.4MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:51,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.05ms. Allocated memory is still 362.8MB. Free memory was 314.4MB in the beginning and 311.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:51,991 INFO L158 Benchmark]: Boogie Preprocessor took 54.16ms. Allocated memory is still 362.8MB. Free memory was 311.6MB in the beginning and 309.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:51,991 INFO L158 Benchmark]: RCFGBuilder took 702.62ms. Allocated memory is still 362.8MB. Free memory was 309.4MB in the beginning and 327.2MB in the end (delta: -17.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-24 11:45:51,991 INFO L158 Benchmark]: TraceAbstraction took 36016.10ms. Allocated memory was 362.8MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 326.4MB in the beginning and 1.2GB in the end (delta: -863.9MB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-24 11:45:51,992 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 362.8MB. Free memory is still 339.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 575.65ms. Allocated memory is still 362.8MB. Free memory was 337.8MB in the beginning and 314.4MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.05ms. Allocated memory is still 362.8MB. Free memory was 314.4MB in the beginning and 311.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.16ms. Allocated memory is still 362.8MB. Free memory was 311.6MB in the beginning and 309.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 702.62ms. Allocated memory is still 362.8MB. Free memory was 309.4MB in the beginning and 327.2MB in the end (delta: -17.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 36016.10ms. Allocated memory was 362.8MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 326.4MB in the beginning and 1.2GB in the end (delta: -863.9MB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 132 PlacesBefore, 40 PlacesAfterwards, 121 TransitionsBefore, 27 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 106 TotalNumberOfCompositions, 6414 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3451, independent: 3280, independent conditional: 0, independent unconditional: 3280, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1508, independent: 1454, independent conditional: 0, independent unconditional: 1454, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3451, independent: 1826, independent conditional: 0, independent unconditional: 1826, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 1508, unknown conditional: 0, unknown unconditional: 1508] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-3, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-2, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1633 IncrementalHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 34 mSDtfsCounter, 1633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1376occurred in iteration=15, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 2740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 11:45:52,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...