/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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:05:54,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:05:54,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:05:54,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:05:54,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:05:54,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:05:54,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:05:54,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:05:54,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:05:54,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:05:54,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:05:54,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:05:54,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:05:54,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:05:54,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:05:54,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:05:54,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:05:54,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:05:54,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:05:54,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:05:54,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:05:54,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:05:54,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:05:54,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:05:54,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:05:54,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:05:54,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:05:54,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:05:54,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:05:54,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:05:54,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:05:54,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:05:54,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:05:54,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:05:54,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:05:54,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:05:54,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:05:54,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:05:54,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:05:54,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:05:54,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:05:54,233 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-11 19:05:54,265 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:05:54,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:05:54,267 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:05:54,267 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:05:54,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:05:54,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:05:54,269 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:05:54,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:05:54,269 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:05:54,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:05:54,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:05:54,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:05:54,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:05:54,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:05:54,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:05:54,271 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:05:54,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:05:54,271 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:05:54,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:05:54,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:05:54,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:05:54,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:05:54,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:05:54,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:05:54,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:05:54,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:05:54,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:05:54,272 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:05:54,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:05:54,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:05:54,273 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:05:54,273 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-11 19:05:54,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:05:54,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:05:54,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:05:54,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:05:54,647 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:05:54,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 19:05:55,723 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:05:55,987 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:05:55,987 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 19:05:56,005 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c162251/c2d7e72d334a41b18bffdaaeff2e7a65/FLAGfe882a8a0 [2022-12-11 19:05:56,020 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c162251/c2d7e72d334a41b18bffdaaeff2e7a65 [2022-12-11 19:05:56,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:05:56,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:05:56,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:05:56,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:05:56,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:05:56,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d5ceab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56, skipping insertion in model container [2022-12-11 19:05:56,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:05:56,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:05:56,261 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-11 19:05:56,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:05:56,495 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:05:56,508 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-11 19:05:56,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:05:56,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:05:56,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:05:56,607 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:05:56,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56 WrapperNode [2022-12-11 19:05:56,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:05:56,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:05:56,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:05:56,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:05:56,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,660 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-11 19:05:56,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:05:56,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:05:56,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:05:56,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:05:56,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,683 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:05:56,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:05:56,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:05:56,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:05:56,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (1/1) ... [2022-12-11 19:05:56,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:05:56,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:05:56,728 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-11 19:05:56,747 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-11 19:05:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:05:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 19:05:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:05:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:05:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:05:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 19:05:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 19:05:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 19:05:56,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 19:05:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:05:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 19:05:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:05:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:05:56,779 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 19:05:56,958 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:05:56,959 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:05:57,199 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:05:57,354 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:05:57,355 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 19:05:57,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:05:57 BoogieIcfgContainer [2022-12-11 19:05:57,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:05:57,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:05:57,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:05:57,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:05:57,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:05:56" (1/3) ... [2022-12-11 19:05:57,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563345dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:05:57, skipping insertion in model container [2022-12-11 19:05:57,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:05:56" (2/3) ... [2022-12-11 19:05:57,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563345dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:05:57, skipping insertion in model container [2022-12-11 19:05:57,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:05:57" (3/3) ... [2022-12-11 19:05:57,365 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 19:05:57,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:05:57,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 19:05:57,382 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:05:57,429 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 19:05:57,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-11 19:05:57,518 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-11 19:05:57,518 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 19:05:57,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 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/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-11 19:05:57,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-11 19:05:57,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-11 19:05:57,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:05:57,547 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;@7c589a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:05:57,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-11 19:05:57,570 INFO L130 PetriNetUnfolder]: 0/52 cut-off events. [2022-12-11 19:05:57,570 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 19:05:57,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:05:57,571 INFO L214 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] [2022-12-11 19:05:57,572 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-11 19:05:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:05:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1361376925, now seen corresponding path program 1 times [2022-12-11 19:05:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:05:57,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953545359] [2022-12-11 19:05:57,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:05:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:05:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:05:58,110 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-11 19:05:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:05:58,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953545359] [2022-12-11 19:05:58,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953545359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:05:58,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:05:58,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 19:05:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879918654] [2022-12-11 19:05:58,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:05:58,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:05:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:05:58,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:05:58,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:05:58,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 87 [2022-12-11 19:05:58,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-11 19:05:58,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:05:58,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 87 [2022-12-11 19:05:58,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:05:58,233 INFO L130 PetriNetUnfolder]: 17/150 cut-off events. [2022-12-11 19:05:58,233 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 19:05:58,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 150 events. 17/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 3 based on Foata normal form. 7/149 useless extension candidates. Maximal degree in co-relation 154. Up to 27 conditions per place. [2022-12-11 19:05:58,235 INFO L137 encePairwiseOnDemand]: 82/87 looper letters, 9 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2022-12-11 19:05:58,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 196 flow [2022-12-11 19:05:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:05:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:05:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2022-12-11 19:05:58,250 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9233716475095786 [2022-12-11 19:05:58,252 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 176 flow. Second operand 3 states and 241 transitions. [2022-12-11 19:05:58,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 196 flow [2022-12-11 19:05:58,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:05:58,257 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 170 flow [2022-12-11 19:05:58,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2022-12-11 19:05:58,263 INFO L295 CegarLoopForPetriNet]: 90 programPoint places, -2 predicate places. [2022-12-11 19:05:58,264 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 170 flow [2022-12-11 19:05:58,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-11 19:05:58,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:05:58,265 INFO L214 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] [2022-12-11 19:05:58,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:05:58,265 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-11 19:05:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:05:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -700214868, now seen corresponding path program 1 times [2022-12-11 19:05:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:05:58,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022128910] [2022-12-11 19:05:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:05:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:05:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:05:59,446 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-11 19:05:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:05:59,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022128910] [2022-12-11 19:05:59,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022128910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:05:59,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:05:59,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:05:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277055934] [2022-12-11 19:05:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:05:59,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:05:59,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:05:59,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:05:59,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:05:59,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 87 [2022-12-11 19:05:59,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 170 flow. Second operand has 10 states, 10 states have (on average 61.7) internal successors, (617), 10 states have internal predecessors, (617), 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-11 19:05:59,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:05:59,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 87 [2022-12-11 19:05:59,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:06:00,112 INFO L130 PetriNetUnfolder]: 195/642 cut-off events. [2022-12-11 19:06:00,113 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-11 19:06:00,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 642 events. 195/642 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3661 event pairs, 35 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 996. Up to 208 conditions per place. [2022-12-11 19:06:00,119 INFO L137 encePairwiseOnDemand]: 74/87 looper letters, 22 selfloop transitions, 13 changer transitions 62/148 dead transitions. [2022-12-11 19:06:00,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 148 transitions, 510 flow [2022-12-11 19:06:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 19:06:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 19:06:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1234 transitions. [2022-12-11 19:06:00,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7465214761040533 [2022-12-11 19:06:00,129 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 170 flow. Second operand 19 states and 1234 transitions. [2022-12-11 19:06:00,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 148 transitions, 510 flow [2022-12-11 19:06:00,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 148 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:06:00,134 INFO L231 Difference]: Finished difference. Result has 119 places, 82 transitions, 262 flow [2022-12-11 19:06:00,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=262, PETRI_PLACES=119, PETRI_TRANSITIONS=82} [2022-12-11 19:06:00,135 INFO L295 CegarLoopForPetriNet]: 90 programPoint places, 29 predicate places. [2022-12-11 19:06:00,135 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 82 transitions, 262 flow [2022-12-11 19:06:00,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.7) internal successors, (617), 10 states have internal predecessors, (617), 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-11 19:06:00,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:06:00,136 INFO L214 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-11 19:06:00,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 19:06:00,136 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-11 19:06:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:06:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash -161608982, now seen corresponding path program 1 times [2022-12-11 19:06:00,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:06:00,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118906540] [2022-12-11 19:06:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:06:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:06:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:06:00,772 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-11 19:06:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:06:00,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118906540] [2022-12-11 19:06:00,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118906540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:06:00,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:06:00,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:06:00,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068251609] [2022-12-11 19:06:00,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:06:00,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:06:00,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:06:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:06:00,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:06:00,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 87 [2022-12-11 19:06:00,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 82 transitions, 262 flow. Second operand has 10 states, 10 states have (on average 66.4) internal successors, (664), 10 states have internal predecessors, (664), 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-11 19:06:00,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:06:00,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 87 [2022-12-11 19:06:00,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:06:01,033 INFO L130 PetriNetUnfolder]: 84/277 cut-off events. [2022-12-11 19:06:01,034 INFO L131 PetriNetUnfolder]: For 729/790 co-relation queries the response was YES. [2022-12-11 19:06:01,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 277 events. 84/277 cut-off events. For 729/790 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1170 event pairs, 16 based on Foata normal form. 11/281 useless extension candidates. Maximal degree in co-relation 865. Up to 114 conditions per place. [2022-12-11 19:06:01,036 INFO L137 encePairwiseOnDemand]: 76/87 looper letters, 19 selfloop transitions, 10 changer transitions 23/108 dead transitions. [2022-12-11 19:06:01,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 556 flow [2022-12-11 19:06:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:06:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:06:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 893 transitions. [2022-12-11 19:06:01,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7895667550839964 [2022-12-11 19:06:01,040 INFO L175 Difference]: Start difference. First operand has 119 places, 82 transitions, 262 flow. Second operand 13 states and 893 transitions. [2022-12-11 19:06:01,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 556 flow [2022-12-11 19:06:01,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 524 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-12-11 19:06:01,046 INFO L231 Difference]: Finished difference. Result has 110 places, 83 transitions, 310 flow [2022-12-11 19:06:01,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=310, PETRI_PLACES=110, PETRI_TRANSITIONS=83} [2022-12-11 19:06:01,047 INFO L295 CegarLoopForPetriNet]: 90 programPoint places, 20 predicate places. [2022-12-11 19:06:01,048 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 83 transitions, 310 flow [2022-12-11 19:06:01,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.4) internal successors, (664), 10 states have internal predecessors, (664), 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-11 19:06:01,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:06:01,049 INFO L214 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-11 19:06:01,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:06:01,049 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-11 19:06:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:06:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1979298428, now seen corresponding path program 1 times [2022-12-11 19:06:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:06:01,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436767718] [2022-12-11 19:06:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:06:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:06:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:06:01,587 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-11 19:06:01,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:06:01,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436767718] [2022-12-11 19:06:01,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436767718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:06:01,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:06:01,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:06:01,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092448559] [2022-12-11 19:06:01,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:06:01,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:06:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:06:01,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:06:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:06:01,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 87 [2022-12-11 19:06:01,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 83 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 66.4) internal successors, (664), 10 states have internal predecessors, (664), 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-11 19:06:01,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:06:01,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 87 [2022-12-11 19:06:01,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:06:01,839 INFO L130 PetriNetUnfolder]: 69/258 cut-off events. [2022-12-11 19:06:01,839 INFO L131 PetriNetUnfolder]: For 1215/1247 co-relation queries the response was YES. [2022-12-11 19:06:01,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 258 events. 69/258 cut-off events. For 1215/1247 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 931 event pairs, 13 based on Foata normal form. 8/260 useless extension candidates. Maximal degree in co-relation 902. Up to 80 conditions per place. [2022-12-11 19:06:01,844 INFO L137 encePairwiseOnDemand]: 78/87 looper letters, 24 selfloop transitions, 7 changer transitions 19/106 dead transitions. [2022-12-11 19:06:01,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 616 flow [2022-12-11 19:06:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 19:06:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 19:06:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 824 transitions. [2022-12-11 19:06:01,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.789272030651341 [2022-12-11 19:06:01,851 INFO L175 Difference]: Start difference. First operand has 110 places, 83 transitions, 310 flow. Second operand 12 states and 824 transitions. [2022-12-11 19:06:01,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 106 transitions, 616 flow [2022-12-11 19:06:01,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 581 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-12-11 19:06:01,858 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 314 flow [2022-12-11 19:06:01,858 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=314, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2022-12-11 19:06:01,860 INFO L295 CegarLoopForPetriNet]: 90 programPoint places, 24 predicate places. [2022-12-11 19:06:01,860 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 314 flow [2022-12-11 19:06:01,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.4) internal successors, (664), 10 states have internal predecessors, (664), 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-11 19:06:01,861 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:06:01,861 INFO L214 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-11 19:06:01,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 19:06:01,861 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-11 19:06:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:06:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash 786465385, now seen corresponding path program 1 times [2022-12-11 19:06:01,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:06:01,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486534530] [2022-12-11 19:06:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:06:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:06:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:06:02,104 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-11 19:06:02,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:06:02,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486534530] [2022-12-11 19:06:02,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486534530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:06:02,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:06:02,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 19:06:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194623193] [2022-12-11 19:06:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:06:02,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 19:06:02,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:06:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 19:06:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 19:06:02,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 87 [2022-12-11 19:06:02,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 314 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-11 19:06:02,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:06:02,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 87 [2022-12-11 19:06:02,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:06:02,313 INFO L130 PetriNetUnfolder]: 154/446 cut-off events. [2022-12-11 19:06:02,313 INFO L131 PetriNetUnfolder]: For 1729/1735 co-relation queries the response was YES. [2022-12-11 19:06:02,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 446 events. 154/446 cut-off events. For 1729/1735 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2176 event pairs, 8 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 1367. Up to 89 conditions per place. [2022-12-11 19:06:02,316 INFO L137 encePairwiseOnDemand]: 78/87 looper letters, 27 selfloop transitions, 6 changer transitions 41/132 dead transitions. [2022-12-11 19:06:02,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 132 transitions, 795 flow [2022-12-11 19:06:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:06:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:06:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 724 transitions. [2022-12-11 19:06:02,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.832183908045977 [2022-12-11 19:06:02,319 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 314 flow. Second operand 10 states and 724 transitions. [2022-12-11 19:06:02,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 132 transitions, 795 flow [2022-12-11 19:06:02,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 132 transitions, 689 flow, removed 34 selfloop flow, removed 15 redundant places. [2022-12-11 19:06:02,325 INFO L231 Difference]: Finished difference. Result has 108 places, 82 transitions, 297 flow [2022-12-11 19:06:02,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=297, PETRI_PLACES=108, PETRI_TRANSITIONS=82} [2022-12-11 19:06:02,326 INFO L295 CegarLoopForPetriNet]: 90 programPoint places, 18 predicate places. [2022-12-11 19:06:02,326 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 82 transitions, 297 flow [2022-12-11 19:06:02,326 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-11 19:06:02,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:06:02,327 INFO L214 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-11 19:06:02,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 19:06:02,327 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-11 19:06:02,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:06:02,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1678099414, now seen corresponding path program 1 times [2022-12-11 19:06:02,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:06:02,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033188136] [2022-12-11 19:06:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:06:02,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:06:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:06:02,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-11 19:06:02,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:06:02,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033188136] [2022-12-11 19:06:02,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033188136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:06:02,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:06:02,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:06:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677205605] [2022-12-11 19:06:02,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:06:02,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:06:02,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:06:02,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:06:02,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:06:02,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 87 [2022-12-11 19:06:02,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 82 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 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-11 19:06:02,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:06:02,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 87 [2022-12-11 19:06:02,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:06:02,676 INFO L130 PetriNetUnfolder]: 49/223 cut-off events. [2022-12-11 19:06:02,676 INFO L131 PetriNetUnfolder]: For 461/463 co-relation queries the response was YES. [2022-12-11 19:06:02,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 223 events. 49/223 cut-off events. For 461/463 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 792 event pairs, 10 based on Foata normal form. 9/229 useless extension candidates. Maximal degree in co-relation 631. Up to 36 conditions per place. [2022-12-11 19:06:02,678 INFO L137 encePairwiseOnDemand]: 78/87 looper letters, 23 selfloop transitions, 9 changer transitions 15/105 dead transitions. [2022-12-11 19:06:02,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 105 transitions, 552 flow [2022-12-11 19:06:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 19:06:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 19:06:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 771 transitions. [2022-12-11 19:06:02,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8056426332288401 [2022-12-11 19:06:02,681 INFO L175 Difference]: Start difference. First operand has 108 places, 82 transitions, 297 flow. Second operand 11 states and 771 transitions. [2022-12-11 19:06:02,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 105 transitions, 552 flow [2022-12-11 19:06:02,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 105 transitions, 440 flow, removed 49 selfloop flow, removed 11 redundant places. [2022-12-11 19:06:02,685 INFO L231 Difference]: Finished difference. Result has 110 places, 85 transitions, 300 flow [2022-12-11 19:06:02,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=300, PETRI_PLACES=110, PETRI_TRANSITIONS=85} [2022-12-11 19:06:02,686 INFO L295 CegarLoopForPetriNet]: 90 programPoint places, 20 predicate places. [2022-12-11 19:06:02,686 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 300 flow [2022-12-11 19:06:02,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 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-11 19:06:02,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:06:02,687 INFO L214 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, 1] [2022-12-11 19:06:02,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 19:06:02,687 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-11 19:06:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:06:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash 220876703, now seen corresponding path program 1 times [2022-12-11 19:06:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:06:02,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820726088] [2022-12-11 19:06:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:06:02,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:06:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:06:03,035 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-11 19:06:03,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:06:03,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820726088] [2022-12-11 19:06:03,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820726088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:06:03,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:06:03,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:06:03,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739773381] [2022-12-11 19:06:03,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:06:03,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:06:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:06:03,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:06:03,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:06:03,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 87 [2022-12-11 19:06:03,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 85 transitions, 300 flow. Second operand has 8 states, 8 states have (on average 61.0) internal successors, (488), 8 states have internal predecessors, (488), 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-11 19:06:03,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:06:03,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 87 [2022-12-11 19:06:03,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:06:03,191 INFO L130 PetriNetUnfolder]: 19/217 cut-off events. [2022-12-11 19:06:03,192 INFO L131 PetriNetUnfolder]: For 248/255 co-relation queries the response was YES. [2022-12-11 19:06:03,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 217 events. 19/217 cut-off events. For 248/255 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 926 event pairs, 2 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 506. Up to 37 conditions per place. [2022-12-11 19:06:03,193 INFO L137 encePairwiseOnDemand]: 81/87 looper letters, 26 selfloop transitions, 1 changer transitions 17/99 dead transitions. [2022-12-11 19:06:03,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 444 flow [2022-12-11 19:06:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:06:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:06:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 443 transitions. [2022-12-11 19:06:03,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7274220032840722 [2022-12-11 19:06:03,195 INFO L175 Difference]: Start difference. First operand has 110 places, 85 transitions, 300 flow. Second operand 7 states and 443 transitions. [2022-12-11 19:06:03,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 444 flow [2022-12-11 19:06:03,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 99 transitions, 417 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-11 19:06:03,199 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 264 flow [2022-12-11 19:06:03,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=264, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2022-12-11 19:06:03,200 INFO L295 CegarLoopForPetriNet]: 90 programPoint places, 21 predicate places. [2022-12-11 19:06:03,200 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 264 flow [2022-12-11 19:06:03,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 61.0) internal successors, (488), 8 states have internal predecessors, (488), 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-11 19:06:03,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:06:03,201 INFO L214 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, 1] [2022-12-11 19:06:03,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 19:06:03,201 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-11 19:06:03,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:06:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2126530435, now seen corresponding path program 2 times [2022-12-11 19:06:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:06:03,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344252641] [2022-12-11 19:06:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:06:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:06:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:06:04,197 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-11 19:06:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:06:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344252641] [2022-12-11 19:06:04,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344252641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:06:04,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:06:04,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 19:06:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085397002] [2022-12-11 19:06:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:06:04,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:06:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:06:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:06:04,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-11 19:06:04,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 87 [2022-12-11 19:06:04,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 264 flow. Second operand has 12 states, 12 states have (on average 59.083333333333336) internal successors, (709), 12 states have internal predecessors, (709), 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-11 19:06:04,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:06:04,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 87 [2022-12-11 19:06:04,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:06:04,522 INFO L130 PetriNetUnfolder]: 7/176 cut-off events. [2022-12-11 19:06:04,523 INFO L131 PetriNetUnfolder]: For 91/93 co-relation queries the response was YES. [2022-12-11 19:06:04,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 176 events. 7/176 cut-off events. For 91/93 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 709 event pairs, 0 based on Foata normal form. 3/173 useless extension candidates. Maximal degree in co-relation 378. Up to 21 conditions per place. [2022-12-11 19:06:04,524 INFO L137 encePairwiseOnDemand]: 78/87 looper letters, 21 selfloop transitions, 5 changer transitions 8/88 dead transitions. [2022-12-11 19:06:04,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 88 transitions, 356 flow [2022-12-11 19:06:04,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 19:06:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 19:06:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 662 transitions. [2022-12-11 19:06:04,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6917450365726228 [2022-12-11 19:06:04,527 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 264 flow. Second operand 11 states and 662 transitions. [2022-12-11 19:06:04,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 88 transitions, 356 flow [2022-12-11 19:06:04,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 88 transitions, 333 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-11 19:06:04,531 INFO L231 Difference]: Finished difference. Result has 112 places, 79 transitions, 257 flow [2022-12-11 19:06:04,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=257, PETRI_PLACES=112, PETRI_TRANSITIONS=79} [2022-12-11 19:06:04,533 INFO L295 CegarLoopForPetriNet]: 90 programPoint places, 22 predicate places. [2022-12-11 19:06:04,533 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 79 transitions, 257 flow [2022-12-11 19:06:04,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 59.083333333333336) internal successors, (709), 12 states have internal predecessors, (709), 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-11 19:06:04,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:06:04,534 INFO L214 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, 1] [2022-12-11 19:06:04,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 19:06:04,534 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-11 19:06:04,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:06:04,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1929080575, now seen corresponding path program 3 times [2022-12-11 19:06:04,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:06:04,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235349420] [2022-12-11 19:06:04,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:06:04,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:06:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:06:04,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 19:06:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:06:04,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 19:06:04,624 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 19:06:04,625 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-11 19:06:04,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-11 19:06:04,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-11 19:06:04,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-11 19:06:04,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-11 19:06:04,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 19:06:04,627 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-12-11 19:06:04,632 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 19:06:04,632 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 19:06:04,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 07:06:04 BasicIcfg [2022-12-11 19:06:04,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 19:06:04,712 INFO L158 Benchmark]: Toolchain (without parser) took 8689.25ms. Allocated memory was 197.1MB in the beginning and 379.6MB in the end (delta: 182.5MB). Free memory was 172.7MB in the beginning and 229.5MB in the end (delta: -56.8MB). Peak memory consumption was 126.9MB. Max. memory is 8.0GB. [2022-12-11 19:06:04,712 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 19:06:04,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.53ms. Allocated memory is still 197.1MB. Free memory was 172.7MB in the beginning and 147.7MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-11 19:06:04,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.84ms. Allocated memory is still 197.1MB. Free memory was 147.7MB in the beginning and 145.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:06:04,713 INFO L158 Benchmark]: Boogie Preprocessor took 26.36ms. Allocated memory is still 197.1MB. Free memory was 145.1MB in the beginning and 143.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:06:04,713 INFO L158 Benchmark]: RCFGBuilder took 669.55ms. Allocated memory is still 197.1MB. Free memory was 143.3MB in the beginning and 111.5MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-11 19:06:04,714 INFO L158 Benchmark]: TraceAbstraction took 7352.07ms. Allocated memory was 197.1MB in the beginning and 379.6MB in the end (delta: 182.5MB). Free memory was 110.5MB in the beginning and 229.5MB in the end (delta: -119.0MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2022-12-11 19:06:04,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.15ms. Allocated memory is still 197.1MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 582.53ms. Allocated memory is still 197.1MB. Free memory was 172.7MB in the beginning and 147.7MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.84ms. Allocated memory is still 197.1MB. Free memory was 147.7MB in the beginning and 145.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.36ms. Allocated memory is still 197.1MB. Free memory was 145.1MB in the beginning and 143.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 669.55ms. Allocated memory is still 197.1MB. Free memory was 143.3MB in the beginning and 111.5MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7352.07ms. Allocated memory was 197.1MB in the beginning and 379.6MB in the end (delta: 182.5MB). Free memory was 110.5MB in the beginning and 229.5MB in the end (delta: -119.0MB). Peak memory consumption was 65.0MB. 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] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L716] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L717] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L718] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L719] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L720] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L721] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L722] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L723] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L724] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}] [L725] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L726] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L727] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L728] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L792] 0 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447={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] [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-1, t1447={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] [L794] 0 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, t1448={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] [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=0, t1447={5:0}, t1448={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] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1] [L742] 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) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 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 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 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, __unbuffered_p1_EAX=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=1] [L770] 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) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 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 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 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, __unbuffered_p1_EAX=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=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=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=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={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=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, 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=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 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, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={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=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 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) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=49, weak$$choice2=0, 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=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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=1] - 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: 795]: 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, 105 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: 7.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 371 mSDsluCounter, 422 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 746 IncrementalHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 83 mSDtfsCounter, 746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=4, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 2801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-11 19:06:04,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...