/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 18:15:40,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 18:15:40,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 18:15:40,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 18:15:40,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 18:15:40,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 18:15:40,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 18:15:40,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 18:15:40,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 18:15:40,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 18:15:40,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 18:15:40,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 18:15:40,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 18:15:40,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 18:15:40,940 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 18:15:40,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 18:15:40,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 18:15:40,941 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 18:15:40,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 18:15:40,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 18:15:40,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 18:15:40,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 18:15:40,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 18:15:40,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 18:15:40,946 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 18:15:40,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 18:15:40,947 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 18:15:40,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 18:15:40,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 18:15:40,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 18:15:40,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:15:40,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 18:15:40,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 18:15:40,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 18:15:40,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 18:15:40,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 18:15:40,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 18:15:40,950 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 18:15:40,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 18:15:40,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 18:15:40,951 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 18:15:40,955 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 18:15:41,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 18:15:41,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 18:15:41,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 18:15:41,176 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 18:15:41,177 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 18:15:41,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i [2023-08-03 18:15:42,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 18:15:42,529 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 18:15:42,530 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i [2023-08-03 18:15:42,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf759f17a/dc0f181d20a24c19839fe6f6d9c93661/FLAG4182a862d [2023-08-03 18:15:42,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf759f17a/dc0f181d20a24c19839fe6f6d9c93661 [2023-08-03 18:15:42,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 18:15:42,568 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 18:15:42,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 18:15:42,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 18:15:42,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 18:15:42,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:15:42" (1/1) ... [2023-08-03 18:15:42,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2f202d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:42, skipping insertion in model container [2023-08-03 18:15:42,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:15:42" (1/1) ... [2023-08-03 18:15:42,620 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 18:15:42,753 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i[1009,1022] [2023-08-03 18:15:42,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:15:42,893 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 18:15:42,911 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i[1009,1022] [2023-08-03 18:15:42,918 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 18:15:42,920 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 18:15:42,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:15:43,008 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:15:43,008 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:15:43,014 INFO L206 MainTranslator]: Completed translation [2023-08-03 18:15:43,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43 WrapperNode [2023-08-03 18:15:43,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 18:15:43,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 18:15:43,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 18:15:43,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 18:15:43,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,077 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-08-03 18:15:43,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 18:15:43,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 18:15:43,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 18:15:43,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 18:15:43,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 18:15:43,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 18:15:43,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 18:15:43,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 18:15:43,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (1/1) ... [2023-08-03 18:15:43,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:15:43,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:15:43,163 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-03 18:15:43,173 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-03 18:15:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 18:15:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 18:15:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 18:15:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 18:15:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 18:15:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 18:15:43,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 18:15:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 18:15:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 18:15:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 18:15:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 18:15:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 18:15:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 18:15:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 18:15:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 18:15:43,199 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 18:15:43,306 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 18:15:43,307 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 18:15:43,586 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 18:15:43,695 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 18:15:43,695 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 18:15:43,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:15:43 BoogieIcfgContainer [2023-08-03 18:15:43,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 18:15:43,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 18:15:43,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 18:15:43,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 18:15:43,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 06:15:42" (1/3) ... [2023-08-03 18:15:43,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a59f3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:15:43, skipping insertion in model container [2023-08-03 18:15:43,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:15:43" (2/3) ... [2023-08-03 18:15:43,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a59f3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:15:43, skipping insertion in model container [2023-08-03 18:15:43,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:15:43" (3/3) ... [2023-08-03 18:15:43,704 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i [2023-08-03 18:15:43,710 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 18:15:43,718 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 18:15:43,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 18:15:43,719 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 18:15:43,761 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:15:43,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-03 18:15:43,885 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-03 18:15:43,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:15:43,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 449 events. 30/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1963 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 270. Up to 16 conditions per place. [2023-08-03 18:15:43,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 129 transitions, 273 flow [2023-08-03 18:15:43,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 129 transitions, 273 flow [2023-08-03 18:15:43,906 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:15:43,914 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 129 transitions, 273 flow [2023-08-03 18:15:43,916 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 129 transitions, 273 flow [2023-08-03 18:15:43,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-03 18:15:43,978 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-03 18:15:43,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:15:43,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 449 events. 30/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1963 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 270. Up to 16 conditions per place. [2023-08-03 18:15:43,984 INFO L119 LiptonReduction]: Number of co-enabled transitions 2530 [2023-08-03 18:15:47,348 INFO L134 LiptonReduction]: Checked pairs total: 6141 [2023-08-03 18:15:47,349 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-03 18:15:47,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:15:47,366 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17735395, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:15:47,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 18:15:47,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:15:47,370 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-08-03 18:15:47,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:15:47,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:47,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:15:47,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:15:47,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 526946865, now seen corresponding path program 1 times [2023-08-03 18:15:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:47,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924648683] [2023-08-03 18:15:47,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:47,617 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-03 18:15:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:15:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924648683] [2023-08-03 18:15:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924648683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:15:47,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:15:47,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:15:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698643884] [2023-08-03 18:15:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:15:47,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:15:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:15:47,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:15:47,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:15:47,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-03 18:15:47,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:47,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:15:47,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-03 18:15:47,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:15:48,192 INFO L124 PetriNetUnfolderBase]: 2161/3463 cut-off events. [2023-08-03 18:15:48,192 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 18:15:48,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6865 conditions, 3463 events. 2161/3463 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18888 event pairs, 1312 based on Foata normal form. 120/2983 useless extension candidates. Maximal degree in co-relation 6844. Up to 3294 conditions per place. [2023-08-03 18:15:48,216 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 30 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-03 18:15:48,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 153 flow [2023-08-03 18:15:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:15:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:15:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-03 18:15:48,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076708507670851 [2023-08-03 18:15:48,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-03 18:15:48,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-03 18:15:48,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:15:48,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-03 18:15:48,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:48,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:48,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:48,247 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 83 flow. Second operand 3 states and 364 transitions. [2023-08-03 18:15:48,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 153 flow [2023-08-03 18:15:48,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 153 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 18:15:48,251 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 89 flow [2023-08-03 18:15:48,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-03 18:15:48,255 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-03 18:15:48,256 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 89 flow [2023-08-03 18:15:48,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:48,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:48,256 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 18:15:48,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 18:15:48,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:15:48,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash -858672760, now seen corresponding path program 1 times [2023-08-03 18:15:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:48,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925170703] [2023-08-03 18:15:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:48,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:15:48,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:15:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:15:48,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:15:48,354 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:15:48,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 18:15:48,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 18:15:48,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 18:15:48,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 18:15:48,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 18:15:48,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 18:15:48,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 18:15:48,358 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 18:15:48,361 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 18:15:48,361 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 18:15:48,401 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:15:48,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 18:15:48,537 INFO L124 PetriNetUnfolderBase]: 93/1380 cut-off events. [2023-08-03 18:15:48,537 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 18:15:48,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 1380 events. 93/1380 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9496 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 1003. Up to 54 conditions per place. [2023-08-03 18:15:48,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 18:15:48,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 153 transitions, 342 flow [2023-08-03 18:15:48,549 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:15:48,549 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-03 18:15:48,549 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-03 18:15:48,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 18:15:48,668 INFO L124 PetriNetUnfolderBase]: 93/1380 cut-off events. [2023-08-03 18:15:48,669 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 18:15:48,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 1380 events. 93/1380 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9496 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 1003. Up to 54 conditions per place. [2023-08-03 18:15:48,700 INFO L119 LiptonReduction]: Number of co-enabled transitions 6064 [2023-08-03 18:15:52,088 INFO L134 LiptonReduction]: Checked pairs total: 18597 [2023-08-03 18:15:52,089 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-03 18:15:52,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:15:52,093 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17735395, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:15:52,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 18:15:52,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:15:52,099 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-08-03 18:15:52,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:15:52,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:52,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:15:52,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:15:52,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:52,101 INFO L85 PathProgramCache]: Analyzing trace with hash 807515136, now seen corresponding path program 1 times [2023-08-03 18:15:52,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:52,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305490] [2023-08-03 18:15:52,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:52,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:52,179 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-03 18:15:52,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:15:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305490] [2023-08-03 18:15:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:15:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:15:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:15:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190974790] [2023-08-03 18:15:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:15:52,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:15:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:15:52,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:15:52,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:15:52,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 270 [2023-08-03 18:15:52,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:52,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:15:52,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 270 [2023-08-03 18:15:52,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:16:41,385 INFO L124 PetriNetUnfolderBase]: 468866/614681 cut-off events. [2023-08-03 18:16:41,386 INFO L125 PetriNetUnfolderBase]: For 9572/9572 co-relation queries the response was YES. [2023-08-03 18:16:42,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214339 conditions, 614681 events. 468866/614681 cut-off events. For 9572/9572 co-relation queries the response was YES. Maximal size of possible extension queue 14894. Compared 4316369 event pairs, 380024 based on Foata normal form. 13020/544153 useless extension candidates. Maximal degree in co-relation 261809. Up to 587323 conditions per place. [2023-08-03 18:16:45,109 INFO L140 encePairwiseOnDemand]: 266/270 looper letters, 44 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-03 18:16:45,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 240 flow [2023-08-03 18:16:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:16:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:16:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-03 18:16:45,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5259259259259259 [2023-08-03 18:16:45,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-03 18:16:45,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-03 18:16:45,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:16:45,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-03 18:16:45,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:16:45,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:16:45,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:16:45,116 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 140 flow. Second operand 3 states and 426 transitions. [2023-08-03 18:16:45,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 240 flow [2023-08-03 18:16:45,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 56 transitions, 234 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 18:16:45,131 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 144 flow [2023-08-03 18:16:45,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-08-03 18:16:45,132 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2023-08-03 18:16:45,132 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 144 flow [2023-08-03 18:16:45,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:16:45,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:16:45,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:16:45,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 18:16:45,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:16:45,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:16:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 804947980, now seen corresponding path program 1 times [2023-08-03 18:16:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:16:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495292644] [2023-08-03 18:16:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:16:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:16:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:16:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:16:45,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:16:45,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495292644] [2023-08-03 18:16:45,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495292644] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:16:45,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317521194] [2023-08-03 18:16:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:16:45,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:16:45,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:16:45,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:16:45,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 18:16:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:16:45,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:16:45,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:16:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:16:45,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:16:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:16:45,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317521194] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:16:45,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:16:45,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-03 18:16:45,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032674010] [2023-08-03 18:16:45,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:16:45,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 18:16:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:16:45,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 18:16:45,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 18:16:45,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 270 [2023-08-03 18:16:45,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:16:45,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:16:45,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 270 [2023-08-03 18:16:45,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:17:24,532 INFO L124 PetriNetUnfolderBase]: 389314/506025 cut-off events. [2023-08-03 18:17:24,533 INFO L125 PetriNetUnfolderBase]: For 6296/6296 co-relation queries the response was YES. [2023-08-03 18:17:26,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998718 conditions, 506025 events. 389314/506025 cut-off events. For 6296/6296 co-relation queries the response was YES. Maximal size of possible extension queue 12793. Compared 3414167 event pairs, 247180 based on Foata normal form. 4/439213 useless extension candidates. Maximal degree in co-relation 261516. Up to 484009 conditions per place. [2023-08-03 18:17:28,698 INFO L140 encePairwiseOnDemand]: 266/270 looper letters, 49 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-03 18:17:28,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 272 flow [2023-08-03 18:17:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:17:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:17:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-03 18:17:28,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512962962962963 [2023-08-03 18:17:28,701 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-03 18:17:28,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-03 18:17:28,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:17:28,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-03 18:17:28,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:17:28,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:17:28,712 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:17:28,712 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 144 flow. Second operand 4 states and 554 transitions. [2023-08-03 18:17:28,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 272 flow [2023-08-03 18:17:28,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:17:28,714 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 162 flow [2023-08-03 18:17:28,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-08-03 18:17:28,715 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 18:17:28,716 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 162 flow [2023-08-03 18:17:28,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:17:28,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:17:28,716 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 18:17:28,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 18:17:28,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:17:28,921 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:17:28,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:17:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash 149246096, now seen corresponding path program 1 times [2023-08-03 18:17:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:17:28,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259718883] [2023-08-03 18:17:28,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:17:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:17:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:17:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:17:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:17:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259718883] [2023-08-03 18:17:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259718883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:17:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:17:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 18:17:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830839086] [2023-08-03 18:17:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:17:29,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:17:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:17:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:17:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:17:29,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 270 [2023-08-03 18:17:29,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:17:29,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:17:29,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 270 [2023-08-03 18:17:29,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:18:11,194 INFO L124 PetriNetUnfolderBase]: 389290/508205 cut-off events. [2023-08-03 18:18:11,194 INFO L125 PetriNetUnfolderBase]: For 6492/6492 co-relation queries the response was YES. [2023-08-03 18:18:12,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000190 conditions, 508205 events. 389290/508205 cut-off events. For 6492/6492 co-relation queries the response was YES. Maximal size of possible extension queue 12862. Compared 3456588 event pairs, 247168 based on Foata normal form. 16/439405 useless extension candidates. Maximal degree in co-relation 261869. Up to 484008 conditions per place. [2023-08-03 18:18:14,261 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 49 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-03 18:18:14,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 278 flow [2023-08-03 18:18:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:18:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:18:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-03 18:18:14,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2023-08-03 18:18:14,263 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-03 18:18:14,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-03 18:18:14,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:18:14,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-03 18:18:14,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:14,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:14,268 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:14,268 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 162 flow. Second operand 5 states and 678 transitions. [2023-08-03 18:18:14,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 278 flow [2023-08-03 18:18:14,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 61 transitions, 271 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 18:18:14,271 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 151 flow [2023-08-03 18:18:14,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-03 18:18:14,271 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 18:18:14,271 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 151 flow [2023-08-03 18:18:14,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:14,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:18:14,272 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:18:14,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 18:18:14,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:18:14,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:18:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1691922777, now seen corresponding path program 1 times [2023-08-03 18:18:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:18:14,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914403963] [2023-08-03 18:18:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:18:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:18:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:18:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 18:18:14,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:18:14,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914403963] [2023-08-03 18:18:14,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914403963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:18:14,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:18:14,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 18:18:14,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347145669] [2023-08-03 18:18:14,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:18:14,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:18:14,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:18:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:18:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:18:14,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 270 [2023-08-03 18:18:14,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:14,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:18:14,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 270 [2023-08-03 18:18:14,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:18:47,952 INFO L124 PetriNetUnfolderBase]: 335018/438301 cut-off events. [2023-08-03 18:18:47,952 INFO L125 PetriNetUnfolderBase]: For 5794/5794 co-relation queries the response was YES. [2023-08-03 18:18:49,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862401 conditions, 438301 events. 335018/438301 cut-off events. For 5794/5794 co-relation queries the response was YES. Maximal size of possible extension queue 11280. Compared 3006204 event pairs, 55610 based on Foata normal form. 0/388557 useless extension candidates. Maximal degree in co-relation 225893. Up to 383649 conditions per place. [2023-08-03 18:18:50,379 INFO L140 encePairwiseOnDemand]: 265/270 looper letters, 67 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-03 18:18:50,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 360 flow [2023-08-03 18:18:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:18:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:18:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-03 18:18:50,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5654320987654321 [2023-08-03 18:18:50,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-03 18:18:50,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-03 18:18:50,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:18:50,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-03 18:18:50,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:50,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:50,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:50,385 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 151 flow. Second operand 3 states and 458 transitions. [2023-08-03 18:18:50,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 360 flow [2023-08-03 18:18:50,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 79 transitions, 355 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 18:18:50,387 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 167 flow [2023-08-03 18:18:50,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-08-03 18:18:50,388 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 18:18:50,388 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 167 flow [2023-08-03 18:18:50,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:50,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:18:50,389 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:18:50,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 18:18:50,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:18:50,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:18:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1842477060, now seen corresponding path program 1 times [2023-08-03 18:18:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:18:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334072834] [2023-08-03 18:18:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:18:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:18:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:18:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 18:18:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:18:50,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334072834] [2023-08-03 18:18:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334072834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:18:50,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:18:50,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 18:18:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648218868] [2023-08-03 18:18:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:18:50,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:18:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:18:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:18:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:18:50,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 270 [2023-08-03 18:18:50,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:18:50,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:18:50,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 270 [2023-08-03 18:18:50,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:19:25,299 INFO L124 PetriNetUnfolderBase]: 326858/427181 cut-off events. [2023-08-03 18:19:25,300 INFO L125 PetriNetUnfolderBase]: For 32390/32390 co-relation queries the response was YES. [2023-08-03 18:19:26,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896046 conditions, 427181 events. 326858/427181 cut-off events. For 32390/32390 co-relation queries the response was YES. Maximal size of possible extension queue 11478. Compared 2898102 event pairs, 274810 based on Foata normal form. 0/380637 useless extension candidates. Maximal degree in co-relation 233929. Up to 406153 conditions per place. [2023-08-03 18:19:27,897 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 53 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-03 18:19:27,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 302 flow [2023-08-03 18:19:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:19:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:19:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-03 18:19:27,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5320987654320988 [2023-08-03 18:19:27,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-03 18:19:27,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-03 18:19:27,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:19:27,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-03 18:19:27,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:19:27,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:19:27,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:19:27,902 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 167 flow. Second operand 3 states and 431 transitions. [2023-08-03 18:19:27,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 302 flow [2023-08-03 18:19:27,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:19:27,906 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 176 flow [2023-08-03 18:19:27,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-08-03 18:19:27,907 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2023-08-03 18:19:27,907 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 176 flow [2023-08-03 18:19:27,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:19:27,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:19:27,907 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:19:27,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 18:19:27,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:19:27,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:19:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1731928109, now seen corresponding path program 1 times [2023-08-03 18:19:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:19:27,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781167672] [2023-08-03 18:19:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:19:27,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:19:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:19:27,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:19:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:19:27,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:19:27,958 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:19:27,958 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 18:19:27,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 18:19:27,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 18:19:27,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 18:19:27,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 18:19:27,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 18:19:27,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 18:19:27,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 18:19:27,960 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 18:19:27,964 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 18:19:27,964 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 18:19:28,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 06:19:28 BasicIcfg [2023-08-03 18:19:28,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 18:19:28,038 INFO L158 Benchmark]: Toolchain (without parser) took 225469.62ms. Allocated memory was 587.2MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 539.0MB in the beginning and 9.7GB in the end (delta: -9.2GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-08-03 18:19:28,038 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 369.1MB. Free memory was 322.1MB in the beginning and 322.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 18:19:28,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.16ms. Allocated memory is still 587.2MB. Free memory was 538.7MB in the beginning and 515.6MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 18:19:28,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.79ms. Allocated memory is still 587.2MB. Free memory was 515.3MB in the beginning and 513.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:19:28,039 INFO L158 Benchmark]: Boogie Preprocessor took 48.02ms. Allocated memory is still 587.2MB. Free memory was 513.1MB in the beginning and 511.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:19:28,039 INFO L158 Benchmark]: RCFGBuilder took 570.32ms. Allocated memory is still 587.2MB. Free memory was 511.0MB in the beginning and 536.4MB in the end (delta: -25.4MB). Peak memory consumption was 22.8MB. Max. memory is 16.0GB. [2023-08-03 18:19:28,040 INFO L158 Benchmark]: TraceAbstraction took 224338.34ms. Allocated memory was 587.2MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 535.4MB in the beginning and 9.7GB in the end (delta: -9.2GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-08-03 18:19:28,046 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.11ms. Allocated memory is still 369.1MB. Free memory was 322.1MB in the beginning and 322.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 448.16ms. Allocated memory is still 587.2MB. Free memory was 538.7MB in the beginning and 515.6MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.79ms. Allocated memory is still 587.2MB. Free memory was 515.3MB in the beginning and 513.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.02ms. Allocated memory is still 587.2MB. Free memory was 513.1MB in the beginning and 511.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 570.32ms. Allocated memory is still 587.2MB. Free memory was 511.0MB in the beginning and 536.4MB in the end (delta: -25.4MB). Peak memory consumption was 22.8MB. Max. memory is 16.0GB. * TraceAbstraction took 224338.34ms. Allocated memory was 587.2MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 535.4MB in the beginning and 9.7GB in the end (delta: -9.2GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 131 PlacesBefore, 40 PlacesAfterwards, 129 TransitionsBefore, 34 TransitionsAfterwards, 2530 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 110 TotalNumberOfCompositions, 6141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2840, independent: 2685, independent conditional: 0, independent unconditional: 2685, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1283, independent: 1259, independent conditional: 0, independent unconditional: 1259, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2840, independent: 1426, independent conditional: 0, independent unconditional: 1426, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 1283, unknown conditional: 0, unknown unconditional: 1283] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 161 PlacesBefore, 64 PlacesAfterwards, 153 TransitionsBefore, 52 TransitionsAfterwards, 6064 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 117 TotalNumberOfCompositions, 18597 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9084, independent: 8777, independent conditional: 0, independent unconditional: 8777, dependent: 307, dependent conditional: 0, dependent unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3059, independent: 3011, independent conditional: 0, independent unconditional: 3011, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9084, independent: 5766, independent conditional: 0, independent unconditional: 5766, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 3059, unknown conditional: 0, unknown unconditional: 3059] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 391, Positive conditional cache size: 0, Positive unconditional cache size: 391, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055[2]; [L832] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t2055[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055[asdf], ((void *)0), P0, ((void *)0))=-1, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t2055[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055[asdf], ((void *)0), P0, ((void *)0))=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] COND FALSE 0 !(asdf<2) [L833] 0 pthread_t t2056[2]; [L834] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t2056[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056[asdf], ((void *)0), P1, ((void *)0))=1, t2055={5:0}, t2056={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 3 x$w_buff1 = x$w_buff0 [L775] 3 x$w_buff0 = 1 [L776] 3 x$w_buff1_used = x$w_buff0_used [L777] 3 x$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t2056[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056[asdf], ((void *)0), P1, ((void *)0))=2, t2055={5:0}, t2056={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 4 x$w_buff1 = x$w_buff0 [L775] 4 x$w_buff0 = 1 [L776] 4 x$w_buff1_used = x$w_buff0_used [L777] 4 x$w_buff0_used = (_Bool)1 [L778] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 19]: 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: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 173 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: 219.6s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 214.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 16 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 20/23 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-03 18:19:28,065 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...