/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:41:09,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:41:09,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:41:09,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:41:09,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:41:09,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:41:09,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:41:09,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:41:09,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:41:09,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:41:09,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:41:09,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:41:09,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:41:09,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:41:09,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:41:09,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:41:09,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:41:09,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:41:09,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:41:09,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:41:09,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:41:09,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:41:09,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:41:09,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:41:09,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:41:09,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:41:09,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:41:09,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:41:09,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:41:09,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:41:09,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:41:09,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:41:09,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:41:09,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:41:09,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:41:09,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:41:09,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:41:09,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:41:09,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:41:09,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:41:09,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:41:09,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-05 18:41:09,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:41:09,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:41:09,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:41:09,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:41:09,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:41:09,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:41:09,256 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:41:09,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:41:09,256 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:41:09,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:41:09,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:41:09,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:41:09,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:41:09,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:41:09,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:41:09,258 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:41:09,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:41:09,258 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:41:09,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:41:09,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:41:09,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:41:09,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:41:09,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:41:09,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:41:09,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:41:09,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:41:09,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:41:09,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:41:09,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:41:09,260 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:41:09,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:41:09,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-05 18:41:09,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:41:09,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:41:09,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:41:09,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:41:09,625 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:41:09,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:41:10,851 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:41:11,167 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:41:11,167 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:41:11,185 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1e2bb88/0a1179bea86942ee8e2c3ff3c9f139f9/FLAG0ba4ddf4c [2022-12-05 18:41:11,204 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1e2bb88/0a1179bea86942ee8e2c3ff3c9f139f9 [2022-12-05 18:41:11,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:41:11,208 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:41:11,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:41:11,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:41:11,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:41:11,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5981df35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11, skipping insertion in model container [2022-12-05 18:41:11,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:41:11,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:41:11,427 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 18:41:11,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:41:11,694 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:41:11,705 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 18:41:11,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:11,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:11,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:41:11,819 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:41:11,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11 WrapperNode [2022-12-05 18:41:11,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:41:11,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:41:11,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:41:11,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:41:11,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,899 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-12-05 18:41:11,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:41:11,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:41:11,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:41:11,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:41:11,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,937 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:41:11,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:41:11,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:41:11,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:41:11,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (1/1) ... [2022-12-05 18:41:11,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:41:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:41:11,990 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) [2022-12-05 18:41:12,005 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 [2022-12-05 18:41:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:41:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:41:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:41:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:41:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:41:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:41:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:41:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:41:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:41:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:41:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:41:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:41:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:41:12,042 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 18:41:12,204 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:41:12,206 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:41:12,465 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:41:12,634 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:41:12,635 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:41:12,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:41:12 BoogieIcfgContainer [2022-12-05 18:41:12,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:41:12,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:41:12,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:41:12,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:41:12,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:41:11" (1/3) ... [2022-12-05 18:41:12,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e88b5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:41:12, skipping insertion in model container [2022-12-05 18:41:12,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:11" (2/3) ... [2022-12-05 18:41:12,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e88b5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:41:12, skipping insertion in model container [2022-12-05 18:41:12,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:41:12" (3/3) ... [2022-12-05 18:41:12,648 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:41:12,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:41:12,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:41:12,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:41:12,718 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:41:12,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 18:41:12,806 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 18:41:12,807 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:41:12,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 18:41:12,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 18:41:12,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-05 18:41:12,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:41:12,839 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56e7dd58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:41:12,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 18:41:12,881 INFO L130 PetriNetUnfolder]: 0/51 cut-off events. [2022-12-05 18:41:12,881 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:41:12,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:12,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:12,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1149464573, now seen corresponding path program 1 times [2022-12-05 18:41:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:12,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744918375] [2022-12-05 18:41:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:13,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:13,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744918375] [2022-12-05 18:41:13,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744918375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:13,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:13,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:41:13,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043591644] [2022-12-05 18:41:13,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:13,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:41:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:41:13,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:41:13,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 86 [2022-12-05 18:41:13,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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) [2022-12-05 18:41:13,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:13,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 86 [2022-12-05 18:41:13,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:13,660 INFO L130 PetriNetUnfolder]: 17/149 cut-off events. [2022-12-05 18:41:13,661 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 18:41:13,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 149 events. 17/149 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 384 event pairs, 3 based on Foata normal form. 7/148 useless extension candidates. Maximal degree in co-relation 154. Up to 27 conditions per place. [2022-12-05 18:41:13,663 INFO L137 encePairwiseOnDemand]: 81/86 looper letters, 9 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-12-05 18:41:13,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 83 transitions, 194 flow [2022-12-05 18:41:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:41:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:41:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2022-12-05 18:41:13,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9224806201550387 [2022-12-05 18:41:13,679 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 174 flow. Second operand 3 states and 238 transitions. [2022-12-05 18:41:13,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 83 transitions, 194 flow [2022-12-05 18:41:13,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 83 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:41:13,686 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 168 flow [2022-12-05 18:41:13,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2022-12-05 18:41:13,692 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, -2 predicate places. [2022-12-05 18:41:13,692 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 168 flow [2022-12-05 18:41:13,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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) [2022-12-05 18:41:13,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:13,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:13,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:41:13,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 17765503, now seen corresponding path program 1 times [2022-12-05 18:41:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:13,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360785619] [2022-12-05 18:41:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:14,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360785619] [2022-12-05 18:41:14,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360785619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:14,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:14,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:41:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029714543] [2022-12-05 18:41:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:14,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:41:14,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:14,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:41:14,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:41:14,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 86 [2022-12-05 18:41:14,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 60.42857142857143) internal successors, (423), 7 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:14,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:14,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 86 [2022-12-05 18:41:14,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:15,194 INFO L130 PetriNetUnfolder]: 323/934 cut-off events. [2022-12-05 18:41:15,195 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-05 18:41:15,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 934 events. 323/934 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5774 event pairs, 73 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1515. Up to 290 conditions per place. [2022-12-05 18:41:15,209 INFO L137 encePairwiseOnDemand]: 76/86 looper letters, 29 selfloop transitions, 8 changer transitions 62/148 dead transitions. [2022-12-05 18:41:15,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 148 transitions, 504 flow [2022-12-05 18:41:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:41:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:41:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 849 transitions. [2022-12-05 18:41:15,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.759391771019678 [2022-12-05 18:41:15,219 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 168 flow. Second operand 13 states and 849 transitions. [2022-12-05 18:41:15,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 148 transitions, 504 flow [2022-12-05 18:41:15,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 148 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:41:15,226 INFO L231 Difference]: Finished difference. Result has 108 places, 78 transitions, 227 flow [2022-12-05 18:41:15,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=227, PETRI_PLACES=108, PETRI_TRANSITIONS=78} [2022-12-05 18:41:15,227 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 19 predicate places. [2022-12-05 18:41:15,228 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 78 transitions, 227 flow [2022-12-05 18:41:15,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 60.42857142857143) internal successors, (423), 7 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:15,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:15,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:15,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:41:15,229 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:15,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash -923096304, now seen corresponding path program 1 times [2022-12-05 18:41:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:15,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48216747] [2022-12-05 18:41:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:15,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:15,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48216747] [2022-12-05 18:41:15,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48216747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:15,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:15,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:41:15,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225669268] [2022-12-05 18:41:15,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:15,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:41:15,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:15,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:41:15,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:41:15,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2022-12-05 18:41:15,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 78 transitions, 227 flow. Second operand has 8 states, 8 states have (on average 66.5) internal successors, (532), 8 states have internal predecessors, (532), 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) [2022-12-05 18:41:15,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:15,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2022-12-05 18:41:15,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:16,198 INFO L130 PetriNetUnfolder]: 162/486 cut-off events. [2022-12-05 18:41:16,198 INFO L131 PetriNetUnfolder]: For 864/949 co-relation queries the response was YES. [2022-12-05 18:41:16,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 486 events. 162/486 cut-off events. For 864/949 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2511 event pairs, 55 based on Foata normal form. 31/501 useless extension candidates. Maximal degree in co-relation 1391. Up to 165 conditions per place. [2022-12-05 18:41:16,202 INFO L137 encePairwiseOnDemand]: 77/86 looper letters, 22 selfloop transitions, 14 changer transitions 27/122 dead transitions. [2022-12-05 18:41:16,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 122 transitions, 586 flow [2022-12-05 18:41:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:41:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:41:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 766 transitions. [2022-12-05 18:41:16,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8097251585623678 [2022-12-05 18:41:16,206 INFO L175 Difference]: Start difference. First operand has 108 places, 78 transitions, 227 flow. Second operand 11 states and 766 transitions. [2022-12-05 18:41:16,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 122 transitions, 586 flow [2022-12-05 18:41:16,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 122 transitions, 558 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-05 18:41:16,213 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 355 flow [2022-12-05 18:41:16,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=355, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2022-12-05 18:41:16,214 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 11 predicate places. [2022-12-05 18:41:16,214 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 355 flow [2022-12-05 18:41:16,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 66.5) internal successors, (532), 8 states have internal predecessors, (532), 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) [2022-12-05 18:41:16,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:16,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:16,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:41:16,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1732754367, now seen corresponding path program 1 times [2022-12-05 18:41:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:16,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181012930] [2022-12-05 18:41:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:16,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:16,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181012930] [2022-12-05 18:41:16,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181012930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:16,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:16,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:41:16,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490286222] [2022-12-05 18:41:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:16,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:41:16,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:41:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:41:16,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 86 [2022-12-05 18:41:16,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 355 flow. Second operand has 10 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 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) [2022-12-05 18:41:16,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:16,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 86 [2022-12-05 18:41:16,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:17,122 INFO L130 PetriNetUnfolder]: 133/428 cut-off events. [2022-12-05 18:41:17,122 INFO L131 PetriNetUnfolder]: For 1193/1268 co-relation queries the response was YES. [2022-12-05 18:41:17,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 428 events. 133/428 cut-off events. For 1193/1268 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2092 event pairs, 20 based on Foata normal form. 23/438 useless extension candidates. Maximal degree in co-relation 1431. Up to 184 conditions per place. [2022-12-05 18:41:17,129 INFO L137 encePairwiseOnDemand]: 76/86 looper letters, 35 selfloop transitions, 7 changer transitions 34/134 dead transitions. [2022-12-05 18:41:17,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 804 flow [2022-12-05 18:41:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 18:41:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 18:41:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1016 transitions. [2022-12-05 18:41:17,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7875968992248062 [2022-12-05 18:41:17,139 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 355 flow. Second operand 15 states and 1016 transitions. [2022-12-05 18:41:17,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 804 flow [2022-12-05 18:41:17,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 134 transitions, 762 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-05 18:41:17,149 INFO L231 Difference]: Finished difference. Result has 123 places, 92 transitions, 389 flow [2022-12-05 18:41:17,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=389, PETRI_PLACES=123, PETRI_TRANSITIONS=92} [2022-12-05 18:41:17,151 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 34 predicate places. [2022-12-05 18:41:17,151 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 92 transitions, 389 flow [2022-12-05 18:41:17,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 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) [2022-12-05 18:41:17,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:17,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:17,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:41:17,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:17,153 INFO L85 PathProgramCache]: Analyzing trace with hash -515165775, now seen corresponding path program 1 times [2022-12-05 18:41:17,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:17,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023681709] [2022-12-05 18:41:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:17,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:18,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023681709] [2022-12-05 18:41:18,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023681709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:18,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:18,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-05 18:41:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876016655] [2022-12-05 18:41:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:18,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 18:41:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 18:41:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-12-05 18:41:18,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 86 [2022-12-05 18:41:18,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 92 transitions, 389 flow. Second operand has 14 states, 14 states have (on average 62.285714285714285) internal successors, (872), 14 states have internal predecessors, (872), 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) [2022-12-05 18:41:18,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:18,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 86 [2022-12-05 18:41:18,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:18,368 INFO L130 PetriNetUnfolder]: 104/368 cut-off events. [2022-12-05 18:41:18,368 INFO L131 PetriNetUnfolder]: For 1739/1812 co-relation queries the response was YES. [2022-12-05 18:41:18,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 368 events. 104/368 cut-off events. For 1739/1812 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1701 event pairs, 20 based on Foata normal form. 14/368 useless extension candidates. Maximal degree in co-relation 1388. Up to 179 conditions per place. [2022-12-05 18:41:18,372 INFO L137 encePairwiseOnDemand]: 74/86 looper letters, 31 selfloop transitions, 10 changer transitions 17/113 dead transitions. [2022-12-05 18:41:18,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 113 transitions, 660 flow [2022-12-05 18:41:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 18:41:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 18:41:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 960 transitions. [2022-12-05 18:41:18,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2022-12-05 18:41:18,376 INFO L175 Difference]: Start difference. First operand has 123 places, 92 transitions, 389 flow. Second operand 15 states and 960 transitions. [2022-12-05 18:41:18,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 113 transitions, 660 flow [2022-12-05 18:41:18,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 595 flow, removed 27 selfloop flow, removed 12 redundant places. [2022-12-05 18:41:18,384 INFO L231 Difference]: Finished difference. Result has 123 places, 93 transitions, 393 flow [2022-12-05 18:41:18,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=393, PETRI_PLACES=123, PETRI_TRANSITIONS=93} [2022-12-05 18:41:18,385 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 34 predicate places. [2022-12-05 18:41:18,385 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 93 transitions, 393 flow [2022-12-05 18:41:18,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.285714285714285) internal successors, (872), 14 states have internal predecessors, (872), 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) [2022-12-05 18:41:18,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:18,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:18,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:41:18,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash -550980702, now seen corresponding path program 1 times [2022-12-05 18:41:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:18,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263018902] [2022-12-05 18:41:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263018902] [2022-12-05 18:41:18,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263018902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:18,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:18,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:41:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228769002] [2022-12-05 18:41:18,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:18,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:41:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:18,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:41:18,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:41:18,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 86 [2022-12-05 18:41:18,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 93 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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) [2022-12-05 18:41:18,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:18,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 86 [2022-12-05 18:41:18,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:18,809 INFO L130 PetriNetUnfolder]: 156/572 cut-off events. [2022-12-05 18:41:18,809 INFO L131 PetriNetUnfolder]: For 1916/2176 co-relation queries the response was YES. [2022-12-05 18:41:18,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 572 events. 156/572 cut-off events. For 1916/2176 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3507 event pairs, 35 based on Foata normal form. 9/561 useless extension candidates. Maximal degree in co-relation 2031. Up to 172 conditions per place. [2022-12-05 18:41:18,815 INFO L137 encePairwiseOnDemand]: 80/86 looper letters, 30 selfloop transitions, 4 changer transitions 44/137 dead transitions. [2022-12-05 18:41:18,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 908 flow [2022-12-05 18:41:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:41:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:41:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 641 transitions. [2022-12-05 18:41:18,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8281653746770026 [2022-12-05 18:41:18,818 INFO L175 Difference]: Start difference. First operand has 123 places, 93 transitions, 393 flow. Second operand 9 states and 641 transitions. [2022-12-05 18:41:18,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 908 flow [2022-12-05 18:41:18,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 137 transitions, 854 flow, removed 20 selfloop flow, removed 12 redundant places. [2022-12-05 18:41:18,827 INFO L231 Difference]: Finished difference. Result has 120 places, 85 transitions, 336 flow [2022-12-05 18:41:18,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=336, PETRI_PLACES=120, PETRI_TRANSITIONS=85} [2022-12-05 18:41:18,828 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2022-12-05 18:41:18,829 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 85 transitions, 336 flow [2022-12-05 18:41:18,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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) [2022-12-05 18:41:18,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:18,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:41:18,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash 815608065, now seen corresponding path program 1 times [2022-12-05 18:41:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:18,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56460431] [2022-12-05 18:41:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:19,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56460431] [2022-12-05 18:41:19,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56460431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:19,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:19,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:41:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013078642] [2022-12-05 18:41:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:41:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:41:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:41:19,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2022-12-05 18:41:19,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 85 transitions, 336 flow. Second operand has 8 states, 8 states have (on average 66.75) internal successors, (534), 8 states have internal predecessors, (534), 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) [2022-12-05 18:41:19,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:19,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2022-12-05 18:41:19,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:19,474 INFO L130 PetriNetUnfolder]: 133/421 cut-off events. [2022-12-05 18:41:19,474 INFO L131 PetriNetUnfolder]: For 1925/2187 co-relation queries the response was YES. [2022-12-05 18:41:19,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 421 events. 133/421 cut-off events. For 1925/2187 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2051 event pairs, 28 based on Foata normal form. 21/422 useless extension candidates. Maximal degree in co-relation 1660. Up to 190 conditions per place. [2022-12-05 18:41:19,480 INFO L137 encePairwiseOnDemand]: 76/86 looper letters, 28 selfloop transitions, 11 changer transitions 32/130 dead transitions. [2022-12-05 18:41:19,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 130 transitions, 901 flow [2022-12-05 18:41:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:41:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:41:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 765 transitions. [2022-12-05 18:41:19,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8086680761099366 [2022-12-05 18:41:19,482 INFO L175 Difference]: Start difference. First operand has 120 places, 85 transitions, 336 flow. Second operand 11 states and 765 transitions. [2022-12-05 18:41:19,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 130 transitions, 901 flow [2022-12-05 18:41:19,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 130 transitions, 810 flow, removed 42 selfloop flow, removed 11 redundant places. [2022-12-05 18:41:19,490 INFO L231 Difference]: Finished difference. Result has 115 places, 92 transitions, 456 flow [2022-12-05 18:41:19,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=456, PETRI_PLACES=115, PETRI_TRANSITIONS=92} [2022-12-05 18:41:19,491 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2022-12-05 18:41:19,491 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 92 transitions, 456 flow [2022-12-05 18:41:19,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 66.75) internal successors, (534), 8 states have internal predecessors, (534), 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) [2022-12-05 18:41:19,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:19,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:19,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:41:19,492 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -579521867, now seen corresponding path program 2 times [2022-12-05 18:41:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549235092] [2022-12-05 18:41:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:20,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:20,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549235092] [2022-12-05 18:41:20,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549235092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:20,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:20,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:41:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215388355] [2022-12-05 18:41:20,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:20,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:41:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:41:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:41:20,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 86 [2022-12-05 18:41:20,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 92 transitions, 456 flow. Second operand has 11 states, 11 states have (on average 59.81818181818182) internal successors, (658), 11 states have internal predecessors, (658), 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) [2022-12-05 18:41:20,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:20,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 86 [2022-12-05 18:41:20,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:20,680 INFO L130 PetriNetUnfolder]: 122/464 cut-off events. [2022-12-05 18:41:20,680 INFO L131 PetriNetUnfolder]: For 2282/2676 co-relation queries the response was YES. [2022-12-05 18:41:20,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 464 events. 122/464 cut-off events. For 2282/2676 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2506 event pairs, 13 based on Foata normal form. 28/476 useless extension candidates. Maximal degree in co-relation 1908. Up to 145 conditions per place. [2022-12-05 18:41:20,684 INFO L137 encePairwiseOnDemand]: 72/86 looper letters, 30 selfloop transitions, 27 changer transitions 35/141 dead transitions. [2022-12-05 18:41:20,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 141 transitions, 1158 flow [2022-12-05 18:41:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:41:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:41:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 882 transitions. [2022-12-05 18:41:20,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2022-12-05 18:41:20,687 INFO L175 Difference]: Start difference. First operand has 115 places, 92 transitions, 456 flow. Second operand 14 states and 882 transitions. [2022-12-05 18:41:20,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 141 transitions, 1158 flow [2022-12-05 18:41:20,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 141 transitions, 1127 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-05 18:41:20,696 INFO L231 Difference]: Finished difference. Result has 125 places, 96 transitions, 568 flow [2022-12-05 18:41:20,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=568, PETRI_PLACES=125, PETRI_TRANSITIONS=96} [2022-12-05 18:41:20,697 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 36 predicate places. [2022-12-05 18:41:20,697 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 96 transitions, 568 flow [2022-12-05 18:41:20,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 59.81818181818182) internal successors, (658), 11 states have internal predecessors, (658), 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) [2022-12-05 18:41:20,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:20,698 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:20,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:41:20,698 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:20,699 INFO L85 PathProgramCache]: Analyzing trace with hash 278082879, now seen corresponding path program 1 times [2022-12-05 18:41:20,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:20,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645594148] [2022-12-05 18:41:20,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:20,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645594148] [2022-12-05 18:41:21,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645594148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:21,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:21,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-05 18:41:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122903212] [2022-12-05 18:41:21,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:21,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 18:41:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 18:41:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-05 18:41:21,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 86 [2022-12-05 18:41:21,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 96 transitions, 568 flow. Second operand has 15 states, 15 states have (on average 55.53333333333333) internal successors, (833), 15 states have internal predecessors, (833), 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) [2022-12-05 18:41:21,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:21,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 86 [2022-12-05 18:41:21,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:22,659 INFO L130 PetriNetUnfolder]: 330/898 cut-off events. [2022-12-05 18:41:22,659 INFO L131 PetriNetUnfolder]: For 6272/6438 co-relation queries the response was YES. [2022-12-05 18:41:22,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 898 events. 330/898 cut-off events. For 6272/6438 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5600 event pairs, 25 based on Foata normal form. 26/920 useless extension candidates. Maximal degree in co-relation 3805. Up to 278 conditions per place. [2022-12-05 18:41:22,667 INFO L137 encePairwiseOnDemand]: 67/86 looper letters, 70 selfloop transitions, 30 changer transitions 69/214 dead transitions. [2022-12-05 18:41:22,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 214 transitions, 2007 flow [2022-12-05 18:41:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-05 18:41:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-05 18:41:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1713 transitions. [2022-12-05 18:41:22,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6868484362469928 [2022-12-05 18:41:22,672 INFO L175 Difference]: Start difference. First operand has 125 places, 96 transitions, 568 flow. Second operand 29 states and 1713 transitions. [2022-12-05 18:41:22,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 214 transitions, 2007 flow [2022-12-05 18:41:22,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 214 transitions, 1736 flow, removed 127 selfloop flow, removed 11 redundant places. [2022-12-05 18:41:22,690 INFO L231 Difference]: Finished difference. Result has 158 places, 108 transitions, 756 flow [2022-12-05 18:41:22,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=756, PETRI_PLACES=158, PETRI_TRANSITIONS=108} [2022-12-05 18:41:22,691 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 69 predicate places. [2022-12-05 18:41:22,691 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 108 transitions, 756 flow [2022-12-05 18:41:22,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 55.53333333333333) internal successors, (833), 15 states have internal predecessors, (833), 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) [2022-12-05 18:41:22,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:22,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:22,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:41:22,692 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash 105479983, now seen corresponding path program 2 times [2022-12-05 18:41:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:22,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663027449] [2022-12-05 18:41:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:23,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:23,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663027449] [2022-12-05 18:41:23,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663027449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:23,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:23,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:41:23,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251620761] [2022-12-05 18:41:23,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:23,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:41:23,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:23,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:41:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:41:23,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 86 [2022-12-05 18:41:23,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 108 transitions, 756 flow. Second operand has 13 states, 13 states have (on average 53.92307692307692) internal successors, (701), 13 states have internal predecessors, (701), 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) [2022-12-05 18:41:23,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:23,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 86 [2022-12-05 18:41:23,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:24,636 INFO L130 PetriNetUnfolder]: 323/921 cut-off events. [2022-12-05 18:41:24,637 INFO L131 PetriNetUnfolder]: For 7334/7543 co-relation queries the response was YES. [2022-12-05 18:41:24,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 921 events. 323/921 cut-off events. For 7334/7543 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5879 event pairs, 26 based on Foata normal form. 45/957 useless extension candidates. Maximal degree in co-relation 4372. Up to 269 conditions per place. [2022-12-05 18:41:24,646 INFO L137 encePairwiseOnDemand]: 68/86 looper letters, 70 selfloop transitions, 34 changer transitions 67/214 dead transitions. [2022-12-05 18:41:24,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 214 transitions, 2310 flow [2022-12-05 18:41:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 18:41:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 18:41:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1437 transitions. [2022-12-05 18:41:24,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6683720930232558 [2022-12-05 18:41:24,650 INFO L175 Difference]: Start difference. First operand has 158 places, 108 transitions, 756 flow. Second operand 25 states and 1437 transitions. [2022-12-05 18:41:24,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 214 transitions, 2310 flow [2022-12-05 18:41:24,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 214 transitions, 2074 flow, removed 111 selfloop flow, removed 18 redundant places. [2022-12-05 18:41:24,673 INFO L231 Difference]: Finished difference. Result has 166 places, 114 transitions, 913 flow [2022-12-05 18:41:24,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=913, PETRI_PLACES=166, PETRI_TRANSITIONS=114} [2022-12-05 18:41:24,675 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 77 predicate places. [2022-12-05 18:41:24,675 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 114 transitions, 913 flow [2022-12-05 18:41:24,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 53.92307692307692) internal successors, (701), 13 states have internal predecessors, (701), 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) [2022-12-05 18:41:24,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:24,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:24,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:41:24,678 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1857468049, now seen corresponding path program 3 times [2022-12-05 18:41:24,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:24,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617352124] [2022-12-05 18:41:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:25,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:25,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617352124] [2022-12-05 18:41:25,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617352124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:25,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:25,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:41:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183603290] [2022-12-05 18:41:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:25,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:41:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:41:25,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:41:25,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 86 [2022-12-05 18:41:25,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 114 transitions, 913 flow. Second operand has 13 states, 13 states have (on average 61.53846153846154) internal successors, (800), 13 states have internal predecessors, (800), 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) [2022-12-05 18:41:25,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:25,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 86 [2022-12-05 18:41:25,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:25,604 INFO L130 PetriNetUnfolder]: 105/417 cut-off events. [2022-12-05 18:41:25,604 INFO L131 PetriNetUnfolder]: For 4840/5905 co-relation queries the response was YES. [2022-12-05 18:41:25,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 417 events. 105/417 cut-off events. For 4840/5905 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2175 event pairs, 27 based on Foata normal form. 61/461 useless extension candidates. Maximal degree in co-relation 2337. Up to 160 conditions per place. [2022-12-05 18:41:25,609 INFO L137 encePairwiseOnDemand]: 73/86 looper letters, 36 selfloop transitions, 12 changer transitions 22/136 dead transitions. [2022-12-05 18:41:25,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 136 transitions, 1442 flow [2022-12-05 18:41:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:41:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:41:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 882 transitions. [2022-12-05 18:41:25,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2022-12-05 18:41:25,612 INFO L175 Difference]: Start difference. First operand has 166 places, 114 transitions, 913 flow. Second operand 14 states and 882 transitions. [2022-12-05 18:41:25,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 136 transitions, 1442 flow [2022-12-05 18:41:25,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 136 transitions, 1297 flow, removed 51 selfloop flow, removed 21 redundant places. [2022-12-05 18:41:25,630 INFO L231 Difference]: Finished difference. Result has 152 places, 111 transitions, 847 flow [2022-12-05 18:41:25,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=847, PETRI_PLACES=152, PETRI_TRANSITIONS=111} [2022-12-05 18:41:25,631 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 63 predicate places. [2022-12-05 18:41:25,631 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 111 transitions, 847 flow [2022-12-05 18:41:25,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 61.53846153846154) internal successors, (800), 13 states have internal predecessors, (800), 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) [2022-12-05 18:41:25,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:25,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:25,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:41:25,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2042199445, now seen corresponding path program 4 times [2022-12-05 18:41:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:25,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665804931] [2022-12-05 18:41:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:26,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665804931] [2022-12-05 18:41:26,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665804931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:26,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:26,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:41:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249837316] [2022-12-05 18:41:26,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:26,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:41:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:26,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:41:26,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:41:26,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 86 [2022-12-05 18:41:26,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 111 transitions, 847 flow. Second operand has 13 states, 13 states have (on average 57.76923076923077) internal successors, (751), 13 states have internal predecessors, (751), 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) [2022-12-05 18:41:26,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:26,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 86 [2022-12-05 18:41:26,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:26,946 INFO L130 PetriNetUnfolder]: 121/447 cut-off events. [2022-12-05 18:41:26,946 INFO L131 PetriNetUnfolder]: For 4770/5676 co-relation queries the response was YES. [2022-12-05 18:41:26,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2656 conditions, 447 events. 121/447 cut-off events. For 4770/5676 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2326 event pairs, 23 based on Foata normal form. 42/472 useless extension candidates. Maximal degree in co-relation 2551. Up to 138 conditions per place. [2022-12-05 18:41:26,952 INFO L137 encePairwiseOnDemand]: 71/86 looper letters, 34 selfloop transitions, 31 changer transitions 30/146 dead transitions. [2022-12-05 18:41:26,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 146 transitions, 1658 flow [2022-12-05 18:41:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 18:41:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 18:41:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 958 transitions. [2022-12-05 18:41:26,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6962209302325582 [2022-12-05 18:41:26,954 INFO L175 Difference]: Start difference. First operand has 152 places, 111 transitions, 847 flow. Second operand 16 states and 958 transitions. [2022-12-05 18:41:26,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 146 transitions, 1658 flow [2022-12-05 18:41:26,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 1458 flow, removed 88 selfloop flow, removed 13 redundant places. [2022-12-05 18:41:26,972 INFO L231 Difference]: Finished difference. Result has 152 places, 108 transitions, 820 flow [2022-12-05 18:41:26,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=820, PETRI_PLACES=152, PETRI_TRANSITIONS=108} [2022-12-05 18:41:26,973 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 63 predicate places. [2022-12-05 18:41:26,974 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 108 transitions, 820 flow [2022-12-05 18:41:26,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.76923076923077) internal successors, (751), 13 states have internal predecessors, (751), 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) [2022-12-05 18:41:26,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:26,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:26,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:41:26,975 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1727318281, now seen corresponding path program 5 times [2022-12-05 18:41:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:26,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258267464] [2022-12-05 18:41:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:27,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:27,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258267464] [2022-12-05 18:41:27,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258267464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:27,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:27,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:41:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863033224] [2022-12-05 18:41:27,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:27,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:41:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:41:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:41:27,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 86 [2022-12-05 18:41:27,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 108 transitions, 820 flow. Second operand has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 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) [2022-12-05 18:41:27,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:27,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 86 [2022-12-05 18:41:27,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:27,925 INFO L130 PetriNetUnfolder]: 107/487 cut-off events. [2022-12-05 18:41:27,925 INFO L131 PetriNetUnfolder]: For 3747/4938 co-relation queries the response was YES. [2022-12-05 18:41:27,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 487 events. 107/487 cut-off events. For 3747/4938 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2879 event pairs, 17 based on Foata normal form. 30/498 useless extension candidates. Maximal degree in co-relation 2376. Up to 91 conditions per place. [2022-12-05 18:41:27,931 INFO L137 encePairwiseOnDemand]: 75/86 looper letters, 37 selfloop transitions, 19 changer transitions 40/149 dead transitions. [2022-12-05 18:41:27,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 149 transitions, 1652 flow [2022-12-05 18:41:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:41:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:41:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 823 transitions. [2022-12-05 18:41:27,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7361359570661896 [2022-12-05 18:41:27,933 INFO L175 Difference]: Start difference. First operand has 152 places, 108 transitions, 820 flow. Second operand 13 states and 823 transitions. [2022-12-05 18:41:27,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 149 transitions, 1652 flow [2022-12-05 18:41:27,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 149 transitions, 1464 flow, removed 43 selfloop flow, removed 18 redundant places. [2022-12-05 18:41:27,949 INFO L231 Difference]: Finished difference. Result has 145 places, 99 transitions, 670 flow [2022-12-05 18:41:27,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=670, PETRI_PLACES=145, PETRI_TRANSITIONS=99} [2022-12-05 18:41:27,950 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 56 predicate places. [2022-12-05 18:41:27,950 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 99 transitions, 670 flow [2022-12-05 18:41:27,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 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) [2022-12-05 18:41:27,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:27,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:27,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:41:27,952 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1258290077, now seen corresponding path program 1 times [2022-12-05 18:41:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:27,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482766487] [2022-12-05 18:41:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:28,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482766487] [2022-12-05 18:41:28,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482766487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:28,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:28,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:41:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967485811] [2022-12-05 18:41:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:28,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:41:28,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:28,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:41:28,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:41:28,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2022-12-05 18:41:28,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 99 transitions, 670 flow. Second operand has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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) [2022-12-05 18:41:28,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:28,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2022-12-05 18:41:28,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:28,345 INFO L130 PetriNetUnfolder]: 209/673 cut-off events. [2022-12-05 18:41:28,345 INFO L131 PetriNetUnfolder]: For 4647/4743 co-relation queries the response was YES. [2022-12-05 18:41:28,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 673 events. 209/673 cut-off events. For 4647/4743 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4100 event pairs, 19 based on Foata normal form. 58/713 useless extension candidates. Maximal degree in co-relation 2728. Up to 147 conditions per place. [2022-12-05 18:41:28,350 INFO L137 encePairwiseOnDemand]: 77/86 looper letters, 30 selfloop transitions, 6 changer transitions 53/149 dead transitions. [2022-12-05 18:41:28,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 149 transitions, 1373 flow [2022-12-05 18:41:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:41:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:41:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 714 transitions. [2022-12-05 18:41:28,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8302325581395349 [2022-12-05 18:41:28,354 INFO L175 Difference]: Start difference. First operand has 145 places, 99 transitions, 670 flow. Second operand 10 states and 714 transitions. [2022-12-05 18:41:28,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 149 transitions, 1373 flow [2022-12-05 18:41:28,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 149 transitions, 1255 flow, removed 15 selfloop flow, removed 19 redundant places. [2022-12-05 18:41:28,366 INFO L231 Difference]: Finished difference. Result has 135 places, 87 transitions, 484 flow [2022-12-05 18:41:28,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=484, PETRI_PLACES=135, PETRI_TRANSITIONS=87} [2022-12-05 18:41:28,367 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 46 predicate places. [2022-12-05 18:41:28,368 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 87 transitions, 484 flow [2022-12-05 18:41:28,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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) [2022-12-05 18:41:28,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:28,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:28,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:41:28,369 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1062872578, now seen corresponding path program 1 times [2022-12-05 18:41:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:28,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517346647] [2022-12-05 18:41:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:28,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517346647] [2022-12-05 18:41:28,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517346647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:28,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:28,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:41:28,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444917798] [2022-12-05 18:41:28,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:28,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:41:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:41:28,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:41:28,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 86 [2022-12-05 18:41:28,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 87 transitions, 484 flow. Second operand has 13 states, 13 states have (on average 62.46153846153846) internal successors, (812), 13 states have internal predecessors, (812), 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) [2022-12-05 18:41:28,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:28,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 86 [2022-12-05 18:41:28,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:29,178 INFO L130 PetriNetUnfolder]: 31/255 cut-off events. [2022-12-05 18:41:29,178 INFO L131 PetriNetUnfolder]: For 973/981 co-relation queries the response was YES. [2022-12-05 18:41:29,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 255 events. 31/255 cut-off events. For 973/981 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1027 event pairs, 14 based on Foata normal form. 3/253 useless extension candidates. Maximal degree in co-relation 900. Up to 71 conditions per place. [2022-12-05 18:41:29,180 INFO L137 encePairwiseOnDemand]: 75/86 looper letters, 20 selfloop transitions, 5 changer transitions 20/99 dead transitions. [2022-12-05 18:41:29,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 99 transitions, 690 flow [2022-12-05 18:41:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:41:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:41:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 893 transitions. [2022-12-05 18:41:29,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7416943521594684 [2022-12-05 18:41:29,182 INFO L175 Difference]: Start difference. First operand has 135 places, 87 transitions, 484 flow. Second operand 14 states and 893 transitions. [2022-12-05 18:41:29,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 99 transitions, 690 flow [2022-12-05 18:41:29,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 99 transitions, 645 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-12-05 18:41:29,188 INFO L231 Difference]: Finished difference. Result has 139 places, 79 transitions, 392 flow [2022-12-05 18:41:29,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=392, PETRI_PLACES=139, PETRI_TRANSITIONS=79} [2022-12-05 18:41:29,189 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 50 predicate places. [2022-12-05 18:41:29,189 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 79 transitions, 392 flow [2022-12-05 18:41:29,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.46153846153846) internal successors, (812), 13 states have internal predecessors, (812), 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) [2022-12-05 18:41:29,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:29,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:29,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 18:41:29,190 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:29,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash -178411094, now seen corresponding path program 1 times [2022-12-05 18:41:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:29,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389944660] [2022-12-05 18:41:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:29,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:29,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:29,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389944660] [2022-12-05 18:41:29,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389944660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:29,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:29,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:41:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383868561] [2022-12-05 18:41:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:29,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:41:29,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:29,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:41:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:41:29,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2022-12-05 18:41:29,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 79 transitions, 392 flow. Second operand has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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) [2022-12-05 18:41:29,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:29,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2022-12-05 18:41:29,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:29,489 INFO L130 PetriNetUnfolder]: 33/196 cut-off events. [2022-12-05 18:41:29,489 INFO L131 PetriNetUnfolder]: For 709/713 co-relation queries the response was YES. [2022-12-05 18:41:29,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 196 events. 33/196 cut-off events. For 709/713 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 676 event pairs, 0 based on Foata normal form. 14/210 useless extension candidates. Maximal degree in co-relation 607. Up to 26 conditions per place. [2022-12-05 18:41:29,490 INFO L137 encePairwiseOnDemand]: 78/86 looper letters, 15 selfloop transitions, 7 changer transitions 22/99 dead transitions. [2022-12-05 18:41:29,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 99 transitions, 660 flow [2022-12-05 18:41:29,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:41:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:41:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 687 transitions. [2022-12-05 18:41:29,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7988372093023256 [2022-12-05 18:41:29,492 INFO L175 Difference]: Start difference. First operand has 139 places, 79 transitions, 392 flow. Second operand 10 states and 687 transitions. [2022-12-05 18:41:29,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 99 transitions, 660 flow [2022-12-05 18:41:29,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 483 flow, removed 59 selfloop flow, removed 31 redundant places. [2022-12-05 18:41:29,496 INFO L231 Difference]: Finished difference. Result has 110 places, 75 transitions, 264 flow [2022-12-05 18:41:29,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=264, PETRI_PLACES=110, PETRI_TRANSITIONS=75} [2022-12-05 18:41:29,497 INFO L294 CegarLoopForPetriNet]: 89 programPoint places, 21 predicate places. [2022-12-05 18:41:29,497 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 75 transitions, 264 flow [2022-12-05 18:41:29,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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) [2022-12-05 18:41:29,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:29,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:29,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 18:41:29,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:41:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash 200836588, now seen corresponding path program 1 times [2022-12-05 18:41:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:29,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666937736] [2022-12-05 18:41:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:41:29,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:41:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:41:29,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:41:29,608 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:41:29,609 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 18:41:29,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 18:41:29,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 18:41:29,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 18:41:29,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 18:41:29,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 18:41:29,614 INFO L458 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:29,621 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:41:29,621 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:41:29,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:41:29 BasicIcfg [2022-12-05 18:41:29,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:41:29,713 INFO L158 Benchmark]: Toolchain (without parser) took 18504.53ms. Allocated memory was 187.7MB in the beginning and 568.3MB in the end (delta: 380.6MB). Free memory was 162.8MB in the beginning and 484.0MB in the end (delta: -321.2MB). Peak memory consumption was 60.0MB. Max. memory is 8.0GB. [2022-12-05 18:41:29,713 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 187.7MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:41:29,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.12ms. Allocated memory is still 187.7MB. Free memory was 162.8MB in the beginning and 138.2MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-05 18:41:29,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.47ms. Allocated memory is still 187.7MB. Free memory was 138.2MB in the beginning and 135.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 18:41:29,713 INFO L158 Benchmark]: Boogie Preprocessor took 40.91ms. Allocated memory is still 187.7MB. Free memory was 135.6MB in the beginning and 133.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:41:29,713 INFO L158 Benchmark]: RCFGBuilder took 697.94ms. Allocated memory is still 187.7MB. Free memory was 133.5MB in the beginning and 102.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-05 18:41:29,714 INFO L158 Benchmark]: TraceAbstraction took 17070.29ms. Allocated memory was 187.7MB in the beginning and 568.3MB in the end (delta: 380.6MB). Free memory was 102.0MB in the beginning and 484.0MB in the end (delta: -382.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:41:29,715 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 187.7MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 609.12ms. Allocated memory is still 187.7MB. Free memory was 162.8MB in the beginning and 138.2MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.47ms. Allocated memory is still 187.7MB. Free memory was 138.2MB in the beginning and 135.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.91ms. Allocated memory is still 187.7MB. Free memory was 135.6MB in the beginning and 133.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 697.94ms. Allocated memory is still 187.7MB. Free memory was 133.5MB in the beginning and 102.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 17070.29ms. Allocated memory was 187.7MB in the beginning and 568.3MB in the end (delta: 380.6MB). Free memory was 102.0MB in the beginning and 484.0MB in the end (delta: -382.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0: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=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0: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=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0: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=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0: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=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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 5 procedures, 104 locations, 5 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: 16.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 990 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 990 mSDsluCounter, 1274 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1054 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2180 IncrementalHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 220 mSDtfsCounter, 2180 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=913occurred in iteration=10, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 956 ConstructedInterpolants, 0 QuantifiedInterpolants, 6914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 18:41:29,738 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...