/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix019_tso.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:13:47,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:13:47,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:13:47,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:13:47,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:13:47,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:13:47,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:13:47,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:13:47,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:13:47,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:13:47,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:13:47,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:13:47,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:13:47,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:13:47,884 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:13:47,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:13:47,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:13:47,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:13:47,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:13:47,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:13:47,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:13:47,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:13:47,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:13:47,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:13:47,890 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:13:47,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:13:47,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:13:47,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:13:47,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:13:47,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:13:47,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:13:47,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:13:47,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:13:47,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:13:47,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:13:47,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:13:47,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:13:47,892 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:13:47,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:13:47,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:13:47,892 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:13:47,892 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 17:13:48,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:13:48,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:13:48,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:13:48,125 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:13:48,125 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:13:48,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix019_tso.oepc_bound2.i [2023-08-03 17:13:49,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:13:49,426 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:13:49,426 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix019_tso.oepc_bound2.i [2023-08-03 17:13:49,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5395ebc17/09c91fc647f94f938dfa7bbbb4d659b0/FLAG36cd8f392 [2023-08-03 17:13:49,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5395ebc17/09c91fc647f94f938dfa7bbbb4d659b0 [2023-08-03 17:13:49,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:13:49,464 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:13:49,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:13:49,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:13:49,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:13:49,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:13:49" (1/1) ... [2023-08-03 17:13:49,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@530f975c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:49, skipping insertion in model container [2023-08-03 17:13:49,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:13:49" (1/1) ... [2023-08-03 17:13:49,532 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:13:49,694 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_mix019_tso.oepc_bound2.i[949,962] [2023-08-03 17:13:49,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:13:49,900 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:13:49,913 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_mix019_tso.oepc_bound2.i[949,962] [2023-08-03 17:13:49,929 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:13:49,930 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:13:49,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:13:50,001 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:13:50,001 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:13:50,007 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:13:50,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50 WrapperNode [2023-08-03 17:13:50,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:13:50,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:13:50,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:13:50,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:13:50,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,051 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 170 [2023-08-03 17:13:50,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:13:50,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:13:50,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:13:50,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:13:50,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:13:50,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:13:50,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:13:50,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:13:50,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (1/1) ... [2023-08-03 17:13:50,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:13:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:13:50,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 17:13:50,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 17:13:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:13:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:13:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:13:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:13:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:13:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:13:50,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:13:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:13:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:13:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:13:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:13:50,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:13:50,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:13:50,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:13:50,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:13:50,149 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:13:50,266 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:13:50,267 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:13:50,555 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:13:50,670 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:13:50,671 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:13:50,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:13:50 BoogieIcfgContainer [2023-08-03 17:13:50,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:13:50,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:13:50,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:13:50,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:13:50,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:13:49" (1/3) ... [2023-08-03 17:13:50,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414f101f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:13:50, skipping insertion in model container [2023-08-03 17:13:50,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:13:50" (2/3) ... [2023-08-03 17:13:50,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414f101f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:13:50, skipping insertion in model container [2023-08-03 17:13:50,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:13:50" (3/3) ... [2023-08-03 17:13:50,679 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix019_tso.oepc_bound2.i [2023-08-03 17:13:50,686 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:13:50,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:13:50,693 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:13:50,693 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:13:50,729 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:13:50,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 131 transitions, 277 flow [2023-08-03 17:13:50,884 INFO L124 PetriNetUnfolderBase]: 30/454 cut-off events. [2023-08-03 17:13:50,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:13:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 454 events. 30/454 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2006 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 271. Up to 16 conditions per place. [2023-08-03 17:13:50,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 131 transitions, 277 flow [2023-08-03 17:13:50,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 131 transitions, 277 flow [2023-08-03 17:13:50,900 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:13:50,910 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 131 transitions, 277 flow [2023-08-03 17:13:50,913 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 131 transitions, 277 flow [2023-08-03 17:13:50,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 131 transitions, 277 flow [2023-08-03 17:13:50,976 INFO L124 PetriNetUnfolderBase]: 30/454 cut-off events. [2023-08-03 17:13:50,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:13:50,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 454 events. 30/454 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2006 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 271. Up to 16 conditions per place. [2023-08-03 17:13:50,986 INFO L119 LiptonReduction]: Number of co-enabled transitions 2806 [2023-08-03 17:13:54,428 INFO L134 LiptonReduction]: Checked pairs total: 7302 [2023-08-03 17:13:54,428 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-03 17:13:54,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:13:54,461 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;@49802df3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:13:54,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:13:54,467 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:13:54,467 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 17:13:54,467 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:13:54,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:13:54,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:13:54,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:13:54,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:13:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 542156957, now seen corresponding path program 1 times [2023-08-03 17:13:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:13:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174785095] [2023-08-03 17:13:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:13:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:13:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:13:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:13:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:13:54,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174785095] [2023-08-03 17:13:54,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174785095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:13:54,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:13:54,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:13:54,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982163017] [2023-08-03 17:13:54,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:13:54,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:13:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:13:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:13:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:13:54,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-03 17:13:54,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:54,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:13:54,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-03 17:13:54,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:13:55,200 INFO L124 PetriNetUnfolderBase]: 2161/3422 cut-off events. [2023-08-03 17:13:55,200 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-03 17:13:55,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 3422 events. 2161/3422 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19861 event pairs, 1876 based on Foata normal form. 120/2874 useless extension candidates. Maximal degree in co-relation 6845. Up to 3294 conditions per place. [2023-08-03 17:13:55,223 INFO L140 encePairwiseOnDemand]: 238/242 looper letters, 30 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-03 17:13:55,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 157 flow [2023-08-03 17:13:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:13:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:13:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-03 17:13:55,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055096418732782 [2023-08-03 17:13:55,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-03 17:13:55,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-03 17:13:55,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:13:55,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-03 17:13:55,252 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-03 17:13:55,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:55,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:55,258 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 87 flow. Second operand 3 states and 367 transitions. [2023-08-03 17:13:55,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 157 flow [2023-08-03 17:13:55,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:13:55,263 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 93 flow [2023-08-03 17:13:55,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-03 17:13:55,267 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-03 17:13:55,267 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 93 flow [2023-08-03 17:13:55,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:55,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:13:55,268 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:13:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:13:55,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:13:55,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:13:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -378838003, now seen corresponding path program 1 times [2023-08-03 17:13:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:13:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053270807] [2023-08-03 17:13:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:13:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:13:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:13:55,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:13:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:13:55,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:13:55,366 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:13:55,367 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:13:55,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:13:55,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:13:55,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:13:55,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:13:55,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:13:55,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:13:55,370 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:13:55,371 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:13:55,371 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:13:55,410 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:13:55,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 157 transitions, 350 flow [2023-08-03 17:13:55,567 INFO L124 PetriNetUnfolderBase]: 93/1400 cut-off events. [2023-08-03 17:13:55,567 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:13:55,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 1400 events. 93/1400 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9702 event pairs, 0 based on Foata normal form. 0/1235 useless extension candidates. Maximal degree in co-relation 1014. Up to 54 conditions per place. [2023-08-03 17:13:55,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 157 transitions, 350 flow [2023-08-03 17:13:55,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 157 transitions, 350 flow [2023-08-03 17:13:55,578 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:13:55,578 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 157 transitions, 350 flow [2023-08-03 17:13:55,578 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 157 transitions, 350 flow [2023-08-03 17:13:55,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 157 transitions, 350 flow [2023-08-03 17:13:55,709 INFO L124 PetriNetUnfolderBase]: 93/1400 cut-off events. [2023-08-03 17:13:55,709 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:13:55,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 1400 events. 93/1400 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9702 event pairs, 0 based on Foata normal form. 0/1235 useless extension candidates. Maximal degree in co-relation 1014. Up to 54 conditions per place. [2023-08-03 17:13:55,741 INFO L119 LiptonReduction]: Number of co-enabled transitions 6804 [2023-08-03 17:13:59,015 INFO L134 LiptonReduction]: Checked pairs total: 21239 [2023-08-03 17:13:59,015 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-03 17:13:59,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:13:59,019 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;@49802df3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:13:59,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:13:59,022 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:13:59,022 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-08-03 17:13:59,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:13:59,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:13:59,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:13:59,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:13:59,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:13:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash 829410145, now seen corresponding path program 1 times [2023-08-03 17:13:59,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:13:59,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69382734] [2023-08-03 17:13:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:13:59,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:13:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:13:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:13:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:13:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69382734] [2023-08-03 17:13:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69382734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:13:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:13:59,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:13:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259583996] [2023-08-03 17:13:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:13:59,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:13:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:13:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:13:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:13:59,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275 [2023-08-03 17:13:59,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:13:59,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:13:59,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275 [2023-08-03 17:13:59,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:14:51,293 INFO L124 PetriNetUnfolderBase]: 468866/625726 cut-off events. [2023-08-03 17:14:51,293 INFO L125 PetriNetUnfolderBase]: For 8784/8784 co-relation queries the response was YES. [2023-08-03 17:14:53,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223584 conditions, 625726 events. 468866/625726 cut-off events. For 8784/8784 co-relation queries the response was YES. Maximal size of possible extension queue 17429. Compared 4747118 event pairs, 380024 based on Foata normal form. 13020/541842 useless extension candidates. Maximal degree in co-relation 263649. Up to 587323 conditions per place. [2023-08-03 17:14:55,478 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 44 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-03 17:14:55,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 248 flow [2023-08-03 17:14:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:14:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:14:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-03 17:14:55,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2023-08-03 17:14:55,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-03 17:14:55,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-03 17:14:55,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:14:55,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-03 17:14:55,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:14:55,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:14:55,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:14:55,485 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 148 flow. Second operand 3 states and 435 transitions. [2023-08-03 17:14:55,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 248 flow [2023-08-03 17:14:55,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 242 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:14:55,500 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 152 flow [2023-08-03 17:14:55,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, 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=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-03 17:14:55,501 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 17:14:55,501 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 152 flow [2023-08-03 17:14:55,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:14:55,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:14:55,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:14:55,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:14:55,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:14:55,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:14:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash -483200820, now seen corresponding path program 1 times [2023-08-03 17:14:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:14:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443312804] [2023-08-03 17:14:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:14:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:14:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:14:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:14:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:14:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443312804] [2023-08-03 17:14:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443312804] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:14:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043379736] [2023-08-03 17:14:55,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:14:55,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:14:55,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:14:55,561 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:14:55,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 17:14:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:14:55,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:14:55,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:14:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:14:55,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:14:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:14:55,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043379736] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:14:55,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:14:55,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:14:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804940490] [2023-08-03 17:14:55,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:14:55,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:14:55,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:14:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:14:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:14:55,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 275 [2023-08-03 17:14:55,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:14:55,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:14:55,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 275 [2023-08-03 17:14:55,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:15:39,194 INFO L124 PetriNetUnfolderBase]: 389314/515314 cut-off events. [2023-08-03 17:15:39,194 INFO L125 PetriNetUnfolderBase]: For 6392/6392 co-relation queries the response was YES. [2023-08-03 17:15:41,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007287 conditions, 515314 events. 389314/515314 cut-off events. For 6392/6392 co-relation queries the response was YES. Maximal size of possible extension queue 14908. Compared 3768277 event pairs, 247180 based on Foata normal form. 4/437670 useless extension candidates. Maximal degree in co-relation 263659. Up to 484009 conditions per place. [2023-08-03 17:15:44,226 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 49 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-03 17:15:44,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 280 flow [2023-08-03 17:15:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:15:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:15:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-03 17:15:44,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145454545454545 [2023-08-03 17:15:44,251 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-03 17:15:44,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-03 17:15:44,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:15:44,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-03 17:15:44,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:15:44,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:15:44,259 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:15:44,259 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 152 flow. Second operand 4 states and 566 transitions. [2023-08-03 17:15:44,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 280 flow [2023-08-03 17:15:44,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 67 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:15:44,277 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 170 flow [2023-08-03 17:15:44,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-08-03 17:15:44,280 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-08-03 17:15:44,280 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 170 flow [2023-08-03 17:15:44,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:15:44,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:15:44,281 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:15:44,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:15:44,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:15:44,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:15:44,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:15:44,488 INFO L85 PathProgramCache]: Analyzing trace with hash -700564283, now seen corresponding path program 1 times [2023-08-03 17:15:44,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:15:44,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68003071] [2023-08-03 17:15:44,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:15:44,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:15:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:15:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:15:44,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:15:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68003071] [2023-08-03 17:15:44,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68003071] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:15:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151815149] [2023-08-03 17:15:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:15:44,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:15:44,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:15:44,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:15:44,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 17:15:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:15:44,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:15:44,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:15:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:15:44,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:15:44,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151815149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:15:44,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:15:44,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:15:44,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371213991] [2023-08-03 17:15:44,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:15:44,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:15:44,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:15:44,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:15:44,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:15:44,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 275 [2023-08-03 17:15:44,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:15:44,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:15:44,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 275 [2023-08-03 17:15:44,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:16:25,291 INFO L124 PetriNetUnfolderBase]: 389290/515266 cut-off events. [2023-08-03 17:16:25,291 INFO L125 PetriNetUnfolderBase]: For 6492/6492 co-relation queries the response was YES. [2023-08-03 17:16:27,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007251 conditions, 515266 events. 389290/515266 cut-off events. For 6492/6492 co-relation queries the response was YES. Maximal size of possible extension queue 14908. Compared 3767507 event pairs, 247168 based on Foata normal form. 16/437634 useless extension candidates. Maximal degree in co-relation 263635. Up to 484008 conditions per place. [2023-08-03 17:16:28,833 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 49 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-03 17:16:28,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 286 flow [2023-08-03 17:16:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:16:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:16:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2023-08-03 17:16:28,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504 [2023-08-03 17:16:28,835 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2023-08-03 17:16:28,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2023-08-03 17:16:28,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:16:28,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2023-08-03 17:16:28,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:16:28,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:16:28,841 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:16:28,841 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 170 flow. Second operand 5 states and 693 transitions. [2023-08-03 17:16:28,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 286 flow [2023-08-03 17:16:28,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 65 transitions, 279 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:16:28,845 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 159 flow [2023-08-03 17:16:28,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-03 17:16:28,846 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-08-03 17:16:28,846 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 159 flow [2023-08-03 17:16:28,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:16:28,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:16:28,847 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:16:28,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 17:16:29,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:16:29,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:16:29,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:16:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1067820024, now seen corresponding path program 1 times [2023-08-03 17:16:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:16:29,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441095983] [2023-08-03 17:16:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:16:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:16:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:16:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:16:29,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:16:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441095983] [2023-08-03 17:16:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441095983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:16:29,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:16:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:16:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447450688] [2023-08-03 17:16:29,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:16:29,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:16:29,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:16:29,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:16:29,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:16:29,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 275 [2023-08-03 17:16:29,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:16:29,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:16:29,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 275 [2023-08-03 17:16:29,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:02,561 INFO L124 PetriNetUnfolderBase]: 335018/439559 cut-off events. [2023-08-03 17:17:02,561 INFO L125 PetriNetUnfolderBase]: For 5801/5801 co-relation queries the response was YES. [2023-08-03 17:17:03,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863659 conditions, 439559 events. 335018/439559 cut-off events. For 5801/5801 co-relation queries the response was YES. Maximal size of possible extension queue 13214. Compared 3179525 event pairs, 55274 based on Foata normal form. 0/390375 useless extension candidates. Maximal degree in co-relation 411149. Up to 383649 conditions per place. [2023-08-03 17:17:05,132 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 67 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2023-08-03 17:17:05,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 368 flow [2023-08-03 17:17:05,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:17:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:17:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-03 17:17:05,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.566060606060606 [2023-08-03 17:17:05,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-03 17:17:05,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-03 17:17:05,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:05,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-03 17:17:05,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:05,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:05,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:05,137 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 159 flow. Second operand 3 states and 467 transitions. [2023-08-03 17:17:05,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 368 flow [2023-08-03 17:17:05,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 83 transitions, 363 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:17:05,142 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 175 flow [2023-08-03 17:17:05,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, 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=175, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-08-03 17:17:05,143 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-08-03 17:17:05,143 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 175 flow [2023-08-03 17:17:05,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:05,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:05,144 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:17:05,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:17:05,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:17:05,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:05,144 INFO L85 PathProgramCache]: Analyzing trace with hash -316988416, now seen corresponding path program 1 times [2023-08-03 17:17:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:05,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961579248] [2023-08-03 17:17:05,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:17:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:05,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961579248] [2023-08-03 17:17:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961579248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:17:05,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:17:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:17:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910400940] [2023-08-03 17:17:05,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:17:05,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:17:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:05,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:17:05,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:17:05,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275 [2023-08-03 17:17:05,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 175 flow. Second operand has 3 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-03 17:17:05,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:05,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275 [2023-08-03 17:17:05,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:41,154 INFO L124 PetriNetUnfolderBase]: 326858/436807 cut-off events. [2023-08-03 17:17:41,154 INFO L125 PetriNetUnfolderBase]: For 32393/32393 co-relation queries the response was YES. [2023-08-03 17:17:42,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905672 conditions, 436807 events. 326858/436807 cut-off events. For 32393/32393 co-relation queries the response was YES. Maximal size of possible extension queue 13241. Compared 3244970 event pairs, 274810 based on Foata normal form. 0/385543 useless extension candidates. Maximal degree in co-relation 432909. Up to 406153 conditions per place. [2023-08-03 17:17:44,322 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 53 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-03 17:17:44,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 310 flow [2023-08-03 17:17:44,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:17:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:17:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-08-03 17:17:44,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-08-03 17:17:44,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-08-03 17:17:44,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-08-03 17:17:44,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:44,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-08-03 17:17:44,325 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-03 17:17:44,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:44,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:44,326 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 175 flow. Second operand 3 states and 440 transitions. [2023-08-03 17:17:44,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 310 flow [2023-08-03 17:17:44,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:17:44,329 INFO L231 Difference]: Finished difference. Result has 77 places, 58 transitions, 184 flow [2023-08-03 17:17:44,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=74, 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=184, PETRI_PLACES=77, PETRI_TRANSITIONS=58} [2023-08-03 17:17:44,330 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2023-08-03 17:17:44,330 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 58 transitions, 184 flow [2023-08-03 17:17:44,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-03 17:17:44,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:44,331 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:17:44,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:17:44,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:17:44,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1335264594, now seen corresponding path program 1 times [2023-08-03 17:17:44,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:44,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717284591] [2023-08-03 17:17:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:17:44,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:17:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:17:44,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:17:44,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:17:44,365 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:17:44,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:17:44,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:17:44,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:17:44,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:17:44,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:17:44,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:17:44,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:17:44,366 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:17:44,370 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:17:44,370 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:17:44,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:17:44 BasicIcfg [2023-08-03 17:17:44,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:17:44,429 INFO L158 Benchmark]: Toolchain (without parser) took 234964.18ms. Allocated memory was 532.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 490.1MB in the beginning and 9.9GB in the end (delta: -9.4GB). Peak memory consumption was 6.1GB. Max. memory is 16.0GB. [2023-08-03 17:17:44,429 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 354.4MB. Free memory is still 307.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:17:44,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.81ms. Allocated memory is still 532.7MB. Free memory was 489.7MB in the beginning and 466.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:17:44,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.77ms. Allocated memory is still 532.7MB. Free memory was 466.1MB in the beginning and 463.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:17:44,430 INFO L158 Benchmark]: Boogie Preprocessor took 27.91ms. Allocated memory is still 532.7MB. Free memory was 463.3MB in the beginning and 461.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:17:44,430 INFO L158 Benchmark]: RCFGBuilder took 592.28ms. Allocated memory is still 532.7MB. Free memory was 461.2MB in the beginning and 492.4MB in the end (delta: -31.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.0GB. [2023-08-03 17:17:44,430 INFO L158 Benchmark]: TraceAbstraction took 233753.32ms. Allocated memory was 532.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 491.4MB in the beginning and 9.9GB in the end (delta: -9.4GB). Peak memory consumption was 6.1GB. Max. memory is 16.0GB. [2023-08-03 17:17:44,432 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.10ms. Allocated memory is still 354.4MB. Free memory is still 307.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 542.81ms. Allocated memory is still 532.7MB. Free memory was 489.7MB in the beginning and 466.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.77ms. Allocated memory is still 532.7MB. Free memory was 466.1MB in the beginning and 463.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.91ms. Allocated memory is still 532.7MB. Free memory was 463.3MB in the beginning and 461.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 592.28ms. Allocated memory is still 532.7MB. Free memory was 461.2MB in the beginning and 492.4MB in the end (delta: -31.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.0GB. * TraceAbstraction took 233753.32ms. Allocated memory was 532.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 491.4MB in the beginning and 9.9GB in the end (delta: -9.4GB). Peak memory consumption was 6.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, 133 PlacesBefore, 42 PlacesAfterwards, 131 TransitionsBefore, 36 TransitionsAfterwards, 2806 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 111 TotalNumberOfCompositions, 7302 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3443, independent: 3269, independent conditional: 0, independent unconditional: 3269, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1480, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3443, independent: 1812, independent conditional: 0, independent unconditional: 1812, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 1480, unknown conditional: 0, unknown unconditional: 1480] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 165 PlacesBefore, 68 PlacesAfterwards, 157 TransitionsBefore, 56 TransitionsAfterwards, 6804 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 21239 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7950, independent: 7634, independent conditional: 0, independent unconditional: 7634, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3353, independent: 3286, independent conditional: 0, independent unconditional: 3286, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7950, independent: 4348, independent conditional: 0, independent unconditional: 4348, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 3353, unknown conditional: 0, unknown unconditional: 3353] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 350, Positive conditional cache size: 0, Positive unconditional cache size: 350, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515[2]; [L826] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t515[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515[asdf], ((void *)0), P0, ((void *)0))=-4, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L826] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t515[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515[asdf], ((void *)0), P0, ((void *)0))=-3, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L826] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L826] COND FALSE 0 !(asdf<2) [L827] 0 pthread_t t516[2]; [L828] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L828] COND TRUE 0 asdf<2 [L828] FCALL, FORK 0 pthread_create(&t516[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516[asdf], ((void *)0), P1, ((void *)0))=-2, t515={5:0}, t516={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 3 x$w_buff1 = x$w_buff0 [L766] 3 x$w_buff0 = 2 [L767] 3 x$w_buff1_used = x$w_buff0_used [L768] 3 x$w_buff0_used = (_Bool)1 [L769] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L769] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L828] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L828] COND TRUE 0 asdf<2 [L828] FCALL, FORK 0 pthread_create(&t516[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516[asdf], ((void *)0), P1, ((void *)0))=-1, t515={5:0}, t516={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 4 x$w_buff1 = x$w_buff0 [L766] 4 x$w_buff0 = 2 [L767] 4 x$w_buff1_used = x$w_buff0_used [L768] 4 x$w_buff0_used = (_Bool)1 [L769] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 179 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: 229.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 223.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 3 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 23/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 17:17:44,453 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...