/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/mix044_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:30:16,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:30:16,243 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:30:16,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:30:16,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:30:16,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:30:16,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:30:16,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:30:16,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:30:16,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:30:16,295 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:30:16,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:30:16,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:30:16,296 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:30:16,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:30:16,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:30:16,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:30:16,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:30:16,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:30:16,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:30:16,298 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:30:16,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:30:16,299 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:30:16,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:30:16,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:30:16,300 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:30:16,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:30:16,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:30:16,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:30:16,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:30:16,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:30:16,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:30:16,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:30:16,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:30:16,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:30:16,303 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:30:16,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:30:16,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:30:16,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:30:16,691 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:30:16,692 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:30:16,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:30:17,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:30:18,250 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:30:18,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:30:18,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8206bbfc9/52ac321109e644c19ea79899219b3d7f/FLAG3a191fae7 [2023-08-24 05:30:18,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8206bbfc9/52ac321109e644c19ea79899219b3d7f [2023-08-24 05:30:18,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:30:18,279 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:30:18,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:30:18,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:30:18,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:30:18,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0b280c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18, skipping insertion in model container [2023-08-24 05:30:18,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:30:18,457 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/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 05:30:18,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:30:18,659 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:30:18,670 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/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 05:30:18,688 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:30:18,690 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:30:18,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:30:18,772 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:30:18,773 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:30:18,779 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:30:18,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18 WrapperNode [2023-08-24 05:30:18,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:30:18,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:30:18,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:30:18,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:30:18,789 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:30:18" (1/1) ... [2023-08-24 05:30:18,819 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:30:18" (1/1) ... [2023-08-24 05:30:18,860 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-24 05:30:18,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:30:18,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:30:18,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:30:18,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:30:18,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:30:18,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:30:18,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:30:18,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:30:18,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (1/1) ... [2023-08-24 05:30:18,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:30:18,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:30:18,951 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:30:18,965 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:30:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:30:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:30:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:30:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:30:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:30:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:30:18,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:30:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:30:18,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:30:18,992 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:30:18,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:30:18,992 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:30:18,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:30:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:30:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:30:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:30:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:30:18,995 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:30:19,168 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:30:19,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:30:19,568 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:30:19,688 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:30:19,689 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:30:19,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:30:19 BoogieIcfgContainer [2023-08-24 05:30:19,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:30:19,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:30:19,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:30:19,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:30:19,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:30:18" (1/3) ... [2023-08-24 05:30:19,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c8777a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:30:19, skipping insertion in model container [2023-08-24 05:30:19,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:18" (2/3) ... [2023-08-24 05:30:19,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c8777a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:30:19, skipping insertion in model container [2023-08-24 05:30:19,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:30:19" (3/3) ... [2023-08-24 05:30:19,702 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:30:19,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:30:19,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:30:19,717 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:30:19,769 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:30:19,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-24 05:30:19,842 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-08-24 05:30:19,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:19,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-24 05:30:19,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-24 05:30:19,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-24 05:30:19,857 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:30:19,865 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-24 05:30:19,868 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-24 05:30:19,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-24 05:30:19,897 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-08-24 05:30:19,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:19,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-24 05:30:19,900 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-08-24 05:30:23,819 INFO L134 LiptonReduction]: Checked pairs total: 8670 [2023-08-24 05:30:23,819 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-24 05:30:23,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:30:23,837 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;@5d0e1013, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:30:23,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:30:23,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:30:23,840 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:30:23,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:23,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:23,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:30:23,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:23,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:23,846 INFO L85 PathProgramCache]: Analyzing trace with hash 553466, now seen corresponding path program 1 times [2023-08-24 05:30:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:23,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928536046] [2023-08-24 05:30:23,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:23,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:24,184 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:30:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928536046] [2023-08-24 05:30:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928536046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:30:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286934169] [2023-08-24 05:30:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:24,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:30:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:30:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:30:24,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242 [2023-08-24 05:30:24,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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:30:24,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:24,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242 [2023-08-24 05:30:24,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:25,335 INFO L124 PetriNetUnfolderBase]: 5879/8107 cut-off events. [2023-08-24 05:30:25,336 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-24 05:30:25,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8107 events. 5879/8107 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40886 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16239. Up to 6367 conditions per place. [2023-08-24 05:30:25,394 INFO L140 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-24 05:30:25,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-08-24 05:30:25,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:30:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:30:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-24 05:30:25,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5482093663911846 [2023-08-24 05:30:25,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-24 05:30:25,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-24 05:30:25,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:25,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-24 05:30:25,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:25,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:30:25,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:30:25,430 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 398 transitions. [2023-08-24 05:30:25,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-08-24 05:30:25,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:30:25,438 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-24 05:30:25,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-24 05:30:25,445 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-24 05:30:25,445 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-24 05:30:25,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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:30:25,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:25,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:25,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:30:25,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:25,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash -301813989, now seen corresponding path program 1 times [2023-08-24 05:30:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716154717] [2023-08-24 05:30:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:25,705 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:30:25,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:25,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716154717] [2023-08-24 05:30:25,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716154717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:25,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:25,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:30:25,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065422822] [2023-08-24 05:30:25,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:25,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:30:25,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:25,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:30:25,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:30:25,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:30:25,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 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:30:25,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:25,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:30:25,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:27,690 INFO L124 PetriNetUnfolderBase]: 16407/22321 cut-off events. [2023-08-24 05:30:27,691 INFO L125 PetriNetUnfolderBase]: For 1028/1028 co-relation queries the response was YES. [2023-08-24 05:30:27,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46179 conditions, 22321 events. 16407/22321 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 117777 event pairs, 5637 based on Foata normal form. 634/22955 useless extension candidates. Maximal degree in co-relation 46169. Up to 13398 conditions per place. [2023-08-24 05:30:27,805 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-08-24 05:30:27,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-08-24 05:30:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:30:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:30:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-24 05:30:27,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055096418732782 [2023-08-24 05:30:27,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-24 05:30:27,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-24 05:30:27,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:27,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-24 05:30:27,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:27,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:30:27,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:30:27,812 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 367 transitions. [2023-08-24 05:30:27,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-08-24 05:30:27,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:27,815 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2023-08-24 05:30:27,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-24 05:30:27,821 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-24 05:30:27,821 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2023-08-24 05:30:27,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 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:30:27,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:27,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:27,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:30:27,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:27,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash -766301216, now seen corresponding path program 1 times [2023-08-24 05:30:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616778293] [2023-08-24 05:30:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:28,062 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:30:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616778293] [2023-08-24 05:30:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616778293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:28,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:28,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:28,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116647305] [2023-08-24 05:30:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:28,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:28,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:30:28,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:30:28,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:28,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:30:28,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:29,952 INFO L124 PetriNetUnfolderBase]: 16149/21975 cut-off events. [2023-08-24 05:30:29,952 INFO L125 PetriNetUnfolderBase]: For 8493/8493 co-relation queries the response was YES. [2023-08-24 05:30:29,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55465 conditions, 21975 events. 16149/21975 cut-off events. For 8493/8493 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 114720 event pairs, 1334 based on Foata normal form. 40/22015 useless extension candidates. Maximal degree in co-relation 55453. Up to 12464 conditions per place. [2023-08-24 05:30:30,065 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 56 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2023-08-24 05:30:30,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 360 flow [2023-08-24 05:30:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-08-24 05:30:30,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010330578512396 [2023-08-24 05:30:30,068 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-08-24 05:30:30,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-08-24 05:30:30,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:30,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-08-24 05:30:30,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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:30:30,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:30,072 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:30,072 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 485 transitions. [2023-08-24 05:30:30,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 360 flow [2023-08-24 05:30:30,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:30,113 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 198 flow [2023-08-24 05:30:30,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-08-24 05:30:30,114 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-24 05:30:30,117 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 198 flow [2023-08-24 05:30:30,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:30:30,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:30,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:30,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:30:30,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:30,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash -766301092, now seen corresponding path program 1 times [2023-08-24 05:30:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:30,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050102241] [2023-08-24 05:30:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050102241] [2023-08-24 05:30:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050102241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334281851] [2023-08-24 05:30:30,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:30,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:30,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:30,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:30,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:30:30,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:30:30,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:30,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:30:30,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:32,134 INFO L124 PetriNetUnfolderBase]: 15821/21537 cut-off events. [2023-08-24 05:30:32,135 INFO L125 PetriNetUnfolderBase]: For 17569/17569 co-relation queries the response was YES. [2023-08-24 05:30:32,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59029 conditions, 21537 events. 15821/21537 cut-off events. For 17569/17569 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 113299 event pairs, 3113 based on Foata normal form. 50/21587 useless extension candidates. Maximal degree in co-relation 59014. Up to 12454 conditions per place. [2023-08-24 05:30:32,224 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 67 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2023-08-24 05:30:32,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 85 transitions, 524 flow [2023-08-24 05:30:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-24 05:30:32,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5082644628099173 [2023-08-24 05:30:32,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-24 05:30:32,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-24 05:30:32,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:32,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-24 05:30:32,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:30:32,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:32,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:32,231 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 198 flow. Second operand 4 states and 492 transitions. [2023-08-24 05:30:32,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 85 transitions, 524 flow [2023-08-24 05:30:32,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:30:32,278 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 356 flow [2023-08-24 05:30:32,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-08-24 05:30:32,280 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-08-24 05:30:32,280 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 356 flow [2023-08-24 05:30:32,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:30:32,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:32,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:32,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:30:32,281 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:32,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2014464055, now seen corresponding path program 1 times [2023-08-24 05:30:32,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479847477] [2023-08-24 05:30:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:32,434 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:30:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479847477] [2023-08-24 05:30:32,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479847477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:32,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:32,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551881095] [2023-08-24 05:30:32,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:32,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:32,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:32,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:32,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:30:32,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:30:32,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:32,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:30:32,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:34,082 INFO L124 PetriNetUnfolderBase]: 14954/20366 cut-off events. [2023-08-24 05:30:34,082 INFO L125 PetriNetUnfolderBase]: For 41811/41811 co-relation queries the response was YES. [2023-08-24 05:30:34,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63084 conditions, 20366 events. 14954/20366 cut-off events. For 41811/41811 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 103517 event pairs, 3864 based on Foata normal form. 175/20541 useless extension candidates. Maximal degree in co-relation 63064. Up to 8569 conditions per place. [2023-08-24 05:30:34,189 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 74 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2023-08-24 05:30:34,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 87 transitions, 694 flow [2023-08-24 05:30:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-24 05:30:34,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49586776859504134 [2023-08-24 05:30:34,192 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-24 05:30:34,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-24 05:30:34,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:34,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-24 05:30:34,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:30:34,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:34,196 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:34,196 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 356 flow. Second operand 4 states and 480 transitions. [2023-08-24 05:30:34,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 87 transitions, 694 flow [2023-08-24 05:30:34,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 694 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:30:34,242 INFO L231 Difference]: Finished difference. Result has 57 places, 59 transitions, 506 flow [2023-08-24 05:30:34,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=506, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2023-08-24 05:30:34,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-08-24 05:30:34,243 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 506 flow [2023-08-24 05:30:34,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:30:34,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:34,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:34,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:30:34,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:34,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1612032770, now seen corresponding path program 1 times [2023-08-24 05:30:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:34,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542223014] [2023-08-24 05:30:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:34,398 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:30:34,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542223014] [2023-08-24 05:30:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542223014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:34,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:34,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711907837] [2023-08-24 05:30:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:34,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:34,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:34,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:34,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:30:34,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:30:34,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:34,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:30:34,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:36,093 INFO L124 PetriNetUnfolderBase]: 10119/14769 cut-off events. [2023-08-24 05:30:36,093 INFO L125 PetriNetUnfolderBase]: For 44562/46145 co-relation queries the response was YES. [2023-08-24 05:30:36,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45807 conditions, 14769 events. 10119/14769 cut-off events. For 44562/46145 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 90230 event pairs, 1589 based on Foata normal form. 1609/16133 useless extension candidates. Maximal degree in co-relation 45782. Up to 9004 conditions per place. [2023-08-24 05:30:36,231 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 124 selfloop transitions, 10 changer transitions 0/152 dead transitions. [2023-08-24 05:30:36,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 152 transitions, 1486 flow [2023-08-24 05:30:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:30:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:30:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2023-08-24 05:30:36,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049586776859504 [2023-08-24 05:30:36,234 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2023-08-24 05:30:36,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2023-08-24 05:30:36,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:36,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2023-08-24 05:30:36,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:36,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states 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:30:36,240 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states 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:30:36,240 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 506 flow. Second operand 5 states and 611 transitions. [2023-08-24 05:30:36,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 152 transitions, 1486 flow [2023-08-24 05:30:36,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 152 transitions, 1473 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:30:36,282 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 577 flow [2023-08-24 05:30:36,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2023-08-24 05:30:36,283 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2023-08-24 05:30:36,284 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 577 flow [2023-08-24 05:30:36,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:30:36,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:36,284 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:30:36,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:30:36,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:36,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:36,285 INFO L85 PathProgramCache]: Analyzing trace with hash 445096629, now seen corresponding path program 1 times [2023-08-24 05:30:36,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:36,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085675738] [2023-08-24 05:30:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:36,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:36,462 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:30:36,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:36,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085675738] [2023-08-24 05:30:36,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085675738] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:36,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:36,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:36,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200233941] [2023-08-24 05:30:36,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:36,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:30:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:36,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:30:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:30:36,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-24 05:30:36,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:30:36,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:36,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-24 05:30:36,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:38,467 INFO L124 PetriNetUnfolderBase]: 15172/22185 cut-off events. [2023-08-24 05:30:38,467 INFO L125 PetriNetUnfolderBase]: For 70053/70739 co-relation queries the response was YES. [2023-08-24 05:30:38,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84155 conditions, 22185 events. 15172/22185 cut-off events. For 70053/70739 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 141486 event pairs, 7189 based on Foata normal form. 529/22317 useless extension candidates. Maximal degree in co-relation 84126. Up to 11417 conditions per place. [2023-08-24 05:30:38,605 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 71 selfloop transitions, 9 changer transitions 11/101 dead transitions. [2023-08-24 05:30:38,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 937 flow [2023-08-24 05:30:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:30:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:30:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-24 05:30:38,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330578512396694 [2023-08-24 05:30:38,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-24 05:30:38,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-24 05:30:38,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:38,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-24 05:30:38,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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:30:38,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:30:38,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:30:38,610 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 577 flow. Second operand 3 states and 387 transitions. [2023-08-24 05:30:38,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 937 flow [2023-08-24 05:30:38,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 928 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:30:38,724 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 555 flow [2023-08-24 05:30:38,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-08-24 05:30:38,725 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-08-24 05:30:38,725 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 555 flow [2023-08-24 05:30:38,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:30:38,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:38,725 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:30:38,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:30:38,726 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:38,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:38,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1580943534, now seen corresponding path program 1 times [2023-08-24 05:30:38,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:38,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729298801] [2023-08-24 05:30:38,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:38,881 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:30:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729298801] [2023-08-24 05:30:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729298801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:38,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:38,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:38,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768057564] [2023-08-24 05:30:38,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:38,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:30:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:38,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:30:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:30:38,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:30:38,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 555 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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:30:38,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:38,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:30:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:40,192 INFO L124 PetriNetUnfolderBase]: 10065/15239 cut-off events. [2023-08-24 05:30:40,192 INFO L125 PetriNetUnfolderBase]: For 47026/48120 co-relation queries the response was YES. [2023-08-24 05:30:40,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56162 conditions, 15239 events. 10065/15239 cut-off events. For 47026/48120 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 100971 event pairs, 1093 based on Foata normal form. 1407/16336 useless extension candidates. Maximal degree in co-relation 56132. Up to 4996 conditions per place. [2023-08-24 05:30:40,288 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 163 selfloop transitions, 17 changer transitions 1/196 dead transitions. [2023-08-24 05:30:40,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 196 transitions, 2016 flow [2023-08-24 05:30:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-24 05:30:40,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053128689492326 [2023-08-24 05:30:40,291 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-24 05:30:40,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-24 05:30:40,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:40,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-24 05:30:40,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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:30:40,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states 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:30:40,297 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states 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:30:40,297 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 555 flow. Second operand 7 states and 856 transitions. [2023-08-24 05:30:40,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 196 transitions, 2016 flow [2023-08-24 05:30:40,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 196 transitions, 1903 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:40,413 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 649 flow [2023-08-24 05:30:40,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=649, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2023-08-24 05:30:40,414 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2023-08-24 05:30:40,414 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 649 flow [2023-08-24 05:30:40,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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:30:40,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:40,415 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:30:40,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:30:40,415 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:40,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1557230208, now seen corresponding path program 1 times [2023-08-24 05:30:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:40,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021134130] [2023-08-24 05:30:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:40,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:30:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021134130] [2023-08-24 05:30:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021134130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:40,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:30:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585959382] [2023-08-24 05:30:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:40,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:30:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:40,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:30:40,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:30:40,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:30:40,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:30:40,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:40,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:30:40,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:41,978 INFO L124 PetriNetUnfolderBase]: 9305/14079 cut-off events. [2023-08-24 05:30:41,978 INFO L125 PetriNetUnfolderBase]: For 44963/46022 co-relation queries the response was YES. [2023-08-24 05:30:42,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59140 conditions, 14079 events. 9305/14079 cut-off events. For 44963/46022 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 92817 event pairs, 916 based on Foata normal form. 742/14516 useless extension candidates. Maximal degree in co-relation 59107. Up to 4747 conditions per place. [2023-08-24 05:30:42,079 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 179 selfloop transitions, 26 changer transitions 15/235 dead transitions. [2023-08-24 05:30:42,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 235 transitions, 2349 flow [2023-08-24 05:30:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:30:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:30:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2023-08-24 05:30:42,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055096418732782 [2023-08-24 05:30:42,088 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2023-08-24 05:30:42,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2023-08-24 05:30:42,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:42,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2023-08-24 05:30:42,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states 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:30:42,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states 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:30:42,097 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states 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:30:42,097 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 649 flow. Second operand 9 states and 1101 transitions. [2023-08-24 05:30:42,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 235 transitions, 2349 flow [2023-08-24 05:30:43,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 235 transitions, 2301 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-24 05:30:43,401 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 775 flow [2023-08-24 05:30:43,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=775, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2023-08-24 05:30:43,402 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2023-08-24 05:30:43,402 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 775 flow [2023-08-24 05:30:43,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:30:43,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:43,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:43,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:30:43,403 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:43,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -630083128, now seen corresponding path program 1 times [2023-08-24 05:30:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997316027] [2023-08-24 05:30:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:44,253 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:30:44,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997316027] [2023-08-24 05:30:44,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997316027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:44,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:44,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:30:44,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156906450] [2023-08-24 05:30:44,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:44,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:30:44,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:44,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:30:44,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:30:44,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 242 [2023-08-24 05:30:44,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 775 flow. Second operand has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:30:44,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:44,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 242 [2023-08-24 05:30:44,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:46,898 INFO L124 PetriNetUnfolderBase]: 19387/28821 cut-off events. [2023-08-24 05:30:46,898 INFO L125 PetriNetUnfolderBase]: For 144877/144877 co-relation queries the response was YES. [2023-08-24 05:30:47,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129555 conditions, 28821 events. 19387/28821 cut-off events. For 144877/144877 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 194873 event pairs, 2284 based on Foata normal form. 11/28832 useless extension candidates. Maximal degree in co-relation 129519. Up to 8998 conditions per place. [2023-08-24 05:30:47,107 INFO L140 encePairwiseOnDemand]: 228/242 looper letters, 160 selfloop transitions, 79 changer transitions 85/324 dead transitions. [2023-08-24 05:30:47,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 324 transitions, 3566 flow [2023-08-24 05:30:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:30:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:30:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 931 transitions. [2023-08-24 05:30:47,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48088842975206614 [2023-08-24 05:30:47,110 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 931 transitions. [2023-08-24 05:30:47,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 931 transitions. [2023-08-24 05:30:47,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:47,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 931 transitions. [2023-08-24 05:30:47,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states 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:30:47,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states 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:30:47,116 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states 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:30:47,116 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 775 flow. Second operand 8 states and 931 transitions. [2023-08-24 05:30:47,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 324 transitions, 3566 flow [2023-08-24 05:30:50,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 324 transitions, 3057 flow, removed 188 selfloop flow, removed 4 redundant places. [2023-08-24 05:30:50,768 INFO L231 Difference]: Finished difference. Result has 87 places, 126 transitions, 1478 flow [2023-08-24 05:30:50,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1478, PETRI_PLACES=87, PETRI_TRANSITIONS=126} [2023-08-24 05:30:50,769 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-08-24 05:30:50,769 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 126 transitions, 1478 flow [2023-08-24 05:30:50,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:30:50,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:50,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:50,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:30:50,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:50,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1849969080, now seen corresponding path program 2 times [2023-08-24 05:30:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:50,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028013945] [2023-08-24 05:30:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:51,136 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:30:51,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028013945] [2023-08-24 05:30:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028013945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:51,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:51,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833293605] [2023-08-24 05:30:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:51,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:30:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:51,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:30:51,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:30:51,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-24 05:30:51,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 126 transitions, 1478 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states 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:30:51,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:51,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-24 05:30:51,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:52,417 INFO L124 PetriNetUnfolderBase]: 7113/11524 cut-off events. [2023-08-24 05:30:52,417 INFO L125 PetriNetUnfolderBase]: For 48909/49154 co-relation queries the response was YES. [2023-08-24 05:30:52,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51951 conditions, 11524 events. 7113/11524 cut-off events. For 48909/49154 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 77865 event pairs, 1686 based on Foata normal form. 161/11546 useless extension candidates. Maximal degree in co-relation 51910. Up to 6812 conditions per place. [2023-08-24 05:30:52,513 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 138 selfloop transitions, 20 changer transitions 63/250 dead transitions. [2023-08-24 05:30:52,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 250 transitions, 2809 flow [2023-08-24 05:30:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:30:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:30:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2023-08-24 05:30:52,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192837465564738 [2023-08-24 05:30:52,515 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2023-08-24 05:30:52,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2023-08-24 05:30:52,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:52,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2023-08-24 05:30:52,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states 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:30:52,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states 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:30:52,519 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states 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:30:52,519 INFO L175 Difference]: Start difference. First operand has 87 places, 126 transitions, 1478 flow. Second operand 6 states and 754 transitions. [2023-08-24 05:30:52,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 250 transitions, 2809 flow [2023-08-24 05:30:52,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 250 transitions, 2632 flow, removed 81 selfloop flow, removed 7 redundant places. [2023-08-24 05:30:53,000 INFO L231 Difference]: Finished difference. Result has 83 places, 135 transitions, 1519 flow [2023-08-24 05:30:53,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1519, PETRI_PLACES=83, PETRI_TRANSITIONS=135} [2023-08-24 05:30:53,001 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2023-08-24 05:30:53,001 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 135 transitions, 1519 flow [2023-08-24 05:30:53,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states 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:30:53,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:53,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:53,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:30:53,002 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:53,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1795073662, now seen corresponding path program 3 times [2023-08-24 05:30:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:53,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412425826] [2023-08-24 05:30:53,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:53,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412425826] [2023-08-24 05:30:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412425826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:30:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626756778] [2023-08-24 05:30:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:53,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:30:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:30:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:30:53,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:30:53,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 135 transitions, 1519 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:30:53,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:53,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:30:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:54,288 INFO L124 PetriNetUnfolderBase]: 5380/8572 cut-off events. [2023-08-24 05:30:54,288 INFO L125 PetriNetUnfolderBase]: For 39527/39979 co-relation queries the response was YES. [2023-08-24 05:30:54,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40591 conditions, 8572 events. 5380/8572 cut-off events. For 39527/39979 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 56027 event pairs, 543 based on Foata normal form. 329/8773 useless extension candidates. Maximal degree in co-relation 40557. Up to 3399 conditions per place. [2023-08-24 05:30:54,335 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 202 selfloop transitions, 18 changer transitions 81/326 dead transitions. [2023-08-24 05:30:54,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 326 transitions, 3975 flow [2023-08-24 05:30:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:30:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:30:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 952 transitions. [2023-08-24 05:30:54,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49173553719008267 [2023-08-24 05:30:54,338 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 952 transitions. [2023-08-24 05:30:54,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 952 transitions. [2023-08-24 05:30:54,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:54,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 952 transitions. [2023-08-24 05:30:54,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:54,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states 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:30:54,343 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states 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:30:54,343 INFO L175 Difference]: Start difference. First operand has 83 places, 135 transitions, 1519 flow. Second operand 8 states and 952 transitions. [2023-08-24 05:30:54,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 326 transitions, 3975 flow [2023-08-24 05:30:54,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 326 transitions, 3723 flow, removed 45 selfloop flow, removed 5 redundant places. [2023-08-24 05:30:54,694 INFO L231 Difference]: Finished difference. Result has 86 places, 117 transitions, 1265 flow [2023-08-24 05:30:54,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1265, PETRI_PLACES=86, PETRI_TRANSITIONS=117} [2023-08-24 05:30:54,695 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-08-24 05:30:54,695 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 117 transitions, 1265 flow [2023-08-24 05:30:54,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:30:54,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:54,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:54,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:30:54,696 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:54,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1407199791, now seen corresponding path program 1 times [2023-08-24 05:30:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:54,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112474141] [2023-08-24 05:30:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:54,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:54,884 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:30:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112474141] [2023-08-24 05:30:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112474141] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120217699] [2023-08-24 05:30:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:54,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:54,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-24 05:30:54,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 117 transitions, 1265 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:30:54,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:54,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-24 05:30:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:55,477 INFO L124 PetriNetUnfolderBase]: 3699/5775 cut-off events. [2023-08-24 05:30:55,477 INFO L125 PetriNetUnfolderBase]: For 28848/29053 co-relation queries the response was YES. [2023-08-24 05:30:55,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28677 conditions, 5775 events. 3699/5775 cut-off events. For 28848/29053 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 33024 event pairs, 407 based on Foata normal form. 101/5842 useless extension candidates. Maximal degree in co-relation 28638. Up to 2749 conditions per place. [2023-08-24 05:30:55,503 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 88 selfloop transitions, 1 changer transitions 131/229 dead transitions. [2023-08-24 05:30:55,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 229 transitions, 2702 flow [2023-08-24 05:30:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-24 05:30:55,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216942148760331 [2023-08-24 05:30:55,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-24 05:30:55,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-24 05:30:55,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:55,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-24 05:30:55,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:30:55,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:55,508 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:55,508 INFO L175 Difference]: Start difference. First operand has 86 places, 117 transitions, 1265 flow. Second operand 4 states and 505 transitions. [2023-08-24 05:30:55,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 229 transitions, 2702 flow [2023-08-24 05:30:55,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 229 transitions, 2515 flow, removed 41 selfloop flow, removed 9 redundant places. [2023-08-24 05:30:55,592 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 767 flow [2023-08-24 05:30:55,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=767, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2023-08-24 05:30:55,593 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-08-24 05:30:55,593 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 767 flow [2023-08-24 05:30:55,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:30:55,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:55,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:55,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:30:55,593 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:55,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:55,594 INFO L85 PathProgramCache]: Analyzing trace with hash -347911247, now seen corresponding path program 2 times [2023-08-24 05:30:55,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:55,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236509088] [2023-08-24 05:30:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:55,779 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:30:55,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236509088] [2023-08-24 05:30:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236509088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:55,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469587852] [2023-08-24 05:30:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:55,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:55,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:55,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:30:55,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 767 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:55,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:55,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:30:55,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:56,131 INFO L124 PetriNetUnfolderBase]: 1797/2903 cut-off events. [2023-08-24 05:30:56,131 INFO L125 PetriNetUnfolderBase]: For 9713/9713 co-relation queries the response was YES. [2023-08-24 05:30:56,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12844 conditions, 2903 events. 1797/2903 cut-off events. For 9713/9713 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14635 event pairs, 346 based on Foata normal form. 1/2904 useless extension candidates. Maximal degree in co-relation 12818. Up to 1411 conditions per place. [2023-08-24 05:30:56,148 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 73 selfloop transitions, 8 changer transitions 56/137 dead transitions. [2023-08-24 05:30:56,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 137 transitions, 1434 flow [2023-08-24 05:30:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-24 05:30:56,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49483471074380164 [2023-08-24 05:30:56,150 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-24 05:30:56,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-24 05:30:56,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:56,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-24 05:30:56,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 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:30:56,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:56,153 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:30:56,153 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 767 flow. Second operand 4 states and 479 transitions. [2023-08-24 05:30:56,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 137 transitions, 1434 flow [2023-08-24 05:30:56,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 137 transitions, 1387 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 05:30:56,186 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 423 flow [2023-08-24 05:30:56,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2023-08-24 05:30:56,187 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2023-08-24 05:30:56,187 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 423 flow [2023-08-24 05:30:56,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:56,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:56,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:56,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:30:56,188 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:56,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash -625219949, now seen corresponding path program 3 times [2023-08-24 05:30:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222045099] [2023-08-24 05:30:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:56,976 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:30:56,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:56,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222045099] [2023-08-24 05:30:56,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222045099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:56,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:56,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:30:56,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003082651] [2023-08-24 05:30:56,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:56,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:30:56,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:56,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:30:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:30:56,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:30:56,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 423 flow. Second operand has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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:30:56,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:56,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:30:56,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:57,324 INFO L124 PetriNetUnfolderBase]: 726/1208 cut-off events. [2023-08-24 05:30:57,324 INFO L125 PetriNetUnfolderBase]: For 2819/2837 co-relation queries the response was YES. [2023-08-24 05:30:57,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4988 conditions, 1208 events. 726/1208 cut-off events. For 2819/2837 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5049 event pairs, 126 based on Foata normal form. 7/1214 useless extension candidates. Maximal degree in co-relation 4967. Up to 769 conditions per place. [2023-08-24 05:30:57,331 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 59 selfloop transitions, 4 changer transitions 43/109 dead transitions. [2023-08-24 05:30:57,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 880 flow [2023-08-24 05:30:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 793 transitions. [2023-08-24 05:30:57,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46812278630460447 [2023-08-24 05:30:57,333 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 793 transitions. [2023-08-24 05:30:57,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 793 transitions. [2023-08-24 05:30:57,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:57,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 793 transitions. [2023-08-24 05:30:57,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states 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:30:57,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states 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:30:57,338 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states 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:30:57,338 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 423 flow. Second operand 7 states and 793 transitions. [2023-08-24 05:30:57,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 880 flow [2023-08-24 05:30:57,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 776 flow, removed 12 selfloop flow, removed 13 redundant places. [2023-08-24 05:30:57,349 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 269 flow [2023-08-24 05:30:57,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2023-08-24 05:30:57,350 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2023-08-24 05:30:57,350 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 269 flow [2023-08-24 05:30:57,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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:30:57,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:57,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:57,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:30:57,351 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:57,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash 133362795, now seen corresponding path program 4 times [2023-08-24 05:30:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:57,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147682146] [2023-08-24 05:30:57,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:57,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:30:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:57,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:30:57,523 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:30:57,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:30:57,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:30:57,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:30:57,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:30:57,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:30:57,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:30:57,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:30:57,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 05:30:57,528 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:57,534 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:30:57,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:30:57,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:30:57 BasicIcfg [2023-08-24 05:30:57,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:30:57,629 INFO L158 Benchmark]: Toolchain (without parser) took 39350.20ms. Allocated memory was 341.8MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 298.6MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-24 05:30:57,629 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 341.8MB. Free memory was 319.0MB in the beginning and 318.9MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:30:57,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.38ms. Allocated memory is still 341.8MB. Free memory was 298.6MB in the beginning and 274.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:57,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.53ms. Allocated memory is still 341.8MB. Free memory was 274.5MB in the beginning and 272.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:57,630 INFO L158 Benchmark]: Boogie Preprocessor took 55.14ms. Allocated memory is still 341.8MB. Free memory was 272.4MB in the beginning and 270.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:57,630 INFO L158 Benchmark]: RCFGBuilder took 774.46ms. Allocated memory is still 341.8MB. Free memory was 270.3MB in the beginning and 229.4MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-24 05:30:57,631 INFO L158 Benchmark]: TraceAbstraction took 37933.96ms. Allocated memory was 341.8MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 228.4MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-24 05:30:57,632 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.16ms. Allocated memory is still 341.8MB. Free memory was 319.0MB in the beginning and 318.9MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 501.38ms. Allocated memory is still 341.8MB. Free memory was 298.6MB in the beginning and 274.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.53ms. Allocated memory is still 341.8MB. Free memory was 274.5MB in the beginning and 272.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.14ms. Allocated memory is still 341.8MB. Free memory was 272.4MB in the beginning and 270.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 774.46ms. Allocated memory is still 341.8MB. Free memory was 270.3MB in the beginning and 229.4MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 37933.96ms. Allocated memory was 341.8MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 228.4MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 2.5GB. 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, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3437, independent: 3217, independent conditional: 0, independent unconditional: 3217, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1767, independent: 1720, independent conditional: 0, independent unconditional: 1720, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3437, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 1767, unknown conditional: 0, unknown unconditional: 1767] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1161; [L870] FCALL, FORK 0 pthread_create(&t1161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1161, ((void *)0), P0, ((void *)0))=-3, t1161={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1162; [L872] FCALL, FORK 0 pthread_create(&t1162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1162, ((void *)0), P1, ((void *)0))=-2, t1161={5:0}, t1162={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1163; [L874] FCALL, FORK 0 pthread_create(&t1163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1163, ((void *)0), P2, ((void *)0))=-1, t1161={5:0}, t1162={6:0}, t1163={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1164; [L876] FCALL, FORK 0 pthread_create(&t1164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1164, ((void *)0), P3, ((void *)0))=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1850 IncrementalHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 29 mSDtfsCounter, 1850 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1519occurred in iteration=11, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 1846 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:30:57,658 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...