/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:39:50,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:39:50,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:39:50,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:39:50,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:39:50,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:39:50,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:39:50,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:39:50,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:39:50,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:39:50,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:39:50,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:39:50,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:39:50,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:39:50,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:39:50,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:39:50,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:39:50,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:39:50,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:39:50,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:39:50,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:39:50,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:39:50,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:39:50,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:39:50,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:39:50,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:39:50,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:39:50,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:39:50,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:39:50,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:39:50,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:39:50,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:39:50,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:39:50,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:39:50,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:39:50,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:39:50,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:39:50,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:39:50,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:39:50,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:39:50,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:39:50,456 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-SemanticLbe.epf [2022-12-12 21:39:50,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:39:50,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:39:50,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:39:50,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:39:50,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:39:50,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:39:50,487 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:39:50,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:39:50,487 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:39:50,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:39:50,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:39:50,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:39:50,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:39:50,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:39:50,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:39:50,488 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:39:50,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:39:50,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:39:50,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:39:50,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:39:50,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:39:50,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:39:50,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:39:50,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:39:50,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:39:50,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:39:50,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:39:50,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:39:50,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:39:50,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:39:50,490 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:39:50,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:39:50,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:39:50,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:39:50,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:39:50,812 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:39:50,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:39:51,902 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:39:52,158 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:39:52,159 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:39:52,168 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc41d6b9/f1a0b9af20704034bbf6ac5437a8f70c/FLAG4b813af0b [2022-12-12 21:39:52,181 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc41d6b9/f1a0b9af20704034bbf6ac5437a8f70c [2022-12-12 21:39:52,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:39:52,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:39:52,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:39:52,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:39:52,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:39:52,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e20e329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52, skipping insertion in model container [2022-12-12 21:39:52,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:39:52,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:39:52,320 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/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-12 21:39:52,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:39:52,536 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:39:52,545 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/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-12 21:39:52,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:52,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:52,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:39:52,636 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:39:52,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52 WrapperNode [2022-12-12 21:39:52,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:39:52,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:39:52,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:39:52,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:39:52,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,689 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-12-12 21:39:52,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:39:52,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:39:52,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:39:52,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:39:52,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,711 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:39:52,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:39:52,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:39:52,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:39:52,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (1/1) ... [2022-12-12 21:39:52,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:39:52,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:39:52,741 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-12 21:39:52,763 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-12 21:39:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:39:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:39:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:39:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:39:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:39:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:39:52,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:39:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:39:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:39:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:39:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:39:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:39:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:39:52,791 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:39:52,929 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:39:52,931 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:39:53,174 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:39:53,275 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:39:53,276 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:39:53,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:39:53 BoogieIcfgContainer [2022-12-12 21:39:53,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:39:53,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:39:53,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:39:53,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:39:53,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:39:52" (1/3) ... [2022-12-12 21:39:53,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c756ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:39:53, skipping insertion in model container [2022-12-12 21:39:53,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:52" (2/3) ... [2022-12-12 21:39:53,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c756ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:39:53, skipping insertion in model container [2022-12-12 21:39:53,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:39:53" (3/3) ... [2022-12-12 21:39:53,284 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:39:53,298 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:39:53,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:39:53,298 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:39:53,349 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:39:53,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-12 21:39:53,432 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-12 21:39:53,432 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:53,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-12 21:39:53,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-12 21:39:53,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-12 21:39:53,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:39:53,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-12 21:39:53,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-12 21:39:53,489 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-12 21:39:53,489 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:53,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-12 21:39:53,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-12 21:39:53,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-12 21:40:00,184 INFO L241 LiptonReduction]: Total number of compositions: 72 [2022-12-12 21:40:00,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:40:00,211 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;@29886d58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:40:00,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 21:40:00,214 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-12 21:40:00,214 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:40:00,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:00,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 21:40:00,215 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-12 21:40:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 409094814, now seen corresponding path program 1 times [2022-12-12 21:40:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:00,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081879396] [2022-12-12 21:40:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:00,534 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-12 21:40:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:00,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081879396] [2022-12-12 21:40:00,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081879396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:00,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:00,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:40:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71103474] [2022-12-12 21:40:00,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:00,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:40:00,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:40:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:40:00,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2022-12-12 21:40:00,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-12 21:40:00,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:00,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2022-12-12 21:40:00,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:00,919 INFO L130 PetriNetUnfolder]: 944/2046 cut-off events. [2022-12-12 21:40:00,919 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 21:40:00,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 2046 events. 944/2046 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14990 event pairs, 100 based on Foata normal form. 0/1303 useless extension candidates. Maximal degree in co-relation 3607. Up to 1325 conditions per place. [2022-12-12 21:40:00,929 INFO L137 encePairwiseOnDemand]: 42/46 looper letters, 20 selfloop transitions, 2 changer transitions 40/71 dead transitions. [2022-12-12 21:40:00,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 272 flow [2022-12-12 21:40:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:40:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:40:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-12-12 21:40:00,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-12 21:40:00,942 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2022-12-12 21:40:00,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 71 transitions, 272 flow [2022-12-12 21:40:00,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 112 flow [2022-12-12 21:40:00,948 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 112 flow [2022-12-12 21:40:00,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-12 21:40:00,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:00,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:00,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:40:00,949 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-12 21:40:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1996801337, now seen corresponding path program 1 times [2022-12-12 21:40:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:00,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76498911] [2022-12-12 21:40:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:00,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:01,165 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-12 21:40:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76498911] [2022-12-12 21:40:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76498911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:01,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:40:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121477299] [2022-12-12 21:40:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:01,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:40:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:40:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:40:01,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 46 [2022-12-12 21:40:01,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12 21:40:01,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:01,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 46 [2022-12-12 21:40:01,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:01,231 INFO L130 PetriNetUnfolder]: 233/435 cut-off events. [2022-12-12 21:40:01,231 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-12 21:40:01,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 435 events. 233/435 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1833 event pairs, 8 based on Foata normal form. 2/383 useless extension candidates. Maximal degree in co-relation 1184. Up to 392 conditions per place. [2022-12-12 21:40:01,234 INFO L137 encePairwiseOnDemand]: 42/46 looper letters, 30 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-12-12 21:40:01,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 217 flow [2022-12-12 21:40:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:40:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:40:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-12 21:40:01,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3188405797101449 [2022-12-12 21:40:01,237 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -18 predicate places. [2022-12-12 21:40:01,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 40 transitions, 217 flow [2022-12-12 21:40:01,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 40 transitions, 217 flow [2022-12-12 21:40:01,239 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 40 transitions, 217 flow [2022-12-12 21:40:01,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12 21:40:01,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:01,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:01,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:40:01,240 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-12 21:40:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1771299256, now seen corresponding path program 1 times [2022-12-12 21:40:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:01,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674394652] [2022-12-12 21:40:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:01,627 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-12 21:40:01,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:01,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674394652] [2022-12-12 21:40:01,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674394652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:01,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:01,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:40:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567597815] [2022-12-12 21:40:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:01,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:40:01,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:01,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:40:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:40:01,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-12 21:40:01,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 40 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12 21:40:01,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:01,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-12 21:40:01,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:01,728 INFO L130 PetriNetUnfolder]: 270/495 cut-off events. [2022-12-12 21:40:01,729 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-12 21:40:01,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 495 events. 270/495 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2013 event pairs, 21 based on Foata normal form. 28/466 useless extension candidates. Maximal degree in co-relation 1780. Up to 424 conditions per place. [2022-12-12 21:40:01,732 INFO L137 encePairwiseOnDemand]: 39/46 looper letters, 43 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2022-12-12 21:40:01,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 391 flow [2022-12-12 21:40:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:40:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:40:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-12 21:40:01,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30434782608695654 [2022-12-12 21:40:01,733 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -15 predicate places. [2022-12-12 21:40:01,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 54 transitions, 391 flow [2022-12-12 21:40:01,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 54 transitions, 391 flow [2022-12-12 21:40:01,736 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 54 transitions, 391 flow [2022-12-12 21:40:01,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12 21:40:01,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:01,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:01,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:40:01,737 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-12 21:40:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash -261995018, now seen corresponding path program 1 times [2022-12-12 21:40:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:01,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893054174] [2022-12-12 21:40:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:02,012 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-12 21:40:02,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:02,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893054174] [2022-12-12 21:40:02,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893054174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:02,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:02,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455808916] [2022-12-12 21:40:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:02,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:40:02,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:02,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:40:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:40:02,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-12 21:40:02,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 54 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-12 21:40:02,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:02,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-12 21:40:02,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:02,175 INFO L130 PetriNetUnfolder]: 416/776 cut-off events. [2022-12-12 21:40:02,175 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-12-12 21:40:02,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3488 conditions, 776 events. 416/776 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3735 event pairs, 19 based on Foata normal form. 24/705 useless extension candidates. Maximal degree in co-relation 3469. Up to 660 conditions per place. [2022-12-12 21:40:02,180 INFO L137 encePairwiseOnDemand]: 36/46 looper letters, 44 selfloop transitions, 14 changer transitions 25/87 dead transitions. [2022-12-12 21:40:02,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 87 transitions, 797 flow [2022-12-12 21:40:02,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:40:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:40:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-12 21:40:02,183 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-12 21:40:02,184 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2022-12-12 21:40:02,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 87 transitions, 797 flow [2022-12-12 21:40:02,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 62 transitions, 566 flow [2022-12-12 21:40:02,188 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 62 transitions, 566 flow [2022-12-12 21:40:02,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-12 21:40:02,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:02,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:02,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:40:02,189 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-12 21:40:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1268727011, now seen corresponding path program 1 times [2022-12-12 21:40:02,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:02,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566243419] [2022-12-12 21:40:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:02,637 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-12 21:40:02,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:02,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566243419] [2022-12-12 21:40:02,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566243419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:02,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:02,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459514971] [2022-12-12 21:40:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:02,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:40:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:02,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:40:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:40:02,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-12 21:40:02,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 62 transitions, 566 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-12 21:40:02,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:02,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-12 21:40:02,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:02,742 INFO L130 PetriNetUnfolder]: 228/429 cut-off events. [2022-12-12 21:40:02,743 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-12-12 21:40:02,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 429 events. 228/429 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1771 event pairs, 12 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 2308. Up to 363 conditions per place. [2022-12-12 21:40:02,746 INFO L137 encePairwiseOnDemand]: 39/46 looper letters, 69 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2022-12-12 21:40:02,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 1050 flow [2022-12-12 21:40:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-12 21:40:02,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26521739130434785 [2022-12-12 21:40:02,748 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2022-12-12 21:40:02,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 94 transitions, 1050 flow [2022-12-12 21:40:02,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 94 transitions, 1050 flow [2022-12-12 21:40:02,751 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 94 transitions, 1050 flow [2022-12-12 21:40:02,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-12 21:40:02,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:02,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:02,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:40:02,752 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-12 21:40:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:02,752 INFO L85 PathProgramCache]: Analyzing trace with hash 678308469, now seen corresponding path program 1 times [2022-12-12 21:40:02,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:02,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191159883] [2022-12-12 21:40:02,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:02,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:02,872 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-12 21:40:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:02,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191159883] [2022-12-12 21:40:02,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191159883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:02,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:02,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:02,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210914871] [2022-12-12 21:40:02,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:02,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:40:02,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:40:02,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:40:02,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 46 [2022-12-12 21:40:02,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 94 transitions, 1050 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-12 21:40:02,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:02,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 46 [2022-12-12 21:40:02,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:02,970 INFO L130 PetriNetUnfolder]: 294/567 cut-off events. [2022-12-12 21:40:02,970 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-12 21:40:02,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 567 events. 294/567 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2669 event pairs, 48 based on Foata normal form. 19/508 useless extension candidates. Maximal degree in co-relation 3525. Up to 476 conditions per place. [2022-12-12 21:40:02,974 INFO L137 encePairwiseOnDemand]: 43/46 looper letters, 39 selfloop transitions, 3 changer transitions 57/105 dead transitions. [2022-12-12 21:40:02,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 105 transitions, 1374 flow [2022-12-12 21:40:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:40:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:40:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-12 21:40:02,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-12 21:40:02,976 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-12-12 21:40:02,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 105 transitions, 1374 flow [2022-12-12 21:40:02,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 48 transitions, 612 flow [2022-12-12 21:40:02,979 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 48 transitions, 612 flow [2022-12-12 21:40:02,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-12 21:40:02,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:02,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:02,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:40:02,979 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-12 21:40:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash 675829089, now seen corresponding path program 2 times [2022-12-12 21:40:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:02,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222992103] [2022-12-12 21:40:02,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:02,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:03,101 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-12 21:40:03,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:03,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222992103] [2022-12-12 21:40:03,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222992103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:03,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:03,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:40:03,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910047023] [2022-12-12 21:40:03,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:03,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:40:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:03,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:40:03,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:40:03,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2022-12-12 21:40:03,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 48 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 21:40:03,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:03,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2022-12-12 21:40:03,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:03,159 INFO L130 PetriNetUnfolder]: 110/232 cut-off events. [2022-12-12 21:40:03,159 INFO L131 PetriNetUnfolder]: For 459/459 co-relation queries the response was YES. [2022-12-12 21:40:03,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 232 events. 110/232 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 897 event pairs, 27 based on Foata normal form. 12/214 useless extension candidates. Maximal degree in co-relation 1590. Up to 202 conditions per place. [2022-12-12 21:40:03,175 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 26 selfloop transitions, 9 changer transitions 1/42 dead transitions. [2022-12-12 21:40:03,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 574 flow [2022-12-12 21:40:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:40:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:40:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-12 21:40:03,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-12 21:40:03,178 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-12-12 21:40:03,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 42 transitions, 574 flow [2022-12-12 21:40:03,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 41 transitions, 572 flow [2022-12-12 21:40:03,180 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 572 flow [2022-12-12 21:40:03,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 21:40:03,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:03,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:03,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:40:03,180 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-12 21:40:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -299184540, now seen corresponding path program 1 times [2022-12-12 21:40:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:03,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507992709] [2022-12-12 21:40:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:03,298 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-12 21:40:03,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507992709] [2022-12-12 21:40:03,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507992709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:03,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:03,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586190407] [2022-12-12 21:40:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:40:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:40:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:40:03,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2022-12-12 21:40:03,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-12 21:40:03,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:03,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2022-12-12 21:40:03,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:03,348 INFO L130 PetriNetUnfolder]: 23/92 cut-off events. [2022-12-12 21:40:03,349 INFO L131 PetriNetUnfolder]: For 354/360 co-relation queries the response was YES. [2022-12-12 21:40:03,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 92 events. 23/92 cut-off events. For 354/360 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 302 event pairs, 2 based on Foata normal form. 24/104 useless extension candidates. Maximal degree in co-relation 709. Up to 73 conditions per place. [2022-12-12 21:40:03,350 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 18 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2022-12-12 21:40:03,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 606 flow [2022-12-12 21:40:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:40:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:40:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-12 21:40:03,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29891304347826086 [2022-12-12 21:40:03,352 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2022-12-12 21:40:03,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 39 transitions, 606 flow [2022-12-12 21:40:03,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 606 flow [2022-12-12 21:40:03,353 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 606 flow [2022-12-12 21:40:03,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-12 21:40:03,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:03,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:03,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:40:03,355 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-12 21:40:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:03,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1924275597, now seen corresponding path program 1 times [2022-12-12 21:40:03,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:03,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061457561] [2022-12-12 21:40:03,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:03,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:04,317 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-12 21:40:04,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:04,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061457561] [2022-12-12 21:40:04,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061457561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:04,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:04,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:40:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526493354] [2022-12-12 21:40:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:04,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:40:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:40:04,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:40:04,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-12 21:40:04,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 606 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-12 21:40:04,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:04,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-12 21:40:04,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:04,444 INFO L130 PetriNetUnfolder]: 34/141 cut-off events. [2022-12-12 21:40:04,444 INFO L131 PetriNetUnfolder]: For 435/436 co-relation queries the response was YES. [2022-12-12 21:40:04,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 141 events. 34/141 cut-off events. For 435/436 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 651 event pairs, 0 based on Foata normal form. 10/130 useless extension candidates. Maximal degree in co-relation 1214. Up to 120 conditions per place. [2022-12-12 21:40:04,445 INFO L137 encePairwiseOnDemand]: 40/46 looper letters, 22 selfloop transitions, 5 changer transitions 21/53 dead transitions. [2022-12-12 21:40:04,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 954 flow [2022-12-12 21:40:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:40:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:40:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-12 21:40:04,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-12 21:40:04,447 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-12-12 21:40:04,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 53 transitions, 954 flow [2022-12-12 21:40:04,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 32 transitions, 544 flow [2022-12-12 21:40:04,448 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 544 flow [2022-12-12 21:40:04,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-12 21:40:04,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:04,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:04,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:40:04,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 21:40:04,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1244243948, now seen corresponding path program 1 times [2022-12-12 21:40:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:04,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828263869] [2022-12-12 21:40:04,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:40:04,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:40:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:40:04,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:40:04,513 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:40:04,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 21:40:04,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 21:40:04,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 21:40:04,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 21:40:04,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 21:40:04,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:40:04,516 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:04,521 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:40:04,521 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:40:04,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:40:04 BasicIcfg [2022-12-12 21:40:04,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:40:04,559 INFO L158 Benchmark]: Toolchain (without parser) took 12375.60ms. Allocated memory was 211.8MB in the beginning and 459.3MB in the end (delta: 247.5MB). Free memory was 185.8MB in the beginning and 191.5MB in the end (delta: -5.7MB). Peak memory consumption was 242.8MB. Max. memory is 8.0GB. [2022-12-12 21:40:04,560 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 187.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:40:04,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.97ms. Allocated memory is still 211.8MB. Free memory was 185.8MB in the beginning and 160.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 21:40:04,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.48ms. Allocated memory is still 211.8MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:40:04,560 INFO L158 Benchmark]: Boogie Preprocessor took 26.69ms. Allocated memory is still 211.8MB. Free memory was 158.0MB in the beginning and 156.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:40:04,560 INFO L158 Benchmark]: RCFGBuilder took 560.26ms. Allocated memory is still 211.8MB. Free memory was 156.4MB in the beginning and 125.5MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 21:40:04,561 INFO L158 Benchmark]: TraceAbstraction took 11279.69ms. Allocated memory was 211.8MB in the beginning and 459.3MB in the end (delta: 247.5MB). Free memory was 123.9MB in the beginning and 191.5MB in the end (delta: -67.6MB). Peak memory consumption was 181.0MB. Max. memory is 8.0GB. [2022-12-12 21:40:04,562 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.09ms. Allocated memory is still 211.8MB. Free memory is still 187.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 451.97ms. Allocated memory is still 211.8MB. Free memory was 185.8MB in the beginning and 160.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.48ms. Allocated memory is still 211.8MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.69ms. Allocated memory is still 211.8MB. Free memory was 158.0MB in the beginning and 156.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 560.26ms. Allocated memory is still 211.8MB. Free memory was 156.4MB in the beginning and 125.5MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 11279.69ms. Allocated memory was 211.8MB in the beginning and 459.3MB in the end (delta: 247.5MB). Free memory was 123.9MB in the beginning and 191.5MB in the end (delta: -67.6MB). Peak memory consumption was 181.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 93 PlacesBefore, 53 PlacesAfterwards, 88 TransitionsBefore, 46 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 72 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2133, independent: 1931, independent conditional: 1931, independent unconditional: 0, dependent: 202, dependent conditional: 202, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2133, independent: 1931, independent conditional: 0, independent unconditional: 1931, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2133, independent: 1931, independent conditional: 0, independent unconditional: 1931, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2133, independent: 1931, independent conditional: 0, independent unconditional: 1931, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1082, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1082, independent: 1007, independent conditional: 0, independent unconditional: 1007, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2133, independent: 906, independent conditional: 0, independent unconditional: 906, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1082, unknown conditional: 0, unknown unconditional: 1082] , Statistics on independence cache: Total cache size (in pairs): 2185, Positive cache size: 2128, Positive conditional cache size: 0, Positive unconditional cache size: 2128, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=-2, t1587={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] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=-1, t1587={5:0}, t1588={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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 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) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 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 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 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=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 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) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 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=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 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) [L821] 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)) [L822] 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)) [L823] 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)) [L824] 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)) [L825] 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)) [L826] 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)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 801]: 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, 110 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: 11.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 457 IncrementalHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 22 mSDtfsCounter, 457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1050occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1565 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 1009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-12 21:40:04,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...