/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 PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix006_power.oepc_pso.oepc_rmo.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:33:22,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:33:22,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:33:22,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:33:22,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:33:22,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:33:22,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:33:22,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:33:22,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:33:22,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:33:22,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:33:22,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:33:22,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:33:22,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:33:22,219 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:33:22,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:33:22,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:33:22,219 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:33:22,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:33:22,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:33:22,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:33:22,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:33:22,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:33:22,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:33:22,222 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:33:22,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:33:22,222 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:33:22,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:33:22,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:33:22,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:33:22,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:33:22,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:33:22,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:33:22,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:33:22,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:33:22,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:33:22,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:33:22,225 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:33:22,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:33:22,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:33:22,226 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:33:22,226 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 -> PROGRAM_FIRST [2023-08-04 05:33:22,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:33:22,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:33:22,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:33:22,485 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:33:22,486 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:33:22,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix006_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 05:33:23,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:33:23,890 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:33:23,890 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix006_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 05:33:23,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebc158b7/754079b706964d1ea4844e94164f5e33/FLAG1a054a0c4 [2023-08-04 05:33:23,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebc158b7/754079b706964d1ea4844e94164f5e33 [2023-08-04 05:33:23,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:33:23,921 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:33:23,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:33:23,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:33:23,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:33:23,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:33:23" (1/1) ... [2023-08-04 05:33:23,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b4fe11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:23, skipping insertion in model container [2023-08-04 05:33:23,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:33:23" (1/1) ... [2023-08-04 05:33:23,991 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:33:24,153 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_mix006_power.oepc_pso.oepc_rmo.oepc_bound2.i[969,982] [2023-08-04 05:33:24,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:33:24,409 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:33:24,422 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_mix006_power.oepc_pso.oepc_rmo.oepc_bound2.i[969,982] [2023-08-04 05:33:24,439 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:33:24,441 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:33:24,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:33:24,494 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:33:24,494 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:33:24,500 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:33:24,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24 WrapperNode [2023-08-04 05:33:24,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:33:24,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:33:24,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:33:24,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:33:24,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,552 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2023-08-04 05:33:24,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:33:24,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:33:24,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:33:24,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:33:24,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:33:24,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:33:24,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:33:24,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:33:24,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (1/1) ... [2023-08-04 05:33:24,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:33:24,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:33:24,624 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-04 05:33:24,630 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-04 05:33:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:33:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:33:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:33:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:33:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:33:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:33:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:33:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:33:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:33:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:33:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:33:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:33:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:33:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:33:24,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:33:24,654 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:33:24,808 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:33:24,809 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:33:25,086 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:33:25,210 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:33:25,210 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:33:25,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:33:25 BoogieIcfgContainer [2023-08-04 05:33:25,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:33:25,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:33:25,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:33:25,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:33:25,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:33:23" (1/3) ... [2023-08-04 05:33:25,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd5e55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:33:25, skipping insertion in model container [2023-08-04 05:33:25,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:33:24" (2/3) ... [2023-08-04 05:33:25,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd5e55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:33:25, skipping insertion in model container [2023-08-04 05:33:25,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:33:25" (3/3) ... [2023-08-04 05:33:25,219 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix006_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 05:33:25,226 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:33:25,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:33:25,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:33:25,235 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:33:25,289 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:33:25,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 05:33:25,427 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-04 05:33:25,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:33:25,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 456 events. 30/456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2022 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2023-08-04 05:33:25,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 05:33:25,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 133 transitions, 281 flow [2023-08-04 05:33:25,447 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:33:25,455 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 133 transitions, 281 flow [2023-08-04 05:33:25,458 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 133 transitions, 281 flow [2023-08-04 05:33:25,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 05:33:25,572 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-04 05:33:25,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:33:25,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 456 events. 30/456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2022 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2023-08-04 05:33:25,580 INFO L119 LiptonReduction]: Number of co-enabled transitions 2976 [2023-08-04 05:33:28,927 INFO L134 LiptonReduction]: Checked pairs total: 7672 [2023-08-04 05:33:28,927 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-04 05:33:28,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:33:28,946 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;@6c833237, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:33:28,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:33:28,949 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:33:28,949 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-08-04 05:33:28,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:33:28,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:28,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:33:28,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:33:28,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash 17662655, now seen corresponding path program 1 times [2023-08-04 05:33:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509881338] [2023-08-04 05:33:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:29,334 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-04 05:33:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:33:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509881338] [2023-08-04 05:33:29,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509881338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:33:29,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:33:29,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:33:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232130909] [2023-08-04 05:33:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:33:29,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:33:29,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:33:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:33:29,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:33:29,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245 [2023-08-04 05:33:29,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:29,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:33:29,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245 [2023-08-04 05:33:29,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:33:29,882 INFO L124 PetriNetUnfolderBase]: 1908/3322 cut-off events. [2023-08-04 05:33:29,882 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-04 05:33:29,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6417 conditions, 3322 events. 1908/3322 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 20970 event pairs, 498 based on Foata normal form. 0/2958 useless extension candidates. Maximal degree in co-relation 5408. Up to 2077 conditions per place. [2023-08-04 05:33:29,904 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 42 selfloop transitions, 2 changer transitions 6/54 dead transitions. [2023-08-04 05:33:29,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 223 flow [2023-08-04 05:33:29,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:33:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:33:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-04 05:33:29,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5414965986394558 [2023-08-04 05:33:29,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-04 05:33:29,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-04 05:33:29,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:33:29,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-04 05:33:29,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:29,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:29,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:29,941 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 85 flow. Second operand 3 states and 398 transitions. [2023-08-04 05:33:29,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 223 flow [2023-08-04 05:33:29,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 223 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:33:29,947 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 71 flow [2023-08-04 05:33:29,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-04 05:33:29,952 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 05:33:29,953 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 71 flow [2023-08-04 05:33:29,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:29,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:29,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:33:29,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:33:29,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:33:29,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash -197018834, now seen corresponding path program 1 times [2023-08-04 05:33:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:29,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525554095] [2023-08-04 05:33:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:29,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:30,030 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-04 05:33:30,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:33:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525554095] [2023-08-04 05:33:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525554095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:33:30,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:33:30,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:33:30,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653455325] [2023-08-04 05:33:30,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:33:30,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:33:30,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:33:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:33:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:33:30,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-04 05:33:30,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:33:30,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-04 05:33:30,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:33:30,363 INFO L124 PetriNetUnfolderBase]: 1417/2332 cut-off events. [2023-08-04 05:33:30,363 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2023-08-04 05:33:30,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 2332 events. 1417/2332 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12607 event pairs, 844 based on Foata normal form. 0/2148 useless extension candidates. Maximal degree in co-relation 4753. Up to 2182 conditions per place. [2023-08-04 05:33:30,376 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 26 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2023-08-04 05:33:30,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 139 flow [2023-08-04 05:33:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:33:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:33:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-04 05:33:30,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2023-08-04 05:33:30,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-04 05:33:30,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-04 05:33:30,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:33:30,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-04 05:33:30,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,386 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 71 flow. Second operand 3 states and 369 transitions. [2023-08-04 05:33:30,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 139 flow [2023-08-04 05:33:30,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:33:30,393 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 75 flow [2023-08-04 05:33:30,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-04 05:33:30,394 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-04 05:33:30,394 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 75 flow [2023-08-04 05:33:30,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:30,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:33:30,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 05:33:30,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:33:30,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash 880894873, now seen corresponding path program 1 times [2023-08-04 05:33:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:30,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819748048] [2023-08-04 05:33:30,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:30,502 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-04 05:33:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:33:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819748048] [2023-08-04 05:33:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819748048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:33:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109994258] [2023-08-04 05:33:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:30,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:33:30,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:33:30,511 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-04 05:33:30,536 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-04 05:33:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:30,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:33:30,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:33:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:33:30,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:33:30,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109994258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:33:30,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:33:30,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:33:30,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247773941] [2023-08-04 05:33:30,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:33:30,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:33:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:33:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:33:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:33:30,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-04 05:33:30,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:33:30,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-04 05:33:30,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:33:30,944 INFO L124 PetriNetUnfolderBase]: 1232/1931 cut-off events. [2023-08-04 05:33:30,945 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:33:30,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3855 conditions, 1931 events. 1232/1931 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9608 event pairs, 1058 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 3839. Up to 1821 conditions per place. [2023-08-04 05:33:30,956 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 29 selfloop transitions, 2 changer transitions 1/36 dead transitions. [2023-08-04 05:33:30,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 153 flow [2023-08-04 05:33:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:33:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:33:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-04 05:33:30,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2023-08-04 05:33:30,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-04 05:33:30,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-04 05:33:30,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:33:30,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-04 05:33:30,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,962 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 75 flow. Second operand 3 states and 372 transitions. [2023-08-04 05:33:30,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 153 flow [2023-08-04 05:33:30,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 149 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:33:30,964 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 79 flow [2023-08-04 05:33:30,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-04 05:33:30,965 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-04 05:33:30,966 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 79 flow [2023-08-04 05:33:30,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:30,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:30,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:33:30,973 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-04 05:33:31,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:33:31,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:33:31,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash 570566059, now seen corresponding path program 1 times [2023-08-04 05:33:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:31,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064189458] [2023-08-04 05:33:31,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:33:31,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:33:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064189458] [2023-08-04 05:33:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064189458] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:33:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050233775] [2023-08-04 05:33:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:31,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:33:31,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:33:31,255 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-04 05:33:31,258 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-04 05:33:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:31,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:33:31,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:33:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:33:31,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:33:31,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050233775] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:33:31,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:33:31,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:33:31,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920278338] [2023-08-04 05:33:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:33:31,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:33:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:33:31,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:33:31,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:33:31,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-04 05:33:31,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:31,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:33:31,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-04 05:33:31,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:33:31,594 INFO L124 PetriNetUnfolderBase]: 1160/1783 cut-off events. [2023-08-04 05:33:31,594 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 05:33:31,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 1783 events. 1160/1783 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8797 event pairs, 672 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 3619. Up to 1463 conditions per place. [2023-08-04 05:33:31,605 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 33 selfloop transitions, 2 changer transitions 1/40 dead transitions. [2023-08-04 05:33:31,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 173 flow [2023-08-04 05:33:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:33:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:33:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-04 05:33:31,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115646258503401 [2023-08-04 05:33:31,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-04 05:33:31,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-04 05:33:31,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:33:31,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-04 05:33:31,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:31,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:31,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:31,610 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 79 flow. Second operand 3 states and 376 transitions. [2023-08-04 05:33:31,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 173 flow [2023-08-04 05:33:31,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:33:31,612 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 83 flow [2023-08-04 05:33:31,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-04 05:33:31,612 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-04 05:33:31,613 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 83 flow [2023-08-04 05:33:31,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:31,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:31,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:33:31,621 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-04 05:33:31,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 05:33:31,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:33:31,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:31,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2139721050, now seen corresponding path program 1 times [2023-08-04 05:33:31,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:31,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854123053] [2023-08-04 05:33:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:33:31,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:33:31,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854123053] [2023-08-04 05:33:31,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854123053] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:33:31,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122287412] [2023-08-04 05:33:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:31,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:33:31,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:33:31,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:33:31,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 05:33:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:31,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:33:31,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:33:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:33:31,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:33:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:33:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122287412] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:33:32,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:33:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:33:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951248983] [2023-08-04 05:33:32,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:33:32,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:33:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:33:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:33:32,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:33:32,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-08-04 05:33:32,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:32,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:33:32,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-08-04 05:33:32,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:33:32,072 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:33:32,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:33:32,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 21 events. 6/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 05:33:32,072 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:33:32,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 51 flow [2023-08-04 05:33:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:33:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:33:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-04 05:33:32,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2023-08-04 05:33:32,074 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-04 05:33:32,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-04 05:33:32,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:33:32,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-04 05:33:32,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:32,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:32,079 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:32,079 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 83 flow. Second operand 4 states and 460 transitions. [2023-08-04 05:33:32,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 51 flow [2023-08-04 05:33:32,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:33:32,080 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 05:33:32,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2023-08-04 05:33:32,082 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -22 predicate places. [2023-08-04 05:33:32,082 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 05:33:32,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:32,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:33:32,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:33:32,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:33:32,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 05:33:32,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:33:32,291 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 05:33:32,293 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:33:32,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 05:33:32,330 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-04 05:33:32,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:33:32,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 456 events. 30/456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2022 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2023-08-04 05:33:32,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 05:33:32,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 104 transitions, 223 flow [2023-08-04 05:33:32,332 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:33:32,333 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 104 transitions, 223 flow [2023-08-04 05:33:32,333 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 104 transitions, 223 flow [2023-08-04 05:33:32,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 223 flow [2023-08-04 05:33:32,347 INFO L124 PetriNetUnfolderBase]: 6/224 cut-off events. [2023-08-04 05:33:32,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:33:32,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 224 events. 6/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 668 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-04 05:33:32,350 INFO L119 LiptonReduction]: Number of co-enabled transitions 1584 [2023-08-04 05:33:34,994 INFO L134 LiptonReduction]: Checked pairs total: 3969 [2023-08-04 05:33:34,994 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-04 05:33:34,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:33:34,996 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;@6c833237, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:33:34,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:33:35,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:33:35,000 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 05:33:35,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:33:35,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:35,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:33:35,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:33:35,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:35,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2056479853, now seen corresponding path program 1 times [2023-08-04 05:33:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:35,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321823527] [2023-08-04 05:33:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:33:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:33:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321823527] [2023-08-04 05:33:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321823527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:33:35,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:33:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:33:35,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904873105] [2023-08-04 05:33:35,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:33:35,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:33:35,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:33:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:33:35,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:33:35,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 215 [2023-08-04 05:33:35,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:35,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:33:35,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 215 [2023-08-04 05:33:35,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:33:35,183 INFO L124 PetriNetUnfolderBase]: 579/1022 cut-off events. [2023-08-04 05:33:35,183 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-04 05:33:35,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1022 events. 579/1022 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4994 event pairs, 295 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 2037. Up to 935 conditions per place. [2023-08-04 05:33:35,189 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 25 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-04 05:33:35,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 135 flow [2023-08-04 05:33:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:33:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:33:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 05:33:35,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5689922480620155 [2023-08-04 05:33:35,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 05:33:35,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 05:33:35,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:33:35,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 05:33:35,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:35,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:35,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:35,195 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 71 flow. Second operand 3 states and 367 transitions. [2023-08-04 05:33:35,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 135 flow [2023-08-04 05:33:35,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 135 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:33:35,197 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 79 flow [2023-08-04 05:33:35,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-04 05:33:35,199 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-08-04 05:33:35,199 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 79 flow [2023-08-04 05:33:35,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:35,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:35,199 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:33:35,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:33:35,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:33:35,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2068307498, now seen corresponding path program 1 times [2023-08-04 05:33:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:35,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171760552] [2023-08-04 05:33:35,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:33:35,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:33:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:33:35,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:33:35,241 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:33:35,242 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:33:35,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:33:35,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:33:35,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:33:35,242 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:33:35,243 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:33:35,243 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:33:35,244 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:33:35,266 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:33:35,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 05:33:35,388 INFO L124 PetriNetUnfolderBase]: 93/1403 cut-off events. [2023-08-04 05:33:35,389 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:33:35,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1403 events. 93/1403 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9709 event pairs, 0 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 1017. Up to 54 conditions per place. [2023-08-04 05:33:35,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 05:33:35,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 160 transitions, 356 flow [2023-08-04 05:33:35,400 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:33:35,400 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 160 transitions, 356 flow [2023-08-04 05:33:35,401 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 160 transitions, 356 flow [2023-08-04 05:33:35,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 05:33:35,536 INFO L124 PetriNetUnfolderBase]: 93/1403 cut-off events. [2023-08-04 05:33:35,536 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:33:35,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1403 events. 93/1403 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9709 event pairs, 0 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 1017. Up to 54 conditions per place. [2023-08-04 05:33:35,567 INFO L119 LiptonReduction]: Number of co-enabled transitions 7248 [2023-08-04 05:33:38,780 INFO L134 LiptonReduction]: Checked pairs total: 25541 [2023-08-04 05:33:38,781 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-04 05:33:38,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:33:38,782 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;@6c833237, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:33:38,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:33:38,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:33:38,784 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-04 05:33:38,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:33:38,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:38,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:33:38,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:33:38,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash 29605650, now seen corresponding path program 1 times [2023-08-04 05:33:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:38,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971099713] [2023-08-04 05:33:38,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:33:38,830 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-04 05:33:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:33:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971099713] [2023-08-04 05:33:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971099713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:33:38,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:33:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:33:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767326727] [2023-08-04 05:33:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:33:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:33:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:33:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:33:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:33:38,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 279 [2023-08-04 05:33:38,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:33:38,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:33:38,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 279 [2023-08-04 05:33:38,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:34:39,772 INFO L124 PetriNetUnfolderBase]: 490490/644779 cut-off events. [2023-08-04 05:34:39,773 INFO L125 PetriNetUnfolderBase]: For 9530/9530 co-relation queries the response was YES. [2023-08-04 05:34:41,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269860 conditions, 644779 events. 490490/644779 cut-off events. For 9530/9530 co-relation queries the response was YES. Maximal size of possible extension queue 17768. Compared 4922805 event pairs, 81617 based on Foata normal form. 0/575057 useless extension candidates. Maximal degree in co-relation 1069289. Up to 565329 conditions per place. [2023-08-04 05:34:44,406 INFO L140 encePairwiseOnDemand]: 273/279 looper letters, 71 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2023-08-04 05:34:44,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 381 flow [2023-08-04 05:34:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:34:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:34:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-04 05:34:44,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5734767025089605 [2023-08-04 05:34:44,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-04 05:34:44,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-04 05:34:44,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:34:44,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-04 05:34:44,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:34:44,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:34:44,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:34:44,413 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 148 flow. Second operand 3 states and 480 transitions. [2023-08-04 05:34:44,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 381 flow [2023-08-04 05:34:44,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 88 transitions, 375 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 05:34:44,426 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 161 flow [2023-08-04 05:34:44,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2023-08-04 05:34:44,427 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-04 05:34:44,428 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 161 flow [2023-08-04 05:34:44,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:34:44,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:34:44,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:34:44,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:34:44,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:34:44,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:34:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1602587474, now seen corresponding path program 1 times [2023-08-04 05:34:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:34:44,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370932768] [2023-08-04 05:34:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:34:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:34:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:34:44,457 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-04 05:34:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:34:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370932768] [2023-08-04 05:34:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370932768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:34:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:34:44,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:34:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049762021] [2023-08-04 05:34:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:34:44,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:34:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:34:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:34:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:34:44,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-08-04 05:34:44,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:34:44,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:34:44,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-08-04 05:34:44,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:35:46,281 INFO L124 PetriNetUnfolderBase]: 478628/619412 cut-off events. [2023-08-04 05:35:46,282 INFO L125 PetriNetUnfolderBase]: For 50026/50026 co-relation queries the response was YES. [2023-08-04 05:35:49,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311565 conditions, 619412 events. 478628/619412 cut-off events. For 50026/50026 co-relation queries the response was YES. Maximal size of possible extension queue 16976. Compared 4367413 event pairs, 400414 based on Foata normal form. 0/551003 useless extension candidates. Maximal degree in co-relation 863426. Up to 598251 conditions per place. [2023-08-04 05:35:52,191 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 46 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-04 05:35:52,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 270 flow [2023-08-04 05:35:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:35:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:35:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-08-04 05:35:52,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256869772998806 [2023-08-04 05:35:52,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-08-04 05:35:52,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-08-04 05:35:52,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:35:52,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-08-04 05:35:52,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:35:52,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:35:52,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:35:52,202 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 161 flow. Second operand 3 states and 440 transitions. [2023-08-04 05:35:52,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 270 flow [2023-08-04 05:35:52,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 62 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:35:52,271 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 170 flow [2023-08-04 05:35:52,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-08-04 05:35:52,273 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-04 05:35:52,274 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 170 flow [2023-08-04 05:35:52,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:35:52,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:35:52,274 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:35:52,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:35:52,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:35:52,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:35:52,275 INFO L85 PathProgramCache]: Analyzing trace with hash -227762733, now seen corresponding path program 1 times [2023-08-04 05:35:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:35:52,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368108776] [2023-08-04 05:35:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:35:52,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:35:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:35:52,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:35:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:35:52,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:35:52,314 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:35:52,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:35:52,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:35:52,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:35:52,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:35:52,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 05:35:52,316 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:35:52,316 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:35:52,318 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:35:52,318 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:35:52,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:35:52 BasicIcfg [2023-08-04 05:35:52,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:35:52,382 INFO L158 Benchmark]: Toolchain (without parser) took 148460.19ms. Allocated memory was 549.5MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 500.9MB in the beginning and 10.9GB in the end (delta: -10.4GB). Peak memory consumption was 5.1GB. Max. memory is 16.0GB. [2023-08-04 05:35:52,382 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 354.4MB. Free memory was 308.0MB in the beginning and 307.8MB in the end (delta: 162.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:35:52,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.01ms. Allocated memory is still 549.5MB. Free memory was 500.6MB in the beginning and 477.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:35:52,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.56ms. Allocated memory is still 549.5MB. Free memory was 477.0MB in the beginning and 474.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:35:52,383 INFO L158 Benchmark]: Boogie Preprocessor took 33.11ms. Allocated memory is still 549.5MB. Free memory was 474.3MB in the beginning and 472.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:35:52,383 INFO L158 Benchmark]: RCFGBuilder took 625.14ms. Allocated memory is still 549.5MB. Free memory was 472.2MB in the beginning and 483.5MB in the end (delta: -11.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.0GB. [2023-08-04 05:35:52,383 INFO L158 Benchmark]: TraceAbstraction took 147167.38ms. Allocated memory was 549.5MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 483.5MB in the beginning and 10.9GB in the end (delta: -10.4GB). Peak memory consumption was 5.1GB. Max. memory is 16.0GB. [2023-08-04 05:35:52,385 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.15ms. Allocated memory is still 354.4MB. Free memory was 308.0MB in the beginning and 307.8MB in the end (delta: 162.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 579.01ms. Allocated memory is still 549.5MB. Free memory was 500.6MB in the beginning and 477.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.56ms. Allocated memory is still 549.5MB. Free memory was 477.0MB in the beginning and 474.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.11ms. Allocated memory is still 549.5MB. Free memory was 474.3MB in the beginning and 472.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 625.14ms. Allocated memory is still 549.5MB. Free memory was 472.2MB in the beginning and 483.5MB in the end (delta: -11.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.0GB. * TraceAbstraction took 147167.38ms. Allocated memory was 549.5MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 483.5MB in the beginning and 10.9GB in the end (delta: -10.4GB). Peak memory consumption was 5.1GB. 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.5s, 135 PlacesBefore, 41 PlacesAfterwards, 133 TransitionsBefore, 35 TransitionsAfterwards, 2976 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 4 ChoiceCompositions, 112 TotalNumberOfCompositions, 7672 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3565, independent: 3380, independent conditional: 0, independent unconditional: 3380, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1591, independent: 1544, independent conditional: 0, independent unconditional: 1544, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3565, independent: 1836, independent conditional: 0, independent unconditional: 1836, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 1591, unknown conditional: 0, unknown unconditional: 1591] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 109 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 28 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 3969 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1753, independent: 1619, independent conditional: 0, independent unconditional: 1619, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 784, independent: 767, independent conditional: 0, independent unconditional: 767, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1753, independent: 852, independent conditional: 0, independent unconditional: 852, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 784, unknown conditional: 0, unknown unconditional: 784] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 168 PlacesBefore, 68 PlacesAfterwards, 160 TransitionsBefore, 56 TransitionsAfterwards, 7248 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 25541 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7351, independent: 6954, independent conditional: 0, independent unconditional: 6954, dependent: 397, dependent conditional: 0, dependent unconditional: 397, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3363, independent: 3302, independent conditional: 0, independent unconditional: 3302, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7351, independent: 3652, independent conditional: 0, independent unconditional: 3652, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 3363, unknown conditional: 0, unknown unconditional: 3363] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153[2]; [L844] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t153={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] COND TRUE 0 asdf<2 [L844] FCALL, FORK 0 pthread_create(&t153[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, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t153[asdf], ((void *)0), P0, ((void *)0))=-2, t153={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t153={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] COND TRUE 0 asdf<2 [L844] FCALL, FORK 0 pthread_create(&t153[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, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t153[asdf], ((void *)0), P0, ((void *)0))=-1, t153={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 2 z$w_buff1 = z$w_buff0 [L748] 2 z$w_buff0 = 1 [L749] 2 z$w_buff1_used = z$w_buff0_used [L750] 2 z$w_buff0_used = (_Bool)1 [L751] CALL 2 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=1, z$w_buff1_used=1, 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 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: 7.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 3 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10/15 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, 183 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: 137.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 133.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 8 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 156 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: 2.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 50 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=79occurred 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.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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-04 05:35:52,410 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...