/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_mix011_tso.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:04:56,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:04:56,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:04:56,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:04:56,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:04:56,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:04:56,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:04:56,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:04:56,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:04:56,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:04:56,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:04:56,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:04:56,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:04:56,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:04:56,843 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:04:56,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:04:56,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:04:56,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:04:56,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:04:56,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:04:56,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:04:56,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:04:56,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:04:56,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:04:56,846 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:04:56,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:04:56,846 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:04:56,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:04:56,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:04:56,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:04:56,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:04:56,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:04:56,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:04:56,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:04:56,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:04:56,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:04:56,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:04:56,849 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:04:56,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:04:56,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:04:56,850 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:04:56,850 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 17:04:57,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:04:57,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:04:57,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:04:57,109 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:04:57,109 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:04:57,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix011_tso.oepc_bound2.i [2023-08-03 17:04:58,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:04:58,636 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:04:58,636 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix011_tso.oepc_bound2.i [2023-08-03 17:04:58,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bb274d3/3fb87bcf927746a39eea10c213d72adf/FLAG6702aa036 [2023-08-03 17:04:58,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bb274d3/3fb87bcf927746a39eea10c213d72adf [2023-08-03 17:04:58,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:04:58,670 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:04:58,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:04:58,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:04:58,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:04:58,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:04:58" (1/1) ... [2023-08-03 17:04:58,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e63982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:58, skipping insertion in model container [2023-08-03 17:04:58,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:04:58" (1/1) ... [2023-08-03 17:04:58,725 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:04:58,847 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_mix011_tso.oepc_bound2.i[949,962] [2023-08-03 17:04:59,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:04:59,066 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:04:59,075 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_mix011_tso.oepc_bound2.i[949,962] [2023-08-03 17:04:59,082 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:04:59,083 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:04:59,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:04:59,151 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:04:59,151 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:04:59,157 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:04:59,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59 WrapperNode [2023-08-03 17:04:59,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:04:59,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:04:59,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:04:59,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:04:59,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,228 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2023-08-03 17:04:59,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:04:59,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:04:59,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:04:59,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:04:59,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:04:59,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:04:59,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:04:59,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:04:59,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (1/1) ... [2023-08-03 17:04:59,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:04:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:04:59,306 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 17:04:59,308 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 17:04:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:04:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:04:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:04:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:04:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:04:59,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:04:59,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:04:59,335 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:04:59,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:04:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:04:59,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:04:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:04:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:04:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:04:59,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:04:59,337 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 17:04:59,463 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:04:59,465 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:04:59,797 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:04:59,926 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:04:59,926 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:04:59,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:04:59 BoogieIcfgContainer [2023-08-03 17:04:59,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:04:59,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:04:59,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:04:59,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:04:59,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:04:58" (1/3) ... [2023-08-03 17:04:59,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c25451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:04:59, skipping insertion in model container [2023-08-03 17:04:59,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:59" (2/3) ... [2023-08-03 17:04:59,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c25451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:04:59, skipping insertion in model container [2023-08-03 17:04:59,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:04:59" (3/3) ... [2023-08-03 17:04:59,939 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix011_tso.oepc_bound2.i [2023-08-03 17:04:59,946 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:04:59,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:04:59,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:04:59,955 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:05:00,014 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:05:00,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 285 flow [2023-08-03 17:05:00,183 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-03 17:05:00,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:05:00,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2057 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 277. Up to 16 conditions per place. [2023-08-03 17:05:00,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 135 transitions, 285 flow [2023-08-03 17:05:00,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 135 transitions, 285 flow [2023-08-03 17:05:00,198 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:05:00,207 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 135 transitions, 285 flow [2023-08-03 17:05:00,209 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 135 transitions, 285 flow [2023-08-03 17:05:00,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 285 flow [2023-08-03 17:05:00,270 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-03 17:05:00,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:05:00,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2057 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 277. Up to 16 conditions per place. [2023-08-03 17:05:00,277 INFO L119 LiptonReduction]: Number of co-enabled transitions 3082 [2023-08-03 17:05:04,139 INFO L134 LiptonReduction]: Checked pairs total: 8836 [2023-08-03 17:05:04,140 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-03 17:05:04,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:05:04,158 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;@1740e4cb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:05:04,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:05:04,161 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:05:04,162 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 17:05:04,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:05:04,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:05:04,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:05:04,163 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 17:05:04,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:05:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash 554530156, now seen corresponding path program 1 times [2023-08-03 17:05:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:05:04,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035868644] [2023-08-03 17:05:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:05:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:05:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:05:04,414 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 17:05:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:05:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035868644] [2023-08-03 17:05:04,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035868644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:05:04,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:05:04,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:05:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387264180] [2023-08-03 17:05:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:05:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:05:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:05:04,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:05:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:05:04,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 249 [2023-08-03 17:05:04,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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 17:05:04,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:05:04,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 249 [2023-08-03 17:05:04,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:05:04,891 INFO L124 PetriNetUnfolderBase]: 2161/3426 cut-off events. [2023-08-03 17:05:04,891 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 17:05:04,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6866 conditions, 3426 events. 2161/3426 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20080 event pairs, 1876 based on Foata normal form. 120/2870 useless extension candidates. Maximal degree in co-relation 6849. Up to 3294 conditions per place. [2023-08-03 17:05:04,915 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 30 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-03 17:05:04,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 159 flow [2023-08-03 17:05:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:05:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:05:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-03 17:05:04,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073627844712182 [2023-08-03 17:05:04,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-03 17:05:04,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-03 17:05:04,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:05:04,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-03 17:05:04,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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 17:05:04,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states 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 17:05:04,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states 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 17:05:04,942 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 89 flow. Second operand 3 states and 379 transitions. [2023-08-03 17:05:04,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 159 flow [2023-08-03 17:05:04,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 159 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:05:04,946 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 95 flow [2023-08-03 17:05:04,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-03 17:05:04,951 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-08-03 17:05:04,951 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 95 flow [2023-08-03 17:05:04,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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 17:05:04,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:05:04,969 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:05:04,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:05:04,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:05:04,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:05:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 22283407, now seen corresponding path program 1 times [2023-08-03 17:05:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:05:04,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864584697] [2023-08-03 17:05:04,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:05:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:05:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:05:04,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:05:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:05:05,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:05:05,027 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:05:05,028 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:05:05,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:05:05,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:05:05,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:05:05,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:05:05,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:05:05,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:05:05,031 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:05:05,033 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:05:05,033 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:05:05,057 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:05:05,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 362 flow [2023-08-03 17:05:05,207 INFO L124 PetriNetUnfolderBase]: 93/1414 cut-off events. [2023-08-03 17:05:05,207 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:05:05,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 1414 events. 93/1414 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9883 event pairs, 0 based on Foata normal form. 0/1249 useless extension candidates. Maximal degree in co-relation 1028. Up to 54 conditions per place. [2023-08-03 17:05:05,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 163 transitions, 362 flow [2023-08-03 17:05:05,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 163 transitions, 362 flow [2023-08-03 17:05:05,220 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:05:05,221 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 163 transitions, 362 flow [2023-08-03 17:05:05,221 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 163 transitions, 362 flow [2023-08-03 17:05:05,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 362 flow [2023-08-03 17:05:05,367 INFO L124 PetriNetUnfolderBase]: 93/1414 cut-off events. [2023-08-03 17:05:05,367 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:05:05,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 1414 events. 93/1414 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9883 event pairs, 0 based on Foata normal form. 0/1249 useless extension candidates. Maximal degree in co-relation 1028. Up to 54 conditions per place. [2023-08-03 17:05:05,403 INFO L119 LiptonReduction]: Number of co-enabled transitions 7560 [2023-08-03 17:05:09,093 INFO L134 LiptonReduction]: Checked pairs total: 28292 [2023-08-03 17:05:09,093 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-03 17:05:09,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:05:09,096 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;@1740e4cb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:05:09,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:05:09,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:05:09,099 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 17:05:09,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:05:09,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:05:09,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:05:09,099 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 17:05:09,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:05:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash 849536080, now seen corresponding path program 1 times [2023-08-03 17:05:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:05:09,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565760752] [2023-08-03 17:05:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:05:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:05:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:05:09,154 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 17:05:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:05:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565760752] [2023-08-03 17:05:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565760752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:05:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:05:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:05:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574659402] [2023-08-03 17:05:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:05:09,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:05:09,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:05:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:05:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:05:09,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 281 [2023-08-03 17:05:09,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 17:05:09,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:05:09,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 281 [2023-08-03 17:05:09,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:06:03,603 INFO L124 PetriNetUnfolderBase]: 468866/629706 cut-off events. [2023-08-03 17:06:03,604 INFO L125 PetriNetUnfolderBase]: For 9288/9288 co-relation queries the response was YES. [2023-08-03 17:06:04,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228764 conditions, 629706 events. 468866/629706 cut-off events. For 9288/9288 co-relation queries the response was YES. Maximal size of possible extension queue 19732. Compared 4966065 event pairs, 380024 based on Foata normal form. 13020/547578 useless extension candidates. Maximal degree in co-relation 264683. Up to 587323 conditions per place. [2023-08-03 17:06:07,450 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-03 17:06:07,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 64 transitions, 256 flow [2023-08-03 17:06:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:06:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:06:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-03 17:06:07,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5373665480427047 [2023-08-03 17:06:07,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-03 17:06:07,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-03 17:06:07,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:06:07,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-03 17:06:07,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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 17:06:07,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 17:06:07,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 17:06:07,459 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 156 flow. Second operand 3 states and 453 transitions. [2023-08-03 17:06:07,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 64 transitions, 256 flow [2023-08-03 17:06:07,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 64 transitions, 250 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:06:07,479 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 160 flow [2023-08-03 17:06:07,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2023-08-03 17:06:07,480 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2023-08-03 17:06:07,480 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 160 flow [2023-08-03 17:06:07,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 17:06:07,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:06:07,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:06:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:06:07,481 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 17:06:07,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:06:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash -961847238, now seen corresponding path program 1 times [2023-08-03 17:06:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:06:07,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069167390] [2023-08-03 17:06:07,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:06:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:06:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:06:07,577 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 17:06:07,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:06:07,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069167390] [2023-08-03 17:06:07,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069167390] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:06:07,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987947370] [2023-08-03 17:06:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:06:07,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:06:07,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:06:07,585 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 17:06:07,588 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 17:06:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:06:07,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:06:07,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:06:07,740 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 17:06:07,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:06:07,758 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 17:06:07,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987947370] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:06:07,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:06:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:06:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277326291] [2023-08-03 17:06:07,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:06:07,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:06:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:06:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:06:07,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:06:07,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 281 [2023-08-03 17:06:07,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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 17:06:07,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:06:07,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 281 [2023-08-03 17:06:07,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:06:55,192 INFO L124 PetriNetUnfolderBase]: 389314/518530 cut-off events. [2023-08-03 17:06:55,193 INFO L125 PetriNetUnfolderBase]: For 6296/6296 co-relation queries the response was YES. [2023-08-03 17:06:56,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010983 conditions, 518530 events. 389314/518530 cut-off events. For 6296/6296 co-relation queries the response was YES. Maximal size of possible extension queue 16563. Compared 3930220 event pairs, 247180 based on Foata normal form. 4/442326 useless extension candidates. Maximal degree in co-relation 264583. Up to 484009 conditions per place. [2023-08-03 17:06:59,007 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 49 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-03 17:06:59,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 288 flow [2023-08-03 17:06:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:06:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:06:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2023-08-03 17:06:59,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5249110320284698 [2023-08-03 17:06:59,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2023-08-03 17:06:59,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2023-08-03 17:06:59,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:06:59,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2023-08-03 17:06:59,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states 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 17:06:59,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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 17:06:59,015 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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 17:06:59,015 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 160 flow. Second operand 4 states and 590 transitions. [2023-08-03 17:06:59,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 288 flow [2023-08-03 17:06:59,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:06:59,018 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 178 flow [2023-08-03 17:06:59,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2023-08-03 17:06:59,018 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2023-08-03 17:06:59,019 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 178 flow [2023-08-03 17:06:59,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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 17:06:59,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:06:59,019 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:06:59,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:06:59,224 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 17:06:59,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:06:59,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:06:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash -656462459, now seen corresponding path program 1 times [2023-08-03 17:06:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:06:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771761039] [2023-08-03 17:06:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:06:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:06:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:06:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:06:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:06:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771761039] [2023-08-03 17:06:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771761039] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:06:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841782584] [2023-08-03 17:06:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:06:59,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:06:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:06:59,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:06:59,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 17:06:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:06:59,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:06:59,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:06:59,377 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 17:06:59,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:06:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841782584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:06:59,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:06:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:06:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834183008] [2023-08-03 17:06:59,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:06:59,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:06:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:06:59,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:06:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:06:59,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 281 [2023-08-03 17:06:59,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 178 flow. Second operand has 5 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 17:06:59,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:06:59,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 281 [2023-08-03 17:06:59,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:07:41,893 INFO L124 PetriNetUnfolderBase]: 389290/518482 cut-off events. [2023-08-03 17:07:41,893 INFO L125 PetriNetUnfolderBase]: For 6396/6396 co-relation queries the response was YES. [2023-08-03 17:07:43,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010947 conditions, 518482 events. 389290/518482 cut-off events. For 6396/6396 co-relation queries the response was YES. Maximal size of possible extension queue 16563. Compared 3930585 event pairs, 247168 based on Foata normal form. 16/442290 useless extension candidates. Maximal degree in co-relation 264559. Up to 484008 conditions per place. [2023-08-03 17:07:45,624 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 49 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2023-08-03 17:07:45,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 69 transitions, 294 flow [2023-08-03 17:07:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:07:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:07:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2023-08-03 17:07:45,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145907473309609 [2023-08-03 17:07:45,633 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2023-08-03 17:07:45,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2023-08-03 17:07:45,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:07:45,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2023-08-03 17:07:45,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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 17:07:45,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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 17:07:45,654 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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 17:07:45,654 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 178 flow. Second operand 5 states and 723 transitions. [2023-08-03 17:07:45,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 69 transitions, 294 flow [2023-08-03 17:07:45,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 69 transitions, 287 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:07:45,662 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 167 flow [2023-08-03 17:07:45,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2023-08-03 17:07:45,664 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2023-08-03 17:07:45,664 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 167 flow [2023-08-03 17:07:45,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 17:07:45,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:07:45,665 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:07:45,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 17:07:45,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:07:45,870 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 17:07:45,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:07:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash 499520101, now seen corresponding path program 1 times [2023-08-03 17:07:45,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:07:45,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490050636] [2023-08-03 17:07:45,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:07:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:07:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:07:46,107 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 17:07:46,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:07:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490050636] [2023-08-03 17:07:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490050636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:07:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:07:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:07:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877937310] [2023-08-03 17:07:46,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:07:46,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:07:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:07:46,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:07:46,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:07:46,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 281 [2023-08-03 17:07:46,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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 17:07:46,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:07:46,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 281 [2023-08-03 17:07:46,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:08:26,786 INFO L124 PetriNetUnfolderBase]: 335018/467063 cut-off events. [2023-08-03 17:08:26,786 INFO L125 PetriNetUnfolderBase]: For 5801/5801 co-relation queries the response was YES. [2023-08-03 17:08:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891163 conditions, 467063 events. 335018/467063 cut-off events. For 5801/5801 co-relation queries the response was YES. Maximal size of possible extension queue 14275. Compared 3867021 event pairs, 55274 based on Foata normal form. 0/405655 useless extension candidates. Maximal degree in co-relation 424901. Up to 383649 conditions per place. [2023-08-03 17:08:29,581 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 67 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2023-08-03 17:08:29,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 87 transitions, 376 flow [2023-08-03 17:08:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:08:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:08:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-08-03 17:08:29,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575326215895611 [2023-08-03 17:08:29,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-08-03 17:08:29,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-08-03 17:08:29,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:08:29,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-08-03 17:08:29,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:29,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 17:08:29,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 17:08:29,587 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 167 flow. Second operand 3 states and 485 transitions. [2023-08-03 17:08:29,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 87 transitions, 376 flow [2023-08-03 17:08:29,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 87 transitions, 371 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:08:29,592 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 183 flow [2023-08-03 17:08:29,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2023-08-03 17:08:29,592 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2023-08-03 17:08:29,593 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 183 flow [2023-08-03 17:08:29,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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 17:08:29,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:08:29,593 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:08:29,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:08:29,593 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 17:08:29,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:08:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -985882103, now seen corresponding path program 1 times [2023-08-03 17:08:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:08:29,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964755618] [2023-08-03 17:08:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:08:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:08:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:08:29,642 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 17:08:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:08:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964755618] [2023-08-03 17:08:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964755618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:08:29,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:08:29,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:08:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474711497] [2023-08-03 17:08:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:08:29,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:08:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:08:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:08:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:08:29,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 281 [2023-08-03 17:08:29,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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 17:08:29,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:08:29,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 281 [2023-08-03 17:08:29,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:09:09,385 INFO L124 PetriNetUnfolderBase]: 326858/436439 cut-off events. [2023-08-03 17:09:09,385 INFO L125 PetriNetUnfolderBase]: For 32585/32585 co-relation queries the response was YES. [2023-08-03 17:09:10,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905048 conditions, 436439 events. 326858/436439 cut-off events. For 32585/32585 co-relation queries the response was YES. Maximal size of possible extension queue 15192. Compared 3326506 event pairs, 311418 based on Foata normal form. 0/384363 useless extension candidates. Maximal degree in co-relation 432597. Up to 406153 conditions per place. [2023-08-03 17:09:12,173 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 53 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-03 17:09:12,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 318 flow [2023-08-03 17:09:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:09:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:09:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-03 17:09:12,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432977461447213 [2023-08-03 17:09:12,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-03 17:09:12,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-03 17:09:12,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:09:12,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-03 17:09:12,177 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 17:09:12,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 17:09:12,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 17:09:12,178 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 183 flow. Second operand 3 states and 458 transitions. [2023-08-03 17:09:12,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 318 flow [2023-08-03 17:09:12,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:09:12,213 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 192 flow [2023-08-03 17:09:12,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2023-08-03 17:09:12,214 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 9 predicate places. [2023-08-03 17:09:12,214 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 192 flow [2023-08-03 17:09:12,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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 17:09:12,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:09:12,214 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:09:12,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:09:12,215 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 17:09:12,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:09:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash 367646916, now seen corresponding path program 1 times [2023-08-03 17:09:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:09:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159413961] [2023-08-03 17:09:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:09:12,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:09:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:09:12,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:09:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:09:12,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:09:12,265 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:09:12,266 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:09:12,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:09:12,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:09:12,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:09:12,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:09:12,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:09:12,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:09:12,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:09:12,267 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:09:12,273 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:09:12,273 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:09:12,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:09:12 BasicIcfg [2023-08-03 17:09:12,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:09:12,325 INFO L158 Benchmark]: Toolchain (without parser) took 253654.40ms. Allocated memory was 532.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 484.3MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-08-03 17:09:12,325 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 352.3MB. Free memory is still 305.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:09:12,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.57ms. Allocated memory is still 532.7MB. Free memory was 483.9MB in the beginning and 460.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:09:12,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.76ms. Allocated memory is still 532.7MB. Free memory was 460.2MB in the beginning and 457.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:09:12,326 INFO L158 Benchmark]: Boogie Preprocessor took 44.81ms. Allocated memory is still 532.7MB. Free memory was 457.4MB in the beginning and 455.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:09:12,327 INFO L158 Benchmark]: RCFGBuilder took 654.86ms. Allocated memory is still 532.7MB. Free memory was 455.3MB in the beginning and 479.2MB in the end (delta: -23.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. [2023-08-03 17:09:12,327 INFO L158 Benchmark]: TraceAbstraction took 252392.77ms. Allocated memory was 532.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 478.2MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-08-03 17:09:12,329 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 352.3MB. Free memory is still 305.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 488.57ms. Allocated memory is still 532.7MB. Free memory was 483.9MB in the beginning and 460.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.76ms. Allocated memory is still 532.7MB. Free memory was 460.2MB in the beginning and 457.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.81ms. Allocated memory is still 532.7MB. Free memory was 457.4MB in the beginning and 455.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 654.86ms. Allocated memory is still 532.7MB. Free memory was 455.3MB in the beginning and 479.2MB in the end (delta: -23.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. * TraceAbstraction took 252392.77ms. Allocated memory was 532.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 478.2MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 137 PlacesBefore, 43 PlacesAfterwards, 135 TransitionsBefore, 37 TransitionsAfterwards, 3082 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 114 TotalNumberOfCompositions, 8836 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4846, independent: 4628, independent conditional: 0, independent unconditional: 4628, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1634, independent: 1608, independent conditional: 0, independent unconditional: 1608, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4846, independent: 3020, independent conditional: 0, independent unconditional: 3020, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 1634, unknown conditional: 0, unknown unconditional: 1634] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 180, Positive conditional cache size: 0, Positive unconditional cache size: 180, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 171 PlacesBefore, 72 PlacesAfterwards, 163 TransitionsBefore, 60 TransitionsAfterwards, 7560 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 28292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10964, independent: 10535, independent conditional: 0, independent unconditional: 10535, dependent: 429, dependent conditional: 0, dependent unconditional: 429, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3859, independent: 3779, independent conditional: 0, independent unconditional: 3779, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10964, independent: 6756, independent conditional: 0, independent unconditional: 6756, dependent: 349, dependent conditional: 0, dependent unconditional: 349, unknown: 3859, unknown conditional: 0, unknown unconditional: 3859] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 555, Positive conditional cache size: 0, Positive unconditional cache size: 555, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299[2]; [L836] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t299={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] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t299[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299[asdf], ((void *)0), P0, ((void *)0))=-4, t299={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] [L836] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t299={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] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t299[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299[asdf], ((void *)0), P0, ((void *)0))=-3, t299={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] [L836] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t299={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] [L836] COND FALSE 0 !(asdf<2) [L837] 0 pthread_t t300[2]; [L838] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={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] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t300[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300[asdf], ((void *)0), P1, ((void *)0))=-2, t299={5:0}, t300={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] [L769] 3 x$w_buff1 = x$w_buff0 [L770] 3 x$w_buff0 = 2 [L771] 3 x$w_buff1_used = x$w_buff0_used [L772] 3 x$w_buff0_used = (_Bool)1 [L773] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L773] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t300[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300[asdf], ((void *)0), P1, ((void *)0))=-1, t299={5:0}, t300={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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L769] 4 x$w_buff1 = x$w_buff0 [L770] 4 x$w_buff0 = 2 [L771] 4 x$w_buff1_used = x$w_buff0_used [L772] 4 x$w_buff0_used = (_Bool)1 [L773] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, expression=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=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 840]: 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, 159 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: 5.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 66 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=95occurred 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, 187 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: 247.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 241.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 16 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred 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.5s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 23/31 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 17:09:12,349 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...