/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 INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:35:39,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:35:39,300 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 05:35:39,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:35:39,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:35:39,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:35:39,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:35:39,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:35:39,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:35:39,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:35:39,335 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:35:39,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:35:39,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:35:39,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:35:39,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:35:39,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:35:39,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:35:39,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:35:39,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:35:39,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:35:39,338 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:35:39,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:35:39,339 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:35:39,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:35:39,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:35:39,339 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:35:39,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:35:39,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:35:39,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:35:39,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:35:39,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:35:39,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:35:39,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:35:39,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:35:39,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:35:39,342 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 -> INSUFFICIENT_FIRST [2023-08-24 05:35:39,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:35:39,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:35:39,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:35:39,663 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:35:39,664 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:35:39,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:35:40,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:35:41,080 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:35:41,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:35:41,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560f7ea44/8ab6347333ee409eb10b7a0eafbfce27/FLAG17f630bcc [2023-08-24 05:35:41,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560f7ea44/8ab6347333ee409eb10b7a0eafbfce27 [2023-08-24 05:35:41,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:35:41,110 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:35:41,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:35:41,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:35:41,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:35:41,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73578e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41, skipping insertion in model container [2023-08-24 05:35:41,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,178 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:35:41,343 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-24 05:35:41,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:35:41,566 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:35:41,575 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-24 05:35:41,592 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:35:41,593 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:35:41,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:35:41,652 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:35:41,652 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:35:41,658 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:35:41,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41 WrapperNode [2023-08-24 05:35:41,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:35:41,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:35:41,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:35:41,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:35:41,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,707 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-24 05:35:41,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:35:41,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:35:41,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:35:41,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:35:41,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:35:41,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:35:41,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:35:41,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:35:41,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:35:41,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:35:41,775 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 05:35:41,796 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 05:35:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:35:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:35:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:35:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:35:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:35:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:35:41,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:35:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:35:41,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:35:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:35:41,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:35:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:35:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:35:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:35:41,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:35:41,813 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 05:35:41,921 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:35:41,922 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:35:42,143 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:35:42,285 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:35:42,285 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:35:42,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:35:42 BoogieIcfgContainer [2023-08-24 05:35:42,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:35:42,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:35:42,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:35:42,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:35:42,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:35:41" (1/3) ... [2023-08-24 05:35:42,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7cab46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:35:42, skipping insertion in model container [2023-08-24 05:35:42,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (2/3) ... [2023-08-24 05:35:42,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7cab46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:35:42, skipping insertion in model container [2023-08-24 05:35:42,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:35:42" (3/3) ... [2023-08-24 05:35:42,296 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:35:42,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:35:42,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:35:42,312 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:35:42,372 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:35:42,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2023-08-24 05:35:42,464 INFO L124 PetriNetUnfolderBase]: 2/102 cut-off events. [2023-08-24 05:35:42,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:35:42,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-24 05:35:42,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2023-08-24 05:35:42,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2023-08-24 05:35:42,477 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:35:42,491 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2023-08-24 05:35:42,495 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2023-08-24 05:35:42,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2023-08-24 05:35:42,539 INFO L124 PetriNetUnfolderBase]: 2/102 cut-off events. [2023-08-24 05:35:42,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:35:42,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-24 05:35:42,541 INFO L119 LiptonReduction]: Number of co-enabled transitions 1818 [2023-08-24 05:35:46,489 INFO L134 LiptonReduction]: Checked pairs total: 4335 [2023-08-24 05:35:46,489 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-24 05:35:46,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:35:46,515 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;@403360f7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:35:46,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:35:46,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:35:46,517 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:35:46,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:35:46,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:46,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:35:46,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:46,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 464724, now seen corresponding path program 1 times [2023-08-24 05:35:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574460453] [2023-08-24 05:35:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:46,854 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 05:35:46,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574460453] [2023-08-24 05:35:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574460453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:46,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:46,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:35:46,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289638973] [2023-08-24 05:35:46,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:46,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:35:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:46,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:35:46,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:35:46,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-08-24 05:35:46,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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 05:35:46,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:46,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-08-24 05:35:46,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:47,096 INFO L124 PetriNetUnfolderBase]: 711/1126 cut-off events. [2023-08-24 05:35:47,096 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-24 05:35:47,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 1126 events. 711/1126 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5132 event pairs, 191 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 2234. Up to 871 conditions per place. [2023-08-24 05:35:47,105 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 29 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-08-24 05:35:47,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 151 flow [2023-08-24 05:35:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:35:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:35:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-24 05:35:47,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142378559463987 [2023-08-24 05:35:47,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-24 05:35:47,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-24 05:35:47,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:47,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-24 05:35:47,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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 05:35:47,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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 05:35:47,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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 05:35:47,127 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 307 transitions. [2023-08-24 05:35:47,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 151 flow [2023-08-24 05:35:47,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:35:47,131 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-08-24 05:35:47,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-24 05:35:47,135 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-24 05:35:47,135 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-08-24 05:35:47,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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 05:35:47,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:47,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:47,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:35:47,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:47,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1006435865, now seen corresponding path program 1 times [2023-08-24 05:35:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:47,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709991984] [2023-08-24 05:35:47,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:47,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:48,127 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 05:35:48,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709991984] [2023-08-24 05:35:48,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709991984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:48,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:48,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:35:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295532512] [2023-08-24 05:35:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:48,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:48,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-08-24 05:35:48,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 05:35:48,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:48,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-08-24 05:35:48,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:48,482 INFO L124 PetriNetUnfolderBase]: 1042/1562 cut-off events. [2023-08-24 05:35:48,483 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-08-24 05:35:48,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 1562 events. 1042/1562 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6877 event pairs, 166 based on Foata normal form. 30/1592 useless extension candidates. Maximal degree in co-relation 3261. Up to 1323 conditions per place. [2023-08-24 05:35:48,494 INFO L140 encePairwiseOnDemand]: 190/199 looper letters, 37 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-24 05:35:48,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 208 flow [2023-08-24 05:35:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-08-24 05:35:48,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585427135678392 [2023-08-24 05:35:48,501 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-08-24 05:35:48,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-08-24 05:35:48,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:48,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-08-24 05:35:48,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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 05:35:48,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:48,507 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:48,507 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 365 transitions. [2023-08-24 05:35:48,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 208 flow [2023-08-24 05:35:48,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:35:48,509 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 109 flow [2023-08-24 05:35:48,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-08-24 05:35:48,510 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-24 05:35:48,511 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 109 flow [2023-08-24 05:35:48,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 05:35:48,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:48,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:48,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:35:48,519 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:48,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1134739715, now seen corresponding path program 1 times [2023-08-24 05:35:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301351838] [2023-08-24 05:35:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:49,322 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 05:35:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:49,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301351838] [2023-08-24 05:35:49,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301351838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:49,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:49,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:35:49,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004741023] [2023-08-24 05:35:49,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:49,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:49,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-08-24 05:35:49,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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 05:35:49,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:49,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-08-24 05:35:49,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:49,569 INFO L124 PetriNetUnfolderBase]: 992/1491 cut-off events. [2023-08-24 05:35:49,569 INFO L125 PetriNetUnfolderBase]: For 543/543 co-relation queries the response was YES. [2023-08-24 05:35:49,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4172 conditions, 1491 events. 992/1491 cut-off events. For 543/543 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5968 event pairs, 181 based on Foata normal form. 18/1509 useless extension candidates. Maximal degree in co-relation 4160. Up to 1076 conditions per place. [2023-08-24 05:35:49,578 INFO L140 encePairwiseOnDemand]: 190/199 looper letters, 37 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-24 05:35:49,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 271 flow [2023-08-24 05:35:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2023-08-24 05:35:49,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44597989949748745 [2023-08-24 05:35:49,580 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 355 transitions. [2023-08-24 05:35:49,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 355 transitions. [2023-08-24 05:35:49,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:49,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 355 transitions. [2023-08-24 05:35:49,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.75) internal successors, (355), 4 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 05:35:49,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:49,583 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:49,583 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 109 flow. Second operand 4 states and 355 transitions. [2023-08-24 05:35:49,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 271 flow [2023-08-24 05:35:49,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:35:49,587 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 194 flow [2023-08-24 05:35:49,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2023-08-24 05:35:49,588 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-08-24 05:35:49,591 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 194 flow [2023-08-24 05:35:49,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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 05:35:49,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:49,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:49,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:35:49,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:49,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 112846102, now seen corresponding path program 1 times [2023-08-24 05:35:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663749840] [2023-08-24 05:35:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:50,680 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 05:35:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:50,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663749840] [2023-08-24 05:35:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663749840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809850451] [2023-08-24 05:35:50,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:50,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:50,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-08-24 05:35:50,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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 05:35:50,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:50,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-08-24 05:35:50,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:50,958 INFO L124 PetriNetUnfolderBase]: 999/1501 cut-off events. [2023-08-24 05:35:50,958 INFO L125 PetriNetUnfolderBase]: For 1366/1366 co-relation queries the response was YES. [2023-08-24 05:35:50,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4831 conditions, 1501 events. 999/1501 cut-off events. For 1366/1366 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6144 event pairs, 309 based on Foata normal form. 2/1503 useless extension candidates. Maximal degree in co-relation 4814. Up to 1301 conditions per place. [2023-08-24 05:35:50,967 INFO L140 encePairwiseOnDemand]: 188/199 looper letters, 35 selfloop transitions, 23 changer transitions 0/58 dead transitions. [2023-08-24 05:35:50,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 388 flow [2023-08-24 05:35:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-08-24 05:35:50,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457286432160804 [2023-08-24 05:35:50,969 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-08-24 05:35:50,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-08-24 05:35:50,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:50,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-08-24 05:35:50,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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 05:35:50,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:50,972 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:50,972 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 194 flow. Second operand 4 states and 364 transitions. [2023-08-24 05:35:50,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 388 flow [2023-08-24 05:35:50,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:35:50,979 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 304 flow [2023-08-24 05:35:50,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2023-08-24 05:35:50,981 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-24 05:35:50,981 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 304 flow [2023-08-24 05:35:50,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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 05:35:50,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:50,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:50,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:35:50,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:50,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash -484721764, now seen corresponding path program 1 times [2023-08-24 05:35:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:50,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937596487] [2023-08-24 05:35:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:51,608 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 05:35:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:51,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937596487] [2023-08-24 05:35:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937596487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:51,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:51,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847147125] [2023-08-24 05:35:51,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:51,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:51,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:51,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:51,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:51,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-08-24 05:35:51,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 05:35:51,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:51,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-08-24 05:35:51,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:51,923 INFO L124 PetriNetUnfolderBase]: 1262/1935 cut-off events. [2023-08-24 05:35:51,924 INFO L125 PetriNetUnfolderBase]: For 2999/2999 co-relation queries the response was YES. [2023-08-24 05:35:51,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 1935 events. 1262/1935 cut-off events. For 2999/2999 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8658 event pairs, 335 based on Foata normal form. 48/1983 useless extension candidates. Maximal degree in co-relation 7163. Up to 1039 conditions per place. [2023-08-24 05:35:51,935 INFO L140 encePairwiseOnDemand]: 192/199 looper letters, 52 selfloop transitions, 11 changer transitions 2/65 dead transitions. [2023-08-24 05:35:51,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 526 flow [2023-08-24 05:35:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 361 transitions. [2023-08-24 05:35:51,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4535175879396985 [2023-08-24 05:35:51,938 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 361 transitions. [2023-08-24 05:35:51,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 361 transitions. [2023-08-24 05:35:51,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:51,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 361 transitions. [2023-08-24 05:35:51,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 05:35:51,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:51,941 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:51,941 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 304 flow. Second operand 4 states and 361 transitions. [2023-08-24 05:35:51,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 526 flow [2023-08-24 05:35:51,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:35:51,947 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 352 flow [2023-08-24 05:35:51,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-08-24 05:35:51,948 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2023-08-24 05:35:51,948 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 352 flow [2023-08-24 05:35:51,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 05:35:51,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:51,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:51,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:35:51,949 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:51,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash -483039456, now seen corresponding path program 1 times [2023-08-24 05:35:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:51,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097487534] [2023-08-24 05:35:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:52,765 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 05:35:52,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097487534] [2023-08-24 05:35:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097487534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:52,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:52,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:52,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305391338] [2023-08-24 05:35:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:52,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:52,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:52,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:52,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-08-24 05:35:52,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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 05:35:52,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:52,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-08-24 05:35:52,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:53,065 INFO L124 PetriNetUnfolderBase]: 1212/1865 cut-off events. [2023-08-24 05:35:53,066 INFO L125 PetriNetUnfolderBase]: For 4868/4868 co-relation queries the response was YES. [2023-08-24 05:35:53,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7419 conditions, 1865 events. 1212/1865 cut-off events. For 4868/4868 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8369 event pairs, 347 based on Foata normal form. 12/1877 useless extension candidates. Maximal degree in co-relation 7395. Up to 1470 conditions per place. [2023-08-24 05:35:53,078 INFO L140 encePairwiseOnDemand]: 189/199 looper letters, 54 selfloop transitions, 30 changer transitions 3/87 dead transitions. [2023-08-24 05:35:53,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 87 transitions, 806 flow [2023-08-24 05:35:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2023-08-24 05:35:53,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562814070351759 [2023-08-24 05:35:53,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 454 transitions. [2023-08-24 05:35:53,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 454 transitions. [2023-08-24 05:35:53,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:53,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 454 transitions. [2023-08-24 05:35:53,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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 05:35:53,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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 05:35:53,084 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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 05:35:53,084 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 352 flow. Second operand 5 states and 454 transitions. [2023-08-24 05:35:53,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 87 transitions, 806 flow [2023-08-24 05:35:53,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 780 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-24 05:35:53,093 INFO L231 Difference]: Finished difference. Result has 54 places, 60 transitions, 601 flow [2023-08-24 05:35:53,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=601, PETRI_PLACES=54, PETRI_TRANSITIONS=60} [2023-08-24 05:35:53,094 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-08-24 05:35:53,094 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 60 transitions, 601 flow [2023-08-24 05:35:53,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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 05:35:53,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:53,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:53,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:35:53,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:53,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash -798235997, now seen corresponding path program 1 times [2023-08-24 05:35:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:53,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766507769] [2023-08-24 05:35:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:53,525 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 05:35:53,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:53,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766507769] [2023-08-24 05:35:53,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766507769] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:53,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:53,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060261049] [2023-08-24 05:35:53,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:53,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:53,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:53,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-08-24 05:35:53,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 60 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states 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 05:35:53,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:53,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-08-24 05:35:53,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:53,823 INFO L124 PetriNetUnfolderBase]: 1140/1776 cut-off events. [2023-08-24 05:35:53,823 INFO L125 PetriNetUnfolderBase]: For 6570/6664 co-relation queries the response was YES. [2023-08-24 05:35:53,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8684 conditions, 1776 events. 1140/1776 cut-off events. For 6570/6664 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8157 event pairs, 473 based on Foata normal form. 78/1846 useless extension candidates. Maximal degree in co-relation 8655. Up to 1486 conditions per place. [2023-08-24 05:35:53,838 INFO L140 encePairwiseOnDemand]: 192/199 looper letters, 70 selfloop transitions, 20 changer transitions 1/95 dead transitions. [2023-08-24 05:35:53,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 1073 flow [2023-08-24 05:35:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2023-08-24 05:35:53,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864321608040201 [2023-08-24 05:35:53,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 484 transitions. [2023-08-24 05:35:53,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 484 transitions. [2023-08-24 05:35:53,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:53,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 484 transitions. [2023-08-24 05:35:53,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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 05:35:53,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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 05:35:53,843 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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 05:35:53,843 INFO L175 Difference]: Start difference. First operand has 54 places, 60 transitions, 601 flow. Second operand 5 states and 484 transitions. [2023-08-24 05:35:53,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 1073 flow [2023-08-24 05:35:53,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 1053 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-24 05:35:53,856 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 751 flow [2023-08-24 05:35:53,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2023-08-24 05:35:53,856 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2023-08-24 05:35:53,856 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 751 flow [2023-08-24 05:35:53,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states 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 05:35:53,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:53,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:53,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:35:53,857 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:53,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2090738387, now seen corresponding path program 1 times [2023-08-24 05:35:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:53,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468700301] [2023-08-24 05:35:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:54,481 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 05:35:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:54,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468700301] [2023-08-24 05:35:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468700301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:54,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:54,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:35:54,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401747081] [2023-08-24 05:35:54,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:54,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:35:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:54,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:35:54,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:35:54,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 199 [2023-08-24 05:35:54,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 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 05:35:54,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:54,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 199 [2023-08-24 05:35:54,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:54,844 INFO L124 PetriNetUnfolderBase]: 1212/1871 cut-off events. [2023-08-24 05:35:54,844 INFO L125 PetriNetUnfolderBase]: For 9692/9692 co-relation queries the response was YES. [2023-08-24 05:35:54,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9921 conditions, 1871 events. 1212/1871 cut-off events. For 9692/9692 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8472 event pairs, 363 based on Foata normal form. 10/1881 useless extension candidates. Maximal degree in co-relation 9888. Up to 1501 conditions per place. [2023-08-24 05:35:54,864 INFO L140 encePairwiseOnDemand]: 192/199 looper letters, 90 selfloop transitions, 26 changer transitions 9/125 dead transitions. [2023-08-24 05:35:54,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 125 transitions, 1579 flow [2023-08-24 05:35:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:35:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:35:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2023-08-24 05:35:54,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388609715242881 [2023-08-24 05:35:54,867 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 524 transitions. [2023-08-24 05:35:54,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 524 transitions. [2023-08-24 05:35:54,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:54,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 524 transitions. [2023-08-24 05:35:54,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 05:35:54,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states 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 05:35:54,870 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states 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 05:35:54,870 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 751 flow. Second operand 6 states and 524 transitions. [2023-08-24 05:35:54,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 125 transitions, 1579 flow [2023-08-24 05:35:54,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 125 transitions, 1559 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-24 05:35:54,887 INFO L231 Difference]: Finished difference. Result has 67 places, 79 transitions, 948 flow [2023-08-24 05:35:54,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=948, PETRI_PLACES=67, PETRI_TRANSITIONS=79} [2023-08-24 05:35:54,889 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2023-08-24 05:35:54,889 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 79 transitions, 948 flow [2023-08-24 05:35:54,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 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 05:35:54,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:54,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:54,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:35:54,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:54,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1027051347, now seen corresponding path program 1 times [2023-08-24 05:35:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:54,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896434306] [2023-08-24 05:35:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:55,319 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 05:35:55,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:55,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896434306] [2023-08-24 05:35:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896434306] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:55,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:55,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264402074] [2023-08-24 05:35:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:55,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:55,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 199 [2023-08-24 05:35:55,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 79 transitions, 948 flow. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 05:35:55,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:55,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 199 [2023-08-24 05:35:55,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:55,717 INFO L124 PetriNetUnfolderBase]: 1349/2139 cut-off events. [2023-08-24 05:35:55,718 INFO L125 PetriNetUnfolderBase]: For 12998/13071 co-relation queries the response was YES. [2023-08-24 05:35:55,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11643 conditions, 2139 events. 1349/2139 cut-off events. For 12998/13071 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10743 event pairs, 449 based on Foata normal form. 106/2202 useless extension candidates. Maximal degree in co-relation 11606. Up to 1387 conditions per place. [2023-08-24 05:35:55,737 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 62 selfloop transitions, 17 changer transitions 14/97 dead transitions. [2023-08-24 05:35:55,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 1336 flow [2023-08-24 05:35:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-08-24 05:35:55,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46984924623115576 [2023-08-24 05:35:55,739 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-08-24 05:35:55,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-08-24 05:35:55,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:55,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-08-24 05:35:55,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 05:35:55,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:55,742 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:55,742 INFO L175 Difference]: Start difference. First operand has 67 places, 79 transitions, 948 flow. Second operand 4 states and 374 transitions. [2023-08-24 05:35:55,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 1336 flow [2023-08-24 05:35:55,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 97 transitions, 1327 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 05:35:55,761 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 934 flow [2023-08-24 05:35:55,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=934, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-08-24 05:35:55,762 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2023-08-24 05:35:55,762 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 934 flow [2023-08-24 05:35:55,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 05:35:55,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:55,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:55,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:35:55,763 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:55,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:55,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1024396910, now seen corresponding path program 1 times [2023-08-24 05:35:55,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157118828] [2023-08-24 05:35:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:56,177 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 05:35:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157118828] [2023-08-24 05:35:56,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157118828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:56,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:56,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:56,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322785982] [2023-08-24 05:35:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:56,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:56,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:56,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:56,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:56,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 199 [2023-08-24 05:35:56,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 05:35:56,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:56,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 199 [2023-08-24 05:35:56,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:56,558 INFO L124 PetriNetUnfolderBase]: 1304/2083 cut-off events. [2023-08-24 05:35:56,558 INFO L125 PetriNetUnfolderBase]: For 15412/15530 co-relation queries the response was YES. [2023-08-24 05:35:56,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12314 conditions, 2083 events. 1304/2083 cut-off events. For 15412/15530 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10433 event pairs, 507 based on Foata normal form. 104/2173 useless extension candidates. Maximal degree in co-relation 12275. Up to 1747 conditions per place. [2023-08-24 05:35:56,573 INFO L140 encePairwiseOnDemand]: 192/199 looper letters, 78 selfloop transitions, 16 changer transitions 5/103 dead transitions. [2023-08-24 05:35:56,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 103 transitions, 1420 flow [2023-08-24 05:35:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-08-24 05:35:56,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47839195979899496 [2023-08-24 05:35:56,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-08-24 05:35:56,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-08-24 05:35:56,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:56,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-08-24 05:35:56,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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 05:35:56,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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 05:35:56,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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 05:35:56,580 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 934 flow. Second operand 5 states and 476 transitions. [2023-08-24 05:35:56,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 103 transitions, 1420 flow [2023-08-24 05:35:56,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 1362 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-24 05:35:56,601 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 1008 flow [2023-08-24 05:35:56,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1008, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2023-08-24 05:35:56,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2023-08-24 05:35:56,603 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 1008 flow [2023-08-24 05:35:56,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 05:35:56,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:56,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:56,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:35:56,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:56,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2054310239, now seen corresponding path program 1 times [2023-08-24 05:35:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:56,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376199351] [2023-08-24 05:35:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:56,735 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 05:35:56,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:56,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376199351] [2023-08-24 05:35:56,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376199351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:56,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:56,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:56,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567147857] [2023-08-24 05:35:56,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:56,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:56,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:56,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:56,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-08-24 05:35:56,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 1008 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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 05:35:56,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:56,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-08-24 05:35:56,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:57,020 INFO L124 PetriNetUnfolderBase]: 953/1658 cut-off events. [2023-08-24 05:35:57,021 INFO L125 PetriNetUnfolderBase]: For 15108/15270 co-relation queries the response was YES. [2023-08-24 05:35:57,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9777 conditions, 1658 events. 953/1658 cut-off events. For 15108/15270 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9286 event pairs, 109 based on Foata normal form. 350/2001 useless extension candidates. Maximal degree in co-relation 9739. Up to 777 conditions per place. [2023-08-24 05:35:57,031 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 107 selfloop transitions, 5 changer transitions 9/129 dead transitions. [2023-08-24 05:35:57,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 129 transitions, 1953 flow [2023-08-24 05:35:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2023-08-24 05:35:57,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48115577889447236 [2023-08-24 05:35:57,033 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 383 transitions. [2023-08-24 05:35:57,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 383 transitions. [2023-08-24 05:35:57,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:57,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 383 transitions. [2023-08-24 05:35:57,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 05:35:57,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:57,037 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:57,037 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 1008 flow. Second operand 4 states and 383 transitions. [2023-08-24 05:35:57,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 129 transitions, 1953 flow [2023-08-24 05:35:57,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 129 transitions, 1897 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-24 05:35:57,058 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 965 flow [2023-08-24 05:35:57,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=965, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2023-08-24 05:35:57,059 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2023-08-24 05:35:57,059 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 965 flow [2023-08-24 05:35:57,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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 05:35:57,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:57,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:57,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:35:57,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:57,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1400353198, now seen corresponding path program 1 times [2023-08-24 05:35:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:57,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47189374] [2023-08-24 05:35:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:57,220 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 05:35:57,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:57,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47189374] [2023-08-24 05:35:57,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47189374] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:57,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:57,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:35:57,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109981470] [2023-08-24 05:35:57,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:57,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:57,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:57,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:57,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-08-24 05:35:57,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 965 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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 05:35:57,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:57,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-08-24 05:35:57,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:57,421 INFO L124 PetriNetUnfolderBase]: 464/873 cut-off events. [2023-08-24 05:35:57,421 INFO L125 PetriNetUnfolderBase]: For 9268/9322 co-relation queries the response was YES. [2023-08-24 05:35:57,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 873 events. 464/873 cut-off events. For 9268/9322 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4508 event pairs, 30 based on Foata normal form. 166/1035 useless extension candidates. Maximal degree in co-relation 5437. Up to 373 conditions per place. [2023-08-24 05:35:57,427 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 102 selfloop transitions, 8 changer transitions 13/131 dead transitions. [2023-08-24 05:35:57,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 131 transitions, 1901 flow [2023-08-24 05:35:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-08-24 05:35:57,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4814070351758794 [2023-08-24 05:35:57,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-08-24 05:35:57,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-08-24 05:35:57,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:57,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-08-24 05:35:57,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states 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 05:35:57,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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 05:35:57,432 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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 05:35:57,432 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 965 flow. Second operand 5 states and 479 transitions. [2023-08-24 05:35:57,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 131 transitions, 1901 flow [2023-08-24 05:35:57,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 131 transitions, 1878 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 05:35:57,446 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 953 flow [2023-08-24 05:35:57,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=953, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2023-08-24 05:35:57,447 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2023-08-24 05:35:57,447 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 953 flow [2023-08-24 05:35:57,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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 05:35:57,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:57,448 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 05:35:57,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:35:57,448 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:57,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1154380677, now seen corresponding path program 1 times [2023-08-24 05:35:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793717107] [2023-08-24 05:35:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:57,651 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 05:35:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:57,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793717107] [2023-08-24 05:35:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793717107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:57,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:57,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:35:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323643586] [2023-08-24 05:35:57,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:57,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:35:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:35:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:35:57,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-08-24 05:35:57,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 953 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:35:57,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:57,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-08-24 05:35:57,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:57,807 INFO L124 PetriNetUnfolderBase]: 288/557 cut-off events. [2023-08-24 05:35:57,808 INFO L125 PetriNetUnfolderBase]: For 4841/4856 co-relation queries the response was YES. [2023-08-24 05:35:57,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 557 events. 288/557 cut-off events. For 4841/4856 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2588 event pairs, 30 based on Foata normal form. 42/595 useless extension candidates. Maximal degree in co-relation 3631. Up to 229 conditions per place. [2023-08-24 05:35:57,811 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 72 selfloop transitions, 11 changer transitions 25/115 dead transitions. [2023-08-24 05:35:57,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 115 transitions, 1665 flow [2023-08-24 05:35:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:35:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:35:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2023-08-24 05:35:57,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648241206030151 [2023-08-24 05:35:57,814 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 555 transitions. [2023-08-24 05:35:57,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 555 transitions. [2023-08-24 05:35:57,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:57,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 555 transitions. [2023-08-24 05:35:57,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.5) internal successors, (555), 6 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 05:35:57,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states 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 05:35:57,817 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states 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 05:35:57,817 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 953 flow. Second operand 6 states and 555 transitions. [2023-08-24 05:35:57,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 115 transitions, 1665 flow [2023-08-24 05:35:57,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 115 transitions, 1606 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-24 05:35:57,829 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 789 flow [2023-08-24 05:35:57,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2023-08-24 05:35:57,830 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2023-08-24 05:35:57,830 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 789 flow [2023-08-24 05:35:57,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:35:57,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:57,830 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] [2023-08-24 05:35:57,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:35:57,830 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:57,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1458274138, now seen corresponding path program 1 times [2023-08-24 05:35:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376275178] [2023-08-24 05:35:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:58,584 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 05:35:58,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:58,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376275178] [2023-08-24 05:35:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376275178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:58,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:58,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:35:58,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673274203] [2023-08-24 05:35:58,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:58,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:35:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:58,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:35:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:35:58,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-08-24 05:35:58,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 789 flow. Second operand has 8 states, 8 states have (on average 85.375) internal successors, (683), 8 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 05:35:58,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:58,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-08-24 05:35:58,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:58,713 INFO L124 PetriNetUnfolderBase]: 174/341 cut-off events. [2023-08-24 05:35:58,713 INFO L125 PetriNetUnfolderBase]: For 2252/2264 co-relation queries the response was YES. [2023-08-24 05:35:58,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 341 events. 174/341 cut-off events. For 2252/2264 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1302 event pairs, 58 based on Foata normal form. 11/347 useless extension candidates. Maximal degree in co-relation 2120. Up to 201 conditions per place. [2023-08-24 05:35:58,716 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 48 selfloop transitions, 15 changer transitions 11/77 dead transitions. [2023-08-24 05:35:58,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 1063 flow [2023-08-24 05:35:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-08-24 05:35:58,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547738693467337 [2023-08-24 05:35:58,718 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-08-24 05:35:58,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-08-24 05:35:58,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:58,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-08-24 05:35:58,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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 05:35:58,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:58,720 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 05:35:58,720 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 789 flow. Second operand 4 states and 362 transitions. [2023-08-24 05:35:58,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 1063 flow [2023-08-24 05:35:58,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 77 transitions, 878 flow, removed 31 selfloop flow, removed 13 redundant places. [2023-08-24 05:35:58,727 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 662 flow [2023-08-24 05:35:58,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=662, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-08-24 05:35:58,728 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2023-08-24 05:35:58,728 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 662 flow [2023-08-24 05:35:58,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.375) internal successors, (683), 8 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 05:35:58,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:58,729 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] [2023-08-24 05:35:58,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:35:58,729 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:58,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1151174576, now seen corresponding path program 2 times [2023-08-24 05:35:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395979641] [2023-08-24 05:35:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:35:58,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:35:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:35:58,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:35:58,811 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:35:58,812 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:35:58,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:35:58,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:35:58,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:35:58,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:35:58,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:35:58,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:35:58,814 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:58,819 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:35:58,819 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:35:58,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:35:58 BasicIcfg [2023-08-24 05:35:58,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:35:58,862 INFO L158 Benchmark]: Toolchain (without parser) took 17751.66ms. Allocated memory was 379.6MB in the beginning and 801.1MB in the end (delta: 421.5MB). Free memory was 354.0MB in the beginning and 317.8MB in the end (delta: 36.2MB). Peak memory consumption was 459.8MB. Max. memory is 16.0GB. [2023-08-24 05:35:58,862 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 379.6MB. Free memory was 357.0MB in the beginning and 356.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:35:58,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.54ms. Allocated memory is still 379.6MB. Free memory was 353.2MB in the beginning and 330.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:35:58,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.73ms. Allocated memory is still 379.6MB. Free memory was 330.3MB in the beginning and 327.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:35:58,863 INFO L158 Benchmark]: Boogie Preprocessor took 25.42ms. Allocated memory is still 379.6MB. Free memory was 327.8MB in the beginning and 326.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:35:58,863 INFO L158 Benchmark]: RCFGBuilder took 547.86ms. Allocated memory is still 379.6MB. Free memory was 325.7MB in the beginning and 289.2MB in the end (delta: 36.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-24 05:35:58,863 INFO L158 Benchmark]: TraceAbstraction took 16571.07ms. Allocated memory was 379.6MB in the beginning and 801.1MB in the end (delta: 421.5MB). Free memory was 288.4MB in the beginning and 317.8MB in the end (delta: -29.4MB). Peak memory consumption was 394.8MB. Max. memory is 16.0GB. [2023-08-24 05:35:58,864 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 379.6MB. Free memory was 357.0MB in the beginning and 356.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 549.54ms. Allocated memory is still 379.6MB. Free memory was 353.2MB in the beginning and 330.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.73ms. Allocated memory is still 379.6MB. Free memory was 330.3MB in the beginning and 327.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.42ms. Allocated memory is still 379.6MB. Free memory was 327.8MB in the beginning and 326.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 547.86ms. Allocated memory is still 379.6MB. Free memory was 325.7MB in the beginning and 289.2MB in the end (delta: 36.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 16571.07ms. Allocated memory was 379.6MB in the beginning and 801.1MB in the end (delta: 421.5MB). Free memory was 288.4MB in the beginning and 317.8MB in the end (delta: -29.4MB). Peak memory consumption was 394.8MB. 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.0s, 110 PlacesBefore, 32 PlacesAfterwards, 102 TransitionsBefore, 22 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4335 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2253, independent: 2109, independent conditional: 0, independent unconditional: 2109, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1004, independent: 964, independent conditional: 0, independent unconditional: 964, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2253, independent: 1145, independent conditional: 0, independent unconditional: 1145, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 1004, unknown conditional: 0, unknown unconditional: 1004] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 814]: 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: 816]: 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: 818]: 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 7 procedures, 131 locations, 6 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: 16.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 889 IncrementalHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 19 mSDtfsCounter, 889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1008occurred in iteration=10, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 05:35:58,897 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...